Compute-Update Federated Learning: A Lattice Coding Approach Over-the-Air

• URL: http://arxiv.org/abs/2409.06343v2
• Date: Tue, 5 Nov 2024 21:17:46 GMT
• Title: Compute-Update Federated Learning: A Lattice Coding Approach Over-the-Air
• Abstract summary: This paper introduces a federated learning framework that enables over-the-air computation via digital communications. We propose a novel receiver structure at the server, designed to reliably decode an integer combination of the quantized model parameters.
• Score: 18.88978854474189
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: This paper introduces a federated learning framework that enables over-the-air computation via digital communications, using a new joint source-channel coding scheme. Without relying on channel state information at devices, this scheme employs lattice codes to both quantize model parameters and exploit interference from the devices. We propose a novel receiver structure at the server, designed to reliably decode an integer combination of the quantized model parameters as a lattice point for the purpose of aggregation. We present a mathematical approach to derive a convergence bound for the proposed scheme and offer design remarks. In this context, we suggest an aggregation metric and a corresponding algorithm to determine effective integer coefficients for the aggregation in each communication round. Our results illustrate that, regardless of channel dynamics and data heterogeneity, our scheme consistently delivers superior learning accuracy across various parameters and markedly surpasses other over-the-air methodologies.

Related papers

• Ada-TokenCom: Rate-Adaptive Token Communications via Large-Model-Driven Token Compression and Generation [52.99258064220833]
  Ada-TokenCom is a rate-adaptive TokenCom framework based on large autoregressive models.<n>We propose a mixed reconstruction/generation scheme, where the transmitter encodes and transmits the highly informative tokens.<n>We show that our proposed Ada-TokenCom framework outperforms both digital and deep joint source-channel coding-based semantic communication baselines.
  arXiv  Detail & Related papers  (2026-08-28T08:54:28Z)
• Hypernetwork-based approach for grid-independent functional data clustering [3.142113135607563]
  We introduce a framework that maps discretized function observations into a fixed-dimensional vector space via an auto-encoding architecture.<n>The encoder is a hypernetwork that maps coordinate-value pairs to the weight space of an implicit neural representation.<n>By means of synthetic and real-world experiments in high-dimensional settings, we demonstrate competitive clustering performance.
  arXiv  Detail & Related papers  (2026-02-26T10:05:07Z)
• Wireless TokenCom: RL-Based Tokenizer Agreement for Multi-User Wireless Token Communications [59.84545048095092]
  Token Communications (TokenCom) has recently emerged as an effective new paradigm, where tokens are the unified units of communications computations.<n>We investigate a multi-user downlink wireless TokenCom scenario, where the base station transmits multiple users.
  arXiv  Detail & Related papers  (2026-02-12T19:00:33Z)
• A weighted quantum ensemble of homogeneous quantum classifiers [0.0]
  Homogeneous ensembles use identical models, achieving diversity through different data subsets.<n>We propose a method to achieve a weighted homogeneous quantum ensemble using quantum classifiers with indexing registers for data encoding.
  arXiv  Detail & Related papers  (2025-06-09T14:38:13Z)
• Communication-Efficient Personalized Distributed Learning with Data and Node Heterogeneity [40.64395367773766]
  We propose a distributed strong lottery ticket hypothesis (TH), based on which a communication-efficient personalized learning algorithm is developed. In the proposed method, each local model is represented as the Hadamard product of global real-valued parameters and a personalized binary mask for pruning. We provide a theoretical proof for the DSLTH, establishing it as the foundation of the proposed method.
  arXiv  Detail & Related papers  (2025-04-24T13:02:54Z)
• Over-the-Air Federated Learning via Weighted Aggregation [9.043019524847491]
  This paper introduces a new federated learning scheme that leverages over-the-air computation. A novel feature of this scheme is the proposal to employ adaptive weights during aggregation. We provide a mathematical methodology to derive the convergence bound for the proposed scheme.
  arXiv  Detail & Related papers  (2024-09-12T08:07:11Z)
• Ensemble Quadratic Assignment Network for Graph Matching [52.20001802006391]
  Graph matching is a commonly used technique in computer vision and pattern recognition. Recent data-driven approaches have improved the graph matching accuracy remarkably. We propose a graph neural network (GNN) based approach to combine the advantages of data-driven and traditional methods.
  arXiv  Detail & Related papers  (2024-03-11T06:34:05Z)
• Quantized Hierarchical Federated Learning: A Robust Approach to Statistical Heterogeneity [3.8798345704175534]
  We present a novel hierarchical federated learning algorithm that incorporates quantization for communication-efficiency. We offer a comprehensive analytical framework to evaluate its optimality gap and convergence rate. Our findings reveal that our algorithm consistently achieves high learning accuracy over a range of parameters.
  arXiv  Detail & Related papers  (2024-03-03T15:40:24Z)
• Federated Learning via Lattice Joint Source-Channel Coding [22.315782805190036]
  This paper introduces a universal federated learning framework that enables over-the-air computation via digital communications. Without relying on channel state information at devices, this scheme employs lattice codes to both quantize model parameters and exploit interference from the devices.
  arXiv  Detail & Related papers  (2024-03-01T22:53:57Z)
• Random Aggregate Beamforming for Over-the-Air Federated Learning in Large-Scale Networks [66.18765335695414]
  We consider a joint device selection and aggregate beamforming design with the objectives of minimizing the aggregate error and maximizing the number of selected devices. To tackle the problems in a cost-effective manner, we propose a random aggregate beamforming-based scheme. We additionally use analysis to study the obtained aggregate error and the number of the selected devices when the number of devices becomes large.
  arXiv  Detail & Related papers  (2024-02-20T23:59:45Z)
• Over-the-Air Federated Learning and Optimization [52.5188988624998]
  We focus on Federated learning (FL) via edge-the-air computation (AirComp) We describe the convergence of AirComp-based FedAvg (AirFedAvg) algorithms under both convex and non- convex settings. For different types of local updates that can be transmitted by edge devices (i.e., model, gradient, model difference), we reveal that transmitting in AirFedAvg may cause an aggregation error. In addition, we consider more practical signal processing schemes to improve the communication efficiency and extend the convergence analysis to different forms of model aggregation error caused by these signal processing schemes.
  arXiv  Detail & Related papers  (2023-10-16T05:49:28Z)
• Scalable Hierarchical Over-the-Air Federated Learning [3.8798345704175534]
  This work introduces a new two-level learning method designed to handle both interference and device data heterogeneity. We present a comprehensive mathematical approach to derive the convergence bound for the proposed algorithm. Despite the interference and data heterogeneity, the proposed algorithm achieves high learning accuracy for a variety of parameters.
  arXiv  Detail & Related papers  (2022-11-29T12:46:37Z)
• Over-the-Air Split Machine Learning in Wireless MIMO Networks [56.27831295707334]
  In split machine learning (ML), different partitions of a neural network (NN) are executed by different computing nodes. To ease communication burden, over-the-air computation (OAC) can efficiently implement all or part of the computation at the same time of communication.
  arXiv  Detail & Related papers  (2022-10-07T15:39:11Z)
• Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI [108.08079323459822]
  This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
  arXiv  Detail & Related papers  (2022-07-03T06:57:07Z)
• Device Heterogeneity in Federated Learning: A Superquantile Approach [0.0]
  We propose a framework to handle heterogeneous client devices which do not conform to the population data distribution. We present an optimization algorithm and establish its convergence to a stationary point. We conclude with numerical experiments on neural networks as well as linear models on tasks from computer vision and natural language processing.
  arXiv  Detail & Related papers  (2020-02-25T23:37:35Z)
• Data-Driven Symbol Detection via Model-Based Machine Learning [117.58188185409904]
  We review a data-driven framework to symbol detection design which combines machine learning (ML) and model-based algorithms. In this hybrid approach, well-known channel-model-based algorithms are augmented with ML-based algorithms to remove their channel-model-dependence. Our results demonstrate that these techniques can yield near-optimal performance of model-based algorithms without knowing the exact channel input-output statistical relationship.
  arXiv  Detail & Related papers  (2020-02-14T06:58:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.