Alert button
Picture for Marios Kountouris

Marios Kountouris

Alert button

AFDM vs OTFS: A Comparative Study of Promising Waveforms for ISAC in Doubly-Dispersive Channels

Sep 10, 2023
Hyeon Seok Rou, Giuseppe Thadeu Freitas de Abreu, Junil Choi, David González G., Osvaldo Gonsa, Yong Lian Guan, Marios Kountouris

Figure 1 for AFDM vs OTFS: A Comparative Study of Promising Waveforms for ISAC in Doubly-Dispersive Channels
Figure 2 for AFDM vs OTFS: A Comparative Study of Promising Waveforms for ISAC in Doubly-Dispersive Channels

This white paper aims to briefly describe a proposed article that will provide a thorough comparative study of waveforms designed to exploit the features of doubly-dispersive channels arising in heterogeneous high-mobility scenarios as expected in the beyond fifth generation (B5G) and sixth generation (6G), in relation to their suitability to integrated sensing and communications (ISAC) systems. In particular, the full article will compare the well-established delay-Doppler domain-based orthognal time frequency space (OTFS) and the recently proposed chirp domain-based affine frequency division multiplexing (AFDM) waveforms. Both these waveforms are designed based on a full delay- Doppler representation of the time variant (TV) multipath channel, yielding not only robustness and orthogonality of information symbols in high-mobility scenarios, but also a beneficial implication for environment target detection through the inherent capability of estimating the path delay and Doppler shifts, which are standard radar parameters. These modulation schemes are distinct candidates for ISAC in B5G/6G systems, such that a thorough study of their advantages, shortcomings, implications to signal processing, and performance of communication and sensing functions are well in order. In light of the above, a sample of the intended contribution (Special Issue paper) is provided below.

Viaarxiv icon

Blind Asynchronous Goal-Oriented Detection for Massive Connectivity

Jun 21, 2023
Sajad Daei, Saeed Razavikia, Marios Kountouris, Mikael Skoglund, Gabor Fodor, Carlo Fischione

Figure 1 for Blind Asynchronous Goal-Oriented Detection for Massive Connectivity
Figure 2 for Blind Asynchronous Goal-Oriented Detection for Massive Connectivity
Figure 3 for Blind Asynchronous Goal-Oriented Detection for Massive Connectivity
Figure 4 for Blind Asynchronous Goal-Oriented Detection for Massive Connectivity

Resource allocation and multiple access schemes are instrumental for the success of communication networks, which facilitate seamless wireless connectivity among a growing population of uncoordinated and non-synchronized users. In this paper, we present a novel random access scheme that addresses one of the most severe barriers of current strategies to achieve massive connectivity and ultra-reliable and low latency communications for 6G. The proposed scheme utilizes wireless channels' angular continuous group-sparsity feature to provide low latency, high reliability, and massive access features in the face of limited time-bandwidth resources, asynchronous transmissions, and preamble errors. Specifically, a reconstruction-free goal-oriented optimization problem is proposed, which preserves the angular information of active devices and is then complemented by a clustering algorithm to assign active users to specific groups. This allows us to identify active stationary devices according to their line of sight angles. Additionally, for mobile devices, an alternating minimization algorithm is proposed to recover their preamble, data, and channel gains simultaneously, enabling the identification of active mobile users. Simulation results show that the proposed algorithm provides excellent performance and supports a massive number of devices. Moreover, the performance of the proposed scheme is independent of the total number of devices, distinguishing it from other random access schemes. The proposed method provides a unified solution to meet the requirements of machine-type communications and ultra-reliable and low-latency communications, making it an important contribution to the emerging 6G networks.

Viaarxiv icon

When is Importance Weighting Correction Needed for Covariate Shift Adaptation?

Mar 07, 2023
Davit Gogolashvili, Matteo Zecchin, Motonobu Kanagawa, Marios Kountouris, Maurizio Filippone

Figure 1 for When is Importance Weighting Correction Needed for Covariate Shift Adaptation?
Figure 2 for When is Importance Weighting Correction Needed for Covariate Shift Adaptation?
Figure 3 for When is Importance Weighting Correction Needed for Covariate Shift Adaptation?

This paper investigates when the importance weighting (IW) correction is needed to address covariate shift, a common situation in supervised learning where the input distributions of training and test data differ. Classic results show that the IW correction is needed when the model is parametric and misspecified. In contrast, recent results indicate that the IW correction may not be necessary when the model is nonparametric and well-specified. We examine the missing case in the literature where the model is nonparametric and misspecified, and show that the IW correction is needed for obtaining the best approximation of the true unknown function for the test distribution. We do this by analyzing IW-corrected kernel ridge regression, covering a variety of settings, including parametric and nonparametric models, well-specified and misspecified settings, and arbitrary weighting functions.

Viaarxiv icon

Personalized Decentralized Federated Learning with Knowledge Distillation

Feb 23, 2023
Eunjeong Jeong, Marios Kountouris

