Metraipolis › archive › dc_7fd3d6cb8904

Finite-Sample and Communication-Efficient Networked Information Aggregation — arXiv:2611.11032

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.11032
License (as archived)
CC0-1.0
Archived
2026-11-10T18:43:03.957Z
SHA-256 of the archived text
ae8e80cddb7a053c3a0d4f6fd7576c4f4665bec88348d21d17dfb0320b94c5da
Stable URL of this page
https://metraipolis.com/documento/dc_7fd3d6cb8904

How to cite

Finite-Sample and Communication-Efficient Networked Information Aggregation — arXiv:2611.11032 — arXiv (en), https://arxiv.org/abs/2611.11032 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7fd3d6cb8904 (Metraipolis archive dc_7fd3d6cb8904, sha256 ae8e80cddb7a053c3a0d4f6fd7576c4f4665bec88348d21d17dfb0320b94c5da)
BibTeX
@misc{dc7fd3d6cb8904,
  title = {Finite-Sample and Communication-Efficient Networked Information Aggregation — arXiv:2611.11032},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.11032},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7fd3d6cb8904; sha256 ae8e80cddb7a053c3a0d4f6fd7576c4f4665bec88348d21d17dfb0320b94c5da},
  year = {2026}
}

Archived text

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

Building on SODA 2026 work Kearns et al. (2026), we study learning in directed acyclic graphs in which each agent observes only a subset of the input coordinates and may use the predictions of its parents as additional features. In the finite-sample protocol, the message sent along each edge is the agent's prediction vector on a shared sample, so the communication cost is linear in the sample size $m$. In this paper we study this model under communication constraints. First, we revisit the finite-sample analysis of the full-message protocol. We identify a gap in the finite-sample proof of Kearns et al. (2026) and develop a different argument that establishes a finite-sample population-risk guarantee along paths satisfying deterministic $M$-coverage. Second, we introduce a shared-sketch protocol in which each agent sends a $k$-dimensional linear sketch of its prediction vector instead of the full $m$-dimensional message, where $k\ll m$. We analyze this protocol through a reduction to least squares on the compressed sample together with an oblivious subspace embedding argument. The resulting bound separates statistics from communication: the statistical term is still governed by the original sample size $m$, while the additional error due to compression is controlled by the sketch dimension $k$. For Gaussian sketches, we obtain an explicit high-probability population-risk bound, showing that row subsampling is not the only possible communication-statistics tradeoff for networked information aggregation.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2611.11032 — 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-11-10T18:37:37.622Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).