cs.IT · 2026-09-30 · No. 129

Information Theory, 2026-09-30.

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

    Mutual Information Constrained Chernoff Bottleneck

    Dier Tang, Guangyue Han

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

    The classical information bottleneck (IB) measures the relevance of a representation $U$ of $X$ to a target $Y$ by $I(U;Y)$, which does not directly characterize the error of downstream decisions. For a binary hypothesis $Y$ inferred from many separately encoded observations, the optimal error exponent is the Chernoff information between the two conditional distributions of $U$ given $Y$. We study the mutual information constrained Chernoff...

    arxiv.org/abs/2609.37994 · PDF

  2. 02

    On Task Scope and Information Retention in Source Coding

    Alireza Furutanpey, Kerstin Bunte

    cs.IT · cs.LG · eess.IV

    We argue that dividing codec design into Coding for Machines (CfM) and Coding for Humans (CfH) is a misleading distinction for deciding what information a codec may discard. Receiver identity does not determine admissible information loss. The required rate depends on task scope, including the predictions to support, their losses and tolerated risks, the encoder observation, and the permitted decoding procedures. Notably, a machine task may...

    arxiv.org/abs/2609.37575 · 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.