cs.IT · 2026-06-08 · No. 17

Information Theory, 2026-06-08.

2 new papers in cs.IT. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

2 entries
  1. 01

    The Capacity of Information-Theoretic Secure Aggregation in Federated Learning

    Lanxin Yi, Jinbao Zhu, Kai Wan, Xiaohu Tang

    cs.IT · cs.CR · cs.LG

    Secure aggregation allows a server to aggregate users' local updates while preserving update privacy. Existing information-theoretic problems typically assume that correlated random keys are provided by a trusted third party (TTP) or generated via prescribed groupwise structures, while the communication cost for establishing such correlated keys is often ignored. Consequently, the fundamental limits under general key-distribution mechanisms...

    arxiv.org/abs/2606.07277 · PDF

  2. 02

    The Sharp Phase Transition of Tyler's M-Estimator for Robust Subspace Recovery

    Gilad Lerman, Teng Zhang

    cs.IT · cs.LG · math.ST · stat.ML

    Robust Subspace Recovery (RSR) aims to identify an underlying d-dimensional subspace from a dataset heavily corrupted by outliers. Complexity-theoretic results establish a threshold for the problem's computational hardness based on the dimension-scaled signal-to-noise ratio (DS-SNR): the problem is SSE-hard when the DS-SNR is strictly less than 1, and solvable via practical algorithms when it is greater than 1 under general position...

    arxiv.org/abs/2606.06782 · PDF

This edition is part of The Daily Abstract — cs.IT archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.