Figure 1 for Personalized Decentralized Federated Learning with Knowledge Distillation
Figure 2 for Personalized Decentralized Federated Learning with Knowledge Distillation
Figure 3 for Personalized Decentralized Federated Learning with Knowledge Distillation
Figure 4 for Personalized Decentralized Federated Learning with Knowledge Distillation

Personalization in federated learning (FL) functions as a coordinator for clients with high variance in data or behavior. Ensuring the convergence of these clients' models relies on how closely users collaborate with those with similar patterns or preferences. However, it is generally challenging to quantify similarity under limited knowledge about other users' models given to users in a decentralized network. To cope with this issue, we propose a personalized and fully decentralized FL algorithm, leveraging knowledge distillation techniques to empower each device so as to discern statistical distances between local models. Each client device can enhance its performance without sharing local data by estimating the similarity between two intermediate outputs from feeding local samples as in knowledge distillation. Our empirical studies demonstrate that the proposed algorithm improves the test accuracy of clients in fewer iterations under highly non-independent and identically distributed (non-i.i.d.) data distributions and is beneficial to agents with small datasets, even without the need for a central server.

Viaarxiv icon

Real-time Remote Reconstruction of a Markov Source and Actuation over Wireless

Feb 02, 2023
Mehrdad Salimnejad, Marios Kountouris, Nikolaos Pappas

Figure 1 for Real-time Remote Reconstruction of a Markov Source and Actuation over Wireless
Figure 2 for Real-time Remote Reconstruction of a Markov Source and Actuation over Wireless
Figure 3 for Real-time Remote Reconstruction of a Markov Source and Actuation over Wireless
Figure 4 for Real-time Remote Reconstruction of a Markov Source and Actuation over Wireless

In this work, we study the problem of real-time tracking and reconstruction of an information source with the purpose of actuation. A device monitors an $N$-state Markov process and transmits status updates to a receiver over a wireless erasure channel. We consider a set of joint sampling and transmission policies, including a semantics-aware one, and we study their performance with respect to relevant metrics. Specifically, we investigate the real-time reconstruction error and its variance, the consecutive error, the cost of memory error, and the cost of actuation error. Furthermore, we propose a randomized stationary sampling and transmission policy and derive closed-form expressions for all aforementioned metrics. We then formulate an optimization problem for minimizing the real-time reconstruction error subject to a sampling cost constraint. Our results show that in the scenario of constrained sampling generation, the optimal randomized stationary policy outperforms all other sampling policies when the source is rapidly evolving. Otherwise, the semantics-aware policy performs the best.

Viaarxiv icon

Multi-User Distributed Computing Via Compressed Sensing

Jan 09, 2023
Ali Khalesi, Sajad Daei, Marios Kountouris, Petros Elia

Figure 1 for Multi-User Distributed Computing Via Compressed Sensing

The multi-user linearly-separable distributed computing problem is considered here, in which $N$ servers help to compute the real-valued functions requested by $K$ users, where each function can be written as a linear combination of up to $L$ (generally non-linear) subfunctions. Each server computes a fraction $\gamma$ of the subfunctions, then communicates a function of its computed outputs to some of the users, and then each user collects its received data to recover its desired function. Our goal is to bound the ratio between the computation workload done by all servers over the number of datasets. To this end, we here reformulate the real-valued distributed computing problem into a matrix factorization problem and then into a basic sparse recovery problem, where sparsity implies computational savings. Building on this, we first give a simple probabilistic scheme for subfunction assignment, which allows us to upper bound the optimal normalized computation cost as $\gamma \leq \frac{K}{N}$ that a generally intractable $\ell_0$-minimization would give. To bypass the intractability of such optimal scheme, we show that if these optimal schemes enjoy $\gamma \leq - r\frac{K}{N}W^{-1}_{-1}(- \frac{2K}{e N r} )$ (where $W_{-1}(\cdot)$ is the Lambert function and $r$ calibrates the communication between servers and users), then they can actually be derived using a tractable Basis Pursuit $\ell_1$-minimization. This newly-revealed connection between distributed computation and compressed sensing opens up the possibility of designing practical distributed computing algorithms by employing tools and methods from compressed sensing.

* Submitted to ITW2023. arXiv admin note: text overlap with arXiv:2206.11119 
Viaarxiv icon

Goal-Oriented Communications for the IoT and Application to Data Compression

Nov 10, 2022
Chao Zhang, Hang Zou, Samson Lasaulce, Walid Saad, Marios Kountouris, Mehdi Bennis

Figure 1 for Goal-Oriented Communications for the IoT and Application to Data Compression
Figure 2 for Goal-Oriented Communications for the IoT and Application to Data Compression
Figure 3 for Goal-Oriented Communications for the IoT and Application to Data Compression
Figure 4 for Goal-Oriented Communications for the IoT and Application to Data Compression

