Metraipolis › archive › dc_ba123c90cc17

Task-Sufficient Contraction: Source Selection for Machine Information Interfaces — arXiv:2610.08884

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08884
License (as archived)
CC0-1.0
Archived
2026-10-08T12:36:37.944Z
SHA-256 of the archived text
04d9a75aca7b009862fe4a7a75c3f9c5864638b02f1a0feaae107fc11c3347e8
Stable URL of this page
https://metraipolis.com/documento/dc_ba123c90cc17

How to cite

Task-Sufficient Contraction: Source Selection for Machine Information Interfaces — arXiv:2610.08884 — arXiv (en), https://arxiv.org/abs/2610.08884 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba123c90cc17 (Metraipolis archive dc_ba123c90cc17, sha256 04d9a75aca7b009862fe4a7a75c3f9c5864638b02f1a0feaae107fc11c3347e8)
BibTeX
@misc{dcba123c90cc17,
  title = {Task-Sufficient Contraction: Source Selection for Machine Information Interfaces — arXiv:2610.08884},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08884},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba123c90cc17; sha256 04d9a75aca7b009862fe4a7a75c3f9c5864638b02f1a0feaae107fc11c3347e8},
  year = {2026}
}

Archived text

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

A declared task can sometimes certify a reduced source before a downstream encoder, codebook, rate, distortion target, or optimizer is chosen. This paper studies when one such reduction preserves the complete downstream problem family, a property termed Task-Sufficient Contraction. The reduced source is fixed by the task before the later operating point is selected. An exact contraction allows the later problem to be solved on that source with the same result as if the full source had been retained. For a machine with a fixed set of possible actions and a fixed loss, the paper identifies a consumer-specific source by merging states only when every available action has the same regret in both. For finite action sets, replacing the richer source by this reduced source preserves the complete one-step rate-regret curve, even though the reduction is fixed before the distortion target is chosen. A second result gives an exact characterization for quadratic loss on affine feasible-action sets: the canonical reduced source is the projection onto the directions in which feasible actions can differ. Under a fixed energy budget, this becomes centered load, while retaining only the optimal water-filled action is too coarse. Earlier Information Bottleneck, semantic rate-distortion, and goal-oriented quantization results are then used to distinguish exact, architecture-conditioned, approximate, failed, and corrected contractions. The framework suggests a way for heterogeneous machines to exchange what a receiving task needs without first aligning their full internal representations.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.08884 — 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-08T12:14:15.366Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).