Anders Jonsson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anders Jonsson has a total of 99 co-authors. Here are the top co-authors by number of shared publications:
- Francesc Wilhelmi
Department of Engineering, Universitat Pompeu Fabra, Barcelona, Spain
8 shared publications - Boris Bellalta
Department of Engineering, Universitat Pompeu Fabra, Barcelona, Spain
7 shared publications - Javier Segovia-Aguas
Universitat Pompeu Fabra
6 shared publications - Cristina Cano
Universitat Oberta de Catalunya, Barcelona, Spain
5 shared publications - Vicenç Gómez
Universitat Pompeu Fabra, Barcelona, Spain
5 shared publications - Angel Lozano
Universitat Pompeu Fabra, Barcelona, Spain
4 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 125904-125922
Learning-Based Channel Access in Wi-Fi: A Multi-Armed Bandit Approach
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 125904-125922
Open AccessLearning-Based Channel Access in Wi-Fi: A Multi-Armed Bandit Approach
- Open Access
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 141814-141831
Toward Specialized Wireless Networks Using an ML-Driven Radio Interface
Future wireless networks will need to support diverse applications (such as extended reality), scenarios (such as fully automated industries), and technological advances (such as terahertz communications). Current wireless networks are designed to perform adequately across multiple scenarios so they lack the adaptability needed for specific use cases. Therefore, meeting the stringent requirements of next-generation applications incorporating technology advances and operating in novel scenarios will necessitate wireless specialized networks which we refer to as SpecNets. These networks, equipped with cognitive capabilities, dynamically adapt to the unique demands of each application, e.g., by automatically selecting and configuring network mechanisms. An enabler of SpecNets are the recent advances in artificial intelligence and machine learning (AI/ML), which allow to continuously learn and react to changing requirements and scenarios. By integrating AI/ML functionalities, SpecNets will fully leverage the concept of AI/ML-defined radios (MLDRs) that are able to autonomously establish their own communication protocols by acquiring contextual information and dynamically adapting to it. In this paper, we introduce SpecNets and explain how MLDR interfaces enable this concept. We present three illustrative use cases for wireless local area networks (WLANs): bespoke industrial networks, traffic-aware robust THz links, and coexisting networks. Finally, we showcase SpecNets’ benefits in the industrial use case by introducing a lightweight, fast-converging ML agent based on multi-armed bandits (MABs). This agent dynamically optimizes channel access to meet varying performance needs: high throughput, low delay, or fair access. Results demonstrate significant gains over IEEE 802.11, highlighting the system’s autonomous adaptability across diverse scenarios.
- 11 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 141814-141831
Open AccessToward Specialized Wireless Networks Using an ML-Driven Radio Interface
Future wireless networks will need to support diverse applications (such as extended reality), scenarios (such as fully automated industries), and technological advances (such as terahertz communications). Current wireless networks are designed to perform adequately across multiple scenarios so they lack the adaptability needed for specific use cases. Therefore, meeting the stringent requirements of next-generation applications incorporating technology advances and operating in novel scenarios will necessitate wireless specialized networks which we refer to as SpecNets. These networks, equipped with cognitive capabilities, dynamically adapt to the unique demands of each application, e.g., by automatically selecting and configuring network mechanisms. An enabler of SpecNets are the recent advances in artificial intelligence and machine learning (AI/ML), which allow to continuously learn and react to changing requirements and scenarios. By integrating AI/ML functionalities, SpecNets will fully leverage the concept of AI/ML-defined radios (MLDRs) that are able to autonomously establish their own communication protocols by acquiring contextual information and dynamically adapting to it. In this paper, we introduce SpecNets and explain how MLDR interfaces enable this concept. We present three illustrative use cases for wireless local area networks (WLANs): bespoke industrial networks, traffic-aware robust THz links, and coexisting networks. Finally, we showcase SpecNets’ benefits in the industrial use case by introducing a lightweight, fast-converging ML agent based on multi-armed bandits (MABs). This agent dynamically optimizes channel access to meet varying performance needs: high throughput, low delay, or fair access. Results demonstrate significant gains over IEEE 802.11, highlighting the system’s autonomous adaptability across diverse scenarios.
- Open Access
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 6477-6490
XR Streaming Performance With Wi-Fi 7 Multi-Link Operation
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 6477-6490
Open AccessXR Streaming Performance With Wi-Fi 7 Multi-Link Operation
- Open Access
Distances for Markov chains from sample streams
Bisimulation metrics are powerful tools for measuring similarities between stochastic processes, and specifically Markov chains. Recent advances have uncovered that bisimulation metrics are, in fact, optimal-transport distances, which has enabled the development of fast algorithms for computing such metrics with provable accuracy and runtime guarantees. However, these recent methods, as well as all previously known methods, assume full knowledge of the transition dynamics. This is often an impractical assumption in most real-world scenarios, where typically only sample trajectories are available. In this work, we propose a stochastic optimization method that addresses this limitation and estimates bisimulation metrics based on sample access, without requiring explicit transition models. Our approach is derived from a new linear programming (LP) formulation of bisimulation metrics, which we solve using a stochastic primal-dual optimization method. We provide theoretical guarantees on the sample complexity of the algorithm and validate its effectiveness through a series of empirical evaluations.
Open AccessDistances for Markov chains from sample streams
Bisimulation metrics are powerful tools for measuring similarities between stochastic processes, and specifically Markov chains. Recent advances have uncovered that bisimulation metrics are, in fact, optimal-transport distances, which has enabled the development of fast algorithms for computing such metrics with provable accuracy and runtime guarantees. However, these recent methods, as well as all previously known methods, assume full knowledge of the transition dynamics. This is often an impractical assumption in most real-world scenarios, where typically only sample trajectories are available. In this work, we propose a stochastic optimization method that addresses this limitation and estimates bisimulation metrics based on sample access, without requiring explicit transition models. Our approach is derived from a new linear programming (LP) formulation of bisimulation metrics, which we solve using a stochastic primal-dual optimization method. We provide theoretical guarantees on the sample complexity of the algorithm and validate its effectiveness through a series of empirical evaluations.
- Open Access
Tractable Offline Learning of Regular Decision Processes
This work studies offline Reinforcement Learning (RL) in a class of non-Markovian environments called Regular Decision Processes (RDPs). In RDPs, the unknown dependency of future observations and rewards from the past interactions can be captured by some hidden finite-state automaton. For this reason, many RDP algorithms first reconstruct this unknown dependency using automata learning techniques. In this paper, we show that it is possible to overcome two strong limitations of previous offline RL algorithms for RDPs, notably RegORL. This can be accomplished via the introduction of two original techniques: the development of a new pseudometric based on formal languages, which removes a problematic dependency on $L_\infty^\mathsf{p}$-distinguishability parameters, and the adoption of Count-Min-Sketch (CMS), instead of naive counting. The former reduces the number of samples required in environments that are characterized by a low complexity in language-theoretic terms. The latter alleviates the memory requirements for long planning horizons. We derive the PAC sample complexity bounds associated to each of these techniques, and we validate the approach experimentally.
Open AccessTractable Offline Learning of Regular Decision Processes
This work studies offline Reinforcement Learning (RL) in a class of non-Markovian environments called Regular Decision Processes (RDPs). In RDPs, the unknown dependency of future observations and rewards from the past interactions can be captured by some hidden finite-state automaton. For this reason, many RDP algorithms first reconstruct this unknown dependency using automata learning techniques. In this paper, we show that it is possible to overcome two strong limitations of previous offline RL algorithms for RDPs, notably RegORL. This can be accomplished via the introduction of two original techniques: the development of a new pseudometric based on formal languages, which removes a problematic dependency on $L_\infty^\mathsf{p}$-distinguishability parameters, and the adoption of Count-Min-Sketch (CMS), instead of naive counting. The former reduces the number of samples required in environments that are characterized by a low complexity in language-theoretic terms. The latter alleviates the memory requirements for long planning horizons. We derive the PAC sample complexity bounds associated to each of these techniques, and we validate the approach experimentally.
- Open Access
- 11 March 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 133
Spatial air quality prediction in urban areas via message passing
- 11 March 2024
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 133
Open AccessSpatial air quality prediction in urban areas via message passing
- Open Access
Asymmetric Norms to Approximate the Minimum Action Distance
This paper presents a state representation for reward-free Markov decision processes. The idea is to learn, in a self-supervised manner, an embedding space where distances between pairs of embedded states correspond to the minimum number of actions needed to transition between them. Unlike previous methods, our approach incorporates an asymmetric norm parametrization, enabling accurate approximations of minimum action distances in environments with inherent asymmetry. We show how this representation can be leveraged to learn goal-conditioned policies, providing a notion of similarity between states and goals and a useful heuristic distance to guide planning. To validate our approach, we conduct empirical experiments on both symmetric and asymmetric environments. Our results show that our asymmetric norm parametrization performs comparably to symmetric norms in symmetric environments and surpasses symmetric norms in asymmetric environments.
Open AccessAsymmetric Norms to Approximate the Minimum Action Distance
This paper presents a state representation for reward-free Markov decision processes. The idea is to learn, in a self-supervised manner, an embedding space where distances between pairs of embedded states correspond to the minimum number of actions needed to transition between them. Unlike previous methods, our approach incorporates an asymmetric norm parametrization, enabling accurate approximations of minimum action distances in environments with inherent asymmetry. We show how this representation can be leveraged to learn goal-conditioned policies, providing a notion of similarity between states and goals and a useful heuristic distance to guide planning. To validate our approach, we conduct empirical experiments on both symmetric and asymmetric environments. Our results show that our asymmetric norm parametrization performs comparably to symmetric norms in symmetric environments and surpasses symmetric norms in asymmetric environments.
- Open Access
- 19 June 2023
- Published by Oxford University Press (OUP) in European Heart Journal - Cardiovascular Imaging
- Vol. 24 (Supplement)
Machine learning for the generation of personalized image analysis protocol in echocardiography: a pilot study in arterial hypertension
Funding Acknowledgements: Type of funding sources: Public grant(s) – National budget only. Main funding source(s): Agence National de la Recherche Europian Union-NextGenerationEU. Background: Current workflow in cardiac imaging is based on protocols meant to capture a set of predefined images for a certain condition [1]. Although standardized, such approaches are not personalized, and are often time- and resource-ineffective. Reinforcement learning (RL), a subfield of machine learning that addresses decision making [2], can be used to incorporate complex, whole cardiac cycle imaging data, while optimizing costs associated to data acquisition and processing – including economy, patient safety/comfort and examination time. Our aim is to demonstrate the viability of RL to create a personalized, resource-effective data analysis routine from echocardiography to separate remodelling in arterial hypertension from normal cardiac function. Methods: An echo study was performed in 189 clinically managed hypertensive (HTN) patients, and 60 non-hypertensive healthy control subjects [3]. Speckle-tracking analysis of the left ventricle was performed and deformation curves extracted. Aortic and mitral flow pulsed-wave (PW) Doppler and septal basal tissue PW Doppler velocity profiles were obtained. These whole cardiac cycle deformation and velocity curves were used as input data to the RL algorithm. RL optimized the required image analysis sequence to maximize the probability of obtaining a correct diagnosis while reducing the number of analysed images. Results: The RL-generated protocol identified three separate image analysis groups to determine cardiac remodelling (Figure 1). The proposed protocol starts with the analysis of the mitral PW, and based on its velocity pattern, assigns each individual to one of the three groups. In Group 1 (G1, n=158) analysing the mitral PW acquisition was sufficient to determine disease status. HTN patients were separated based on a pattern of an inversed E/A ratio and EA fusion reflecting signs of diastolic dysfunction. In G2 (n=56), mitral flow showed a slightly decreased E/A ratio and longer E deacceleration time, and adding aortic PW was required to determine remodelling: HTN had higher aortic peak velocity and shorter peak acceleration time due to higher systemic afterload. Finally, G3 (n=19) required global longitudinal strain, which showed pathological early systolic stretching, reflecting the change in the timing of cardiac events in arterial hypertension. Fifteen (6%) participants did not match any of the groups, requiring the acquisition of remaining sequences (TDI, regional strain) to secure a correct diagnosis. In average, the protocol analysed 1.44 images per patient, out of the four available. Conclusion: Through a pilot study utilizing a limited set of imaging sequences, we demonstrate a template for automated generation of efficient, tailored image analysis protocols, that minimimize the number of analyzed images to determinine patient phenotypes. RL is a promising tool to reduce analysis time, potentially saving costs in preventive screening programs.
- 19 June 2023
- Published by Oxford University Press (OUP) in European Heart Journal - Cardiovascular Imaging
- Vol. 24 (Supplement)
Open AccessMachine learning for the generation of personalized image analysis protocol in echocardiography: a pilot study in arterial hypertension
Funding Acknowledgements: Type of funding sources: Public grant(s) – National budget only. Main funding source(s): Agence National de la Recherche Europian Union-NextGenerationEU. Background: Current workflow in cardiac imaging is based on protocols meant to capture a set of predefined images for a certain condition [1]. Although standardized, such approaches are not personalized, and are often time- and resource-ineffective. Reinforcement learning (RL), a subfield of machine learning that addresses decision making [2], can be used to incorporate complex, whole cardiac cycle imaging data, while optimizing costs associated to data acquisition and processing – including economy, patient safety/comfort and examination time. Our aim is to demonstrate the viability of RL to create a personalized, resource-effective data analysis routine from echocardiography to separate remodelling in arterial hypertension from normal cardiac function. Methods: An echo study was performed in 189 clinically managed hypertensive (HTN) patients, and 60 non-hypertensive healthy control subjects [3]. Speckle-tracking analysis of the left ventricle was performed and deformation curves extracted. Aortic and mitral flow pulsed-wave (PW) Doppler and septal basal tissue PW Doppler velocity profiles were obtained. These whole cardiac cycle deformation and velocity curves were used as input data to the RL algorithm. RL optimized the required image analysis sequence to maximize the probability of obtaining a correct diagnosis while reducing the number of analysed images. Results: The RL-generated protocol identified three separate image analysis groups to determine cardiac remodelling (Figure 1). The proposed protocol starts with the analysis of the mitral PW, and based on its velocity pattern, assigns each individual to one of the three groups. In Group 1 (G1, n=158) analysing the mitral PW acquisition was sufficient to determine disease status. HTN patients were separated based on a pattern of an inversed E/A ratio and EA fusion reflecting signs of diastolic dysfunction. In G2 (n=56), mitral flow showed a slightly decreased E/A ratio and longer E deacceleration time, and adding aortic PW was required to determine remodelling: HTN had higher aortic peak velocity and shorter peak acceleration time due to higher systemic afterload. Finally, G3 (n=19) required global longitudinal strain, which showed pathological early systolic stretching, reflecting the change in the timing of cardiac events in arterial hypertension. Fifteen (6%) participants did not match any of the groups, requiring the acquisition of remaining sequences (TDI, regional strain) to secure a correct diagnosis. In average, the protocol analysed 1.44 images per patient, out of the four available. Conclusion: Through a pilot study utilizing a limited set of imaging sequences, we demonstrate a template for automated generation of efficient, tailored image analysis protocols, that minimimize the number of analyzed images to determinine patient phenotypes. RL is a promising tool to reduce analysis time, potentially saving costs in preventive screening programs.
- Open Access
Hierarchies of Reward Machines
Reward machines (RMs) are a recent formalism for representing the reward function of a reinforcement learning task through a finite-state machine whose edges encode subgoals of the task using high-level events. The structure of RMs enables the decomposition of a task into simpler and independently solvable subtasks that help tackle long-horizon and/or sparse reward tasks. We propose a formalism for further abstracting the subtask structure by endowing an RM with the ability to call other RMs, thus composing a hierarchy of RMs (HRM). We exploit HRMs by treating each call to an RM as an independently solvable subtask using the options framework, and describe a curriculum-based method to learn HRMs from traces observed by the agent. Our experiments reveal that exploiting a handcrafted HRM leads to faster convergence than with a flat HRM, and that learning an HRM is feasible in cases where its equivalent flat representation is not.
Open AccessHierarchies of Reward Machines
Reward machines (RMs) are a recent formalism for representing the reward function of a reinforcement learning task through a finite-state machine whose edges encode subgoals of the task using high-level events. The structure of RMs enables the decomposition of a task into simpler and independently solvable subtasks that help tackle long-horizon and/or sparse reward tasks. We propose a formalism for further abstracting the subtask structure by endowing an RM with the ability to call other RMs, thus composing a hierarchy of RMs (HRM). We exploit HRMs by treating each call to an RM as an independently solvable subtask using the options framework, and describe a curriculum-based method to learn HRMs from traces observed by the agent. Our experiments reveal that exploiting a handcrafted HRM leads to faster convergence than with a flat HRM, and that learning an HRM is feasible in cases where its equivalent flat representation is not.
- 17 March 2023
- Published by Springer Nature
- p. 84-99
State Representation Learning for Goal-Conditioned Reinforcement Learning
- 17 March 2023
- Published by Springer Nature
- p. 84-99
State Representation Learning for Goal-Conditioned Reinforcement Learning