Internet of Things (IoT) devices will play an important role in emerging applications, since their sensing, actuation, processing, and wireless communication capabilities stimulate data collection, transmission and decision processes of smart applications. However, new challenges arise from the widespread popularity of IoT devices, including the need for processing more complicated data structures and high dimensional data/signals. The unprecedented volume, heterogeneity, and velocity of IoT data calls for a communication paradigm shift from a search for accuracy or fidelity to semantics extraction and goal accomplishment. In this paper, we provide a partial but insightful overview of recent research efforts in this newly formed area of goal-oriented (GO) and semantic communications, focusing on the problem of GO data compression for IoT applications.

Viaarxiv icon

Robust Bayesian Learning for Reliable Wireless AI: Framework and Applications

Jul 01, 2022
Matteo Zecchin, Sangwoo Park, Osvaldo Simeone, Marios Kountouris, David Gesbert

Figure 1 for Robust Bayesian Learning for Reliable Wireless AI: Framework and Applications
Figure 2 for Robust Bayesian Learning for Reliable Wireless AI: Framework and Applications
Figure 3 for Robust Bayesian Learning for Reliable Wireless AI: Framework and Applications
Figure 4 for Robust Bayesian Learning for Reliable Wireless AI: Framework and Applications

This work takes a critical look at the application of conventional machine learning methods to wireless communication problems through the lens of reliability and robustness. Deep learning techniques adopt a frequentist framework, and are known to provide poorly calibrated decisions that do not reproduce the true uncertainty caused by limitations in the size of the training data. Bayesian learning, while in principle capable of addressing this shortcoming, is in practice impaired by model misspecification and by the presence of outliers. Both problems are pervasive in wireless communication settings, in which the capacity of machine learning models is subject to resource constraints and training data is affected by noise and interference. In this context, we explore the application of the framework of robust Bayesian learning. After a tutorial-style introduction to robust Bayesian learning, we showcase the merits of robust Bayesian learning on several important wireless communication problems in terms of accuracy, calibration, and robustness to outliers and misspecification.

* Submitted for publication 
Viaarxiv icon

Communication-Efficient Distributionally Robust Decentralized Learning

May 31, 2022
Matteo Zecchin, Marios Kountouris, David Gesbert

Figure 1 for Communication-Efficient Distributionally Robust Decentralized Learning
Figure 2 for Communication-Efficient Distributionally Robust Decentralized Learning
Figure 3 for Communication-Efficient Distributionally Robust Decentralized Learning
Figure 4 for Communication-Efficient Distributionally Robust Decentralized Learning

Decentralized learning algorithms empower interconnected edge devices to share data and computational resources to collaboratively train a machine learning model without the aid of a central coordinator (e.g. an orchestrating basestation). In the case of heterogeneous data distributions at the network devices, collaboration can yield predictors with unsatisfactory performance for a subset of the devices. For this reason, in this work we consider the formulation of a distributionally robust decentralized learning task and we propose a decentralized single loop gradient descent/ascent algorithm (AD-GDA) to solve the underlying minimax optimization problem. We render our algorithm communication efficient by employing a compressed consensus scheme and we provide convergence guarantees for smooth convex and non-convex loss functions. Finally, we corroborate the theoretical findings with empirical evidence of the ability of the proposed algorithm in providing unbiased predictors over a network of collaborating devices with highly heterogeneous data distributions.

* Manuscript submitted for publication 
Viaarxiv icon

Blind Goal-Oriented Massive Access for Future Wireless Networks

May 14, 2022
Sajad Daei, Marios Kountouris

Figure 1 for Blind Goal-Oriented Massive Access for Future Wireless Networks
Figure 2 for Blind Goal-Oriented Massive Access for Future Wireless Networks
Figure 3 for Blind Goal-Oriented Massive Access for Future Wireless Networks
Figure 4 for Blind Goal-Oriented Massive Access for Future Wireless Networks

Emerging communication networks are envisioned to support massive wireless connectivity of heterogeneous devices with sporadic traffic and diverse requirements in terms of latency, reliability, and bandwidth. Providing multiple access to an increasing number of uncoordinated users and sharing the limited resources become essential in this context. In this work, we revisit the random access (RA) problem and exploit the continuous angular group sparsity feature of wireless channels to propose a novel RA strategy that provides low latency, high reliability, and massive access with limited bandwidth resources in an all-in-one package. To this end, we first design a reconstruction-free goal-oriented optimization problem, which only preserves the angular information required to identify the active devices. To solve this, we propose an alternating direction method of multipliers (ADMM) and derive closed-form expressions for each ADMM step. Then, we design a clustering algorithm that assigns the users in specific groups from which we can identify active stationary devices by their angles. For mobile devices, we propose an alternating minimization algorithm to recover their data and their channel gains simultaneously, which allows us to identify active mobile users. Simulation results show significant performance gains in terms of active user detection and false alarm probabilities as compared to state-of-the-art RA schemes, even with limited number of preambles. Moreover, unlike prior work, the performance of the proposed blind goal-oriented massive access does not depend on the number of devices.

Viaarxiv icon