8 accepted papers
Federated learning (FL) is a leading approach for iterative learning using possibly private data available at edge devices. The federated operation gives rise to challenges in privacy leakage, which accumulates in learning, and communication latency. These limitations are often individually mitigate…
In this paper, we study epidemic detection in a geographical region where a center for disease control (CDC) relies on two distinct testing agencies to assess an outbreak. Each agency operates within a defined area, and the quality of their testing performance can vary, leading to missed detections…
In [1], the linked loop code (LLC) is presented as a promising code for the unsourced A-channel with erasures (UACE). The UACE is an unsourced multiple access channel in which active users’ transmitted symbols are erased with a given probability and the channel output is obtained as the union of the…
Time-encoded sampling represents an emerging paradigm for temporal discretization, garnering recent interest. In this paper, we address the challenge of time-encoded sampling for the perfect recovery of signals residing in shift-invariant spaces (SISs) defined by multiple generators. Specifically, w…
In federated learning (FL), the communication constraint between the remote users and the Parameter Server (PS) is a crucial bottleneck. This paper proposes M22, a rate-distortion inspired approach to model update compression for distributed training of deep neural networks (DNNs). In particular, (i…
In this paper, we study the problem of estimating the direction of arrival (DOA) using a sparsely sampled uniform linear array (ULA). Based on an initial incomplete ULA measurements, our strategy is to choose a sparse subset of array elements for measuring the next snapshot. Then, we use a Hankel-st…
In decentralized optimization, multiple nodes in a network collaborate to minimize the sum of their local loss functions. The information exchange between nodes required for this task is often limited by network connectivity. We consider a generalization of this setting, in which communication is fu…
In this paper, a distributed convex optimization algorithm, termed distributed coordinate dual averaging (DCDA) algorithm, is proposed. The DCDA algorithm addresses the scenario of a large distributed optimization problem with limited communication among nodes in the network. Currently known distrib…