Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.07280 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915781525110784 |
|---|---|
| author | Kostina, Victoria |
| author_facet | Kostina, Victoria |
| contents | For several styles of fidelity constraints -- guaranteed distortion, conditional excess distortion, excess distortion -- we show mutual information upper bounds on the minimum expected description length needed to represent a random variable. Coupled with the corresponding converses, these results attest that as long as the information content in the data is not too low, minimizing the mutual information under an appropriate fidelity constraint serves as a reasonable proxy for the minimum description length of the data. We provide alternative characterizations of all three convex proxies, shedding light on the structure of their solutions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_07280 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Single-shot lossy compression: mutual information bounds Kostina, Victoria Information Theory For several styles of fidelity constraints -- guaranteed distortion, conditional excess distortion, excess distortion -- we show mutual information upper bounds on the minimum expected description length needed to represent a random variable. Coupled with the corresponding converses, these results attest that as long as the information content in the data is not too low, minimizing the mutual information under an appropriate fidelity constraint serves as a reasonable proxy for the minimum description length of the data. We provide alternative characterizations of all three convex proxies, shedding light on the structure of their solutions. |
| title | Single-shot lossy compression: mutual information bounds |
| topic | Information Theory |
| url | https://arxiv.org/abs/2602.07280 |