Model-Aware Rate-Distortion Limits for Task-Oriented Source Coding

Andriy Enttsel, Vincent Corlay
2/13/2026
cs.ITcs.LGeess.IV

No confident code implementation found for this paper.

Abstract

Task-Oriented Source Coding (TOSC) has emerged as a paradigm for efficient visual data communication in machine-centric inference systems, where bitrate, latency, and task performance must be jointly optimized under resource constraints. While recent works have proposed rate-distortion bounds for coding for machines, these results often rely on strong assumptions on task identifiability and neglect the impact of deployed task models. In this work, we revisit the fundamental limits of single-TOSC through the lens of indirect rate-distortion theory. We highlight the conditions under which existing rate-distortion bounds are achievable and show their limitations in realistic settings. We then introduce task model-aware rate-distortion bounds that account for task model suboptimality and architectural constraints. Experiments on standard classification benchmarks confirm that current learned TOSC schemes operate far from these limits, highlighting transmitter-side complexity as a key bottleneck.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{enttsel2026modelaware,
  title  = {Model-Aware Rate-Distortion Limits for Task-Oriented Source Coding},
  author = {Andriy Enttsel and Vincent Corlay},
  year   = {2026},
  eprint = {2602.12866},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.12866v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.12866.svg)](https://codeofpaper.com/paper/2602.12866)

Discussion