Metraipolis › archive › dc_5f88dc8abbfe

It Takes Two Moments: Rigidity and Limits of Continuous Encoders for Over-the-Air Computation — arXiv:2610.21536

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21536
License (as archived)
CC0-1.0
Archived
2026-10-16T10:28:57.197Z
SHA-256 of the archived text
fda9dfd4446dd1cb5afa7c5e51b4b832504b598a9480ad120b5884d0148bd024
Stable URL of this page
https://metraipolis.com/documento/dc_5f88dc8abbfe

How to cite

It Takes Two Moments: Rigidity and Limits of Continuous Encoders for Over-the-Air Computation — arXiv:2610.21536 — arXiv (en), https://arxiv.org/abs/2610.21536 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5f88dc8abbfe (Metraipolis archive dc_5f88dc8abbfe, sha256 fda9dfd4446dd1cb5afa7c5e51b4b832504b598a9480ad120b5884d0148bd024)
BibTeX
@misc{dc5f88dc8abbfe,
  title = {It Takes Two Moments: Rigidity and Limits of Continuous Encoders for Over-the-Air Computation — arXiv:2610.21536},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21536},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5f88dc8abbfe; sha256 fda9dfd4446dd1cb5afa7c5e51b4b832504b598a9480ad120b5884d0148bd024},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21536. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study over-the-air computation of functions, such as empirical variance, formed by combining two separately postprocessed sums of locally transformed observations. We consider continuous encoders subject to pointwise peak-power constraints over a single use of a complex multiple-access channel. With four or more transmitters, we identify conditions under which exact noiseless recovery forces every continuous encoder collection into a common affine structure that preserves both sums, reducing infinite-dimensional encoder design to selecting a finite set of coefficients. To quantify resilience against channel noise, we introduce a robustness score that measures the separation of noiseless received aggregates relative to variations in the desired function value. Within this characterized encoder family, we formulate robustness maximization as an exact convex semi-infinite program, eliminating rank constraints without a relaxation gap, and construct a decoder that attains the minimum uniform noise-amplification constant. For several function classes, including empirical variance, we derive closed-form robustness-optimal encoders and scores. Under mild regularity conditions, we also establish sharp limits on the Gaussian mean squared error at high signal-to-noise ratios and show how using the input distribution reduces average error at the expense of uniform robustness.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Signal Processing (eess.SP); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.21536 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:49:47.941Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).