cs.ITApr 5, 2026

Out-of-Air Computation: Enabling Structured Function Extraction from Wireless Superposition

Authors: Seyed Mohammad Azimi-Abarghouyi

Read PDF
Ask AI
Cite

Copy citation

DOINot available for this paper

Abstract

Over-the-air computation (AirComp) broadly exploits the superposition property of wireless multiple-access channels (MACs) to compute functions of distributed data. Within this broad class, dominant conventional designs are embedding-oriented: they pre-shape transmitted signals or mitigate channel effects so that the received superposition directly realizes the prescribed computation, often requiring the MAC to approximate an ideal computational medium. This paper introduces out-of-air computation (AirCPU) and establishes an extraction-oriented paradigm for AirComp. Built on joint source-channel coding, AirCPU creates a structured wireless superposition from which the receiver extracts the target function. AirCPU operates directly on continuous-valued device data, avoiding the need for a separate source quantization stage, and employs a multi-layer nested lattice architecture that enables progressive resolution by decomposing each input into hierarchically scaled components, all transmitted over a common bounded digital constellation under a fixed power constraint. We formalize the notion of decoupled resolution, showing that in operating regimes where the decoding error probability is sufficiently small, the impact of channel noise and finite constellation constraints on distortion becomes negligible, and the resulting computation error is primarily determined by the target resolution set by the finest lattice. For fading MACs, we further introduce collective and successive computation mechanisms, in addition to the proposed direct computation, which exploit multiple decoded integer-coefficient functions and side-information functions as structural representations of the wireless superposition to significantly expand the reliable operating regime.

Explore similar work

CardsList
Dec 3, 2025cs.IT

Over-the-Air Federated Learning: Rethinking Edge AI Through Signal Processing

Over-the-Air Federated Learning (AirFL) is an emerging paradigm that tightly integrates wireless signal processing and distributed machine learning to enable scalable AI at the network edge. By exploiting wireless superposition over a shared multiple-access channel, AirFL turns simultaneous transmissions of local model updates into an analog aggregate at the receiver, thereby reducing communication latency, bandwidth usage, and energy consumption in wireless aggregation domains. This article develops a design-oriented tutorial view of analog AirFL. We organize existing schemes according to the signal-processing mechanism used to enable AirFL aggregation: transmitter-side channel compensation and power control, receiver-side equalization and high-dimensional processing, or learning-aware aggregation weighting. This viewpoint leads to three representative classes -- CSIT-aware, blind, and weighted AirFL -- and clarifies their assumptions, performance tradeoffs, complexity, and deployment limitations. We further discuss synchronization, digital and hybrid analog-digital realization, and open research directions for integrating AirFL into practical wireless edge-AI systems.

Seyed Mohammad Azimi-Abarghouyi, Carlo Fischione, Kaibin Huang

School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden · Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong SAR, China

Intelligent EdgeFederated LearningGraph Signal ProcessingArtificial Intelligence Systems
AskPDF
Jun 12, 2026cs.LG

Compressed Computation is (probably) not Computation in Superposition

We study whether the Compressed Computation (CC) toy model (Braun et al., 2025) is an instance of computation in superposition. The CC model appears to compute 100 ReLU functions with just 50 neurons, achieving a better loss than expected from only representing 50 ReLU functions. We show that the model mixes inputs via its noisy residual stream, corresponding to an unintended mixing matrix in the labels. Splitting the training objective into the ReLU term and the mixing term, we find that performance gains scale with the magnitude of the mixing matrix and vanish when the matrix is removed. The learned neuron directions concentrate in the subspace associated with the top 50 eigenvalues of the mixing matrix, suggesting that the mixing term governs the solution. Finally, a semi-non-negative matrix factorization (SNMF) baseline derived solely from the mixing matrix reproduces the qualitative loss profile and improves on prior baselines, though it does not match the trained model. These results suggest CC is not a suitable toy model of computation in superposition.

Jai Bhagat, Sara Molas-Medina, Giorgi Giglemiani +1

Metamorphic · Independent · UK AI Security Institute +1

Compressed ModelMultilayer PerceptronsRectified Linear UnitNonnegative Matrix Factorization
AskPDF
Jul 5, 2026cs.DC

Air-Plan: Query-Optimized Topology Selection for Over-the-Air Decentralized Federated Learning

Over-the-air (OTA) aggregation exploits the superposition property of wireless multiple-access channels to aggregate model updates from multiple devices within a single transmission slot, significantly reducing communication latency. While OTA computation has been extensively studied for centralized federated learning (FL), its integration with decentralized federated learning (DFL) remains largely unexplored, and principled communication topology selection is absent from existing work. We present AIRPLAN, a query-optimized topology selection framework for Over-the-Air Decentralized Federated Learning (OTA-DFL). AIRPLAN establishes a formal equivalence between OTA-DFL and distributed query processing, enabling topology selection to be formulated as a cost-based query optimization problem. Using privacy-preserving Count-Min Sketch statistics, AIRPLAN estimates workload characteristics, evaluates a graph-aware cost model across candidate topologies, and selects the communication graph that minimizes training cost while satisfying a target accuracy SLA. Experiments across five graph families, three vision benchmarks, four client scales, and multiple SNR settings show that AIRPLAN matches the oracle-optimal topology in 91.4% of workloads while introducing less than 1.8% overhead. We further derive theoretical error bounds for topology-aware sparsification, demonstrating that well-connected topologies better tolerate aggressive compression. AIRPLAN introduces a systems-oriented perspective that bridges wireless federated learning and distributed query optimization.

Kaushal Attaluri, Rebeca P. Diaz-Redondo, Manuel Fernandez Veiga

ICLab, atlanTTic, University of Vigo

Federated LearningPower AllocationNetwork TopologyTopology
AskPDF