Johan Ostman

Johan Ostman

Auto-generated profile, based on publicly available information

Johan Ostman

AI Sweden, Gothenburg, Sweden

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 October 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JOJohan Ostman
Johan Ostman
GDGiuseppe Durisi
Giuseppe Durisi
ESErik G. Ström
Erik G. Ström
MCMustafa C. Coskun
Mustafa C. Coskun
GLGianluigi Liva
Gianluigi Liva
We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability.We focus on the practically relevant scenario in which there is no a priori channel state information available at the transmitter and at the receiver. An upper bound built upon the min-max converse is compared to two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver; the second one employs pilot-assisted transmission (PAT) followed by maximum-likelihood channel estimation and scaled mismatched nearest-neighbor decoding at the receiver. Our bounds are tight enough to unveil the optimum number of diversity branches that a packet should span so that the energy per bit required to achieve a target packet error probability is minimized, for a given constraint on the code rate and the packet size. Furthermore, the bounds reveal that noncoherent transmission is more energy efficient than PAT, even when the number of pilot symbols and their power is optimized. For example, in Rayleigh fading, for the case when a coded packet of 168 symbols is transmitted using a channel code of rate 0.48 bits/channel use, over a block-fading channel with block size equal to 8 symbols, PAT requires an additional 1.2 dB of energy per information bit to achieve a packet error probability of 10–3 compared to a suitably designed noncoherent transmission scheme. Finally, we devise a PAT scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics decoding, whose performance is close (1 dB gap at 10–3 packet error probability) to the ones predicted by our PAT lower bound. This shows that the PAT lower bound provides useful guidelines on the design of actual PAT schemes.

26 April 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JOJohan Ostman
Johan Ostman
ALAlejandro Lancho
Alejandro Lancho
GDGiuseppe Durisi
Giuseppe Durisi
LSLuca Sanguinetti
Luca Sanguinetti
The fast adoption of Massive MIMO for high-throughput communications was enabled by many research contributions mostly relying on infinite-blocklength information-theoretic bounds. This makes it hard to assess the suitability of Massive MIMO for ultra-reliable low-latency communications (URLLC) operating with short-blocklength codes. This paper provides a rigorous framework for the characterization and numerical evaluation (using the saddlepoint approximation) of the error probability achievable in the uplink and downlink of Massive MIMO at finite blocklength. The framework encompasses imperfect channel state information, pilot contamination, spatially correlated channels, and arbitrary linear spatial processing. In line with previous results based on infinite-blocklength bounds, we prove that, with minimum mean-square error (MMSE) processing and spatially correlated channels, the error probability at finite blocklength goes to zero as the number $M$ of antennas grows to infinity, even under pilot contamination. However, numerical results for a practical URLLC network setup involving a base station with $M=100$ antennas, show that a target error probability of 10 −5 can be achieved with MMSE processing, uniformly over each cell, only if orthogonal pilot sequences are assigned to all the users in the network. Maximum ratio processing does not suffice.

20 April 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ALAlejandro Lancho
Alejandro Lancho
JOJohan Ostman
Johan Ostman
GDGiuseppe Durisi
Giuseppe Durisi
TKTobias Koch
Tobias Koch
GVGonzalo Vazquez-Vilar
Gonzalo Vazquez-Vilar
In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained attention in the information theory literature. While these bounds are accurate for many scenarios of interest, they need to be evaluated numerically for most wireless channels of practical interest, and their evaluation is computationally demanding. This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels. These approximations can be calculated efficiently and are shown to be accurate for SNR values as small as 0 dB and blocklengths of 168 channel uses or more.

10 February 2025 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Open access
MXMarvin Xhemrishi
Marvin Xhemrishi
JÖJohan Östman
Johan Östman
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
Alexandre Graell i AmatAlexandre Graell i Amat
Alexandre Graell i Amat
Federated learning (FL) has emerged as a promising approach for collaboratively training machine learning models while preserving data privacy. Due to its decentralized nature, FL is vulnerable to poisoning attacks, where malicious clients compromise the global model through altered data or updates. Identifying such malicious clients is crucial for ensuring the integrity of FL systems. This task becomes particularly challenging under privacy-enhancing protocols such as secure aggregation, creating a fundamental trade-off between privacy and security. In this work, we propose FedGT, a novel framework designed to identify malicious clients in FL with secure aggregation while preserving privacy. Drawing inspiration from group testing, FedGT leverages overlapping groups of clients to identify the presence of malicious clients via a decoding operation. The clients identified as malicious are then removed from the model training, which is performed over the remaining clients. By choosing the size, number, and overlap between groups, FedGT strikes a balance between privacy and security. Specifically, the server learns the aggregated model of the clients in each group—vanilla federated learning and secure aggregation correspond to the extreme cases of FedGT with group size equal to one and the total number of clients, respectively. The effectiveness of FedGT is demonstrated through extensive experiments on three datasets in a cross-silo setting under different data-poisoning attacks. These experiments showcase FedGT’s ability to identify malicious clients, resulting in high model utility. We further show that FedGT significantly outperforms the private robust aggregation approach based on the geometric median recently proposed by Pillutla et al. and the robust aggregation technique Multi-Krum in multiple settings.

22 September 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JOJohan Ostman
Johan Ostman
RDRahul Devassy
Rahul Devassy
GDGiuseppe Durisi
Giuseppe Durisi
ESErik G. Ström
Erik G. Ström
We present an upper bound on the error probability achievable using variable-length stop feedback (VLSF) codes, for a fixed size of the information payload and a given constraint on the maximum latency and the average service time. Differently from the bound proposed in Polyanskiy et al. (2011), which pertains to the scenario in which the stop signal is sent over a noiseless feedback channel, our bound applies to the practically relevant setup in which the feedback link is noisy. Numerical evaluation of our bound suggests that, for fixed latency and reliability constraints, noise in the feedback link may increase the minimum average service time for the VLSF scheme considered in this paper, to the extent that fixed-length codes without feedback may be preferable in some scenarios.

26 March 2025 in Journal of Cheminformatics
Verified
Journal Article
Open access
PDF file
FKFabian P. Krüger
Fabian P. Krüger
JÖJohan Östman
Johan Östman
LMLewis Mervin
Lewis Mervin
Igor V. TetkoIgor V. Tetko
Igor V. Tetko
OEOla Engkvist
Ola Engkvist
This study investigates the risks of exposing confidential chemical structures when machine learning models trained on these structures are made publicly available. We use membership inference attacks, a common method to assess privacy that is largely unexplored in the context of drug discovery, to examine neural networks for molecular property prediction in a black-box setting. Our results reveal significant privacy risks across all evaluated datasets and neural network architectures. Combining multiple attacks increases these risks. Molecules from minority classes, often the most valuable in drug discovery, are particularly vulnerable. We also found that representing molecules as graphs and using message-passing neural networks may mitigate these risks. We provide a framework to assess privacy risks of classification models and molecular representations, available at https://github.com/FabianKruger/molprivacy. Our findings highlight the need for careful consideration when sharing neural networks trained on proprietary chemical structures, informing organisations and researchers about the trade-offs between data confidentiality and model openness.