Task-Sufficient Contraction: Source Selection for Machine Information Interfaces
This paper studies when one such reduction preserves the complete downstream problem family, a property termed Task-Sufficient Contraction.
Key points
- A declared task can sometimes certify a reduced source before a downstream encoder, codebook, rate, distortion target, or optimizer 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.
- 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.
Sources (2)
- [1]Task-Sufficient Contraction: Source Selection for Machine Information InterfacesHugging Face Daily Papers · Oct 6, 12:00 AM
This paper studies when one such reduction preserves the complete downstream problem family, a property termed Task-Sufficient Contraction.
A declared task can sometimes certify a reduced source before a downstream encoder, codebook, rate, distortion target, or optimizer is chosen.
- [2]Task-Sufficient Contraction: Source Selection for Machine Information InterfacesarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 6, 12:30 PM · same content
Extractive summary: sentences quoted from the sources.