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

• URL: http://arxiv.org/abs/2602.12866v1
• Date: Fri, 13 Feb 2026 12:15:45 GMT
• Title: Model-Aware Rate-Distortion Limits for Task-Oriented Source Coding
• Authors: Andriy Enttsel, Vincent Corlay,
• Abstract summary: Task-Oriented Source Coding (TOSC) has emerged as a paradigm for efficient visual data communication in machine-centric inference systems.<n>We revisit the fundamental limits of single-TOSC through the lens of indirect rate-distortion theory.<n>We introduce task model-aware rate-distortion bounds that account for task model suboptimality and architectural constraints.
• Score: 6.502899393249507
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Quantization-Aware Collaborative Inference for Large Embodied AI Models [67.66340659245186]
  Large artificial intelligence models (LAIMs) are increasingly regarded as a core intelligence engine for embodied AI applications.<n>To address this issue, we investigate quantization-aware collaborative inference (co-inference) for embodied AI systems.
  arXiv  Detail & Related papers  (2026-02-13T16:08:19Z)
• On the Paradoxical Interference between Instruction-Following and Task Solving [50.75960598434753]
  Instruction following aims to align Large Language Models (LLMs) with human intent by specifying explicit constraints on how tasks should be performed.<n>We reveal a counterintuitive phenomenon: instruction following can paradoxically interfere with LLMs' task-solving capability.<n>We propose a metric, SUSTAINSCORE, to quantify the interference of instruction following with task solving.
  arXiv  Detail & Related papers  (2026-01-29T17:48:56Z)
• Adaptive Neighborhood-Constrained Q Learning for Offline Reinforcement Learning [52.03884701766989]
  offline reinforcement learning (RL) algorithms typically impose constraints on action selection.<n>We propose a new neighborhood constraint that restricts action selection in the Bellman target to the union of neighborhoods of dataset actions.<n>We develop a simple yet effective algorithm, Adaptive Neighborhood-constrained Q learning (ANQ), to perform Q learning with target actions satisfying this constraint.
  arXiv  Detail & Related papers  (2025-11-04T13:42:05Z)
• PL-CA: A Parametric Legal Case Augmentation Framework [10.998168534326709]
  Conventional RAG only injects retrieved documents directly into the model's context.<n>Many existing benchmarks lack expert annotation and focus solely on individual downstream tasks.<n>We propose PL-CA, which introduces a parametric RAG framework to perform data augmentation on corpus knowledge.
  arXiv  Detail & Related papers  (2025-09-08T06:08:06Z)
• R-ConstraintBench: Evaluating LLMs on NP-Complete Scheduling [0.0]
  We present R-ConstraintBench, a framework that evaluates models on Resource-Constrained Project Scheduling Problems (RCPSP)<n>We instantiate the benchmark in a data center migration setting and evaluate multiple LLMs using feasibility and error analysis.<n> Empirically, strong models are near-ceiling on precedence-only DAGs, but feasibility performance collapses when downtime, temporal windows, and disjunctive constraints interact.
  arXiv  Detail & Related papers  (2025-08-21T03:35:58Z)
• GLAD: Generalizable Tuning for Vision-Language Models [41.071911050087586]
  We propose a simpler and more general framework called GLAD (Generalizable LoRA tuning with RegulArized GraDient)<n>We show that merely applying LoRA achieves performance in downstream tasks comparable to current state-of-the-art prompt-based methods.
  arXiv  Detail & Related papers  (2025-07-17T12:58:15Z)
• Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models [66.57755931421285]
  Large-scale artificial intelligence (LAI) models pose significant challenges for real-time communication scenarios.<n>This paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models.<n>We propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference.
  arXiv  Detail & Related papers  (2025-06-16T08:42:16Z)
• The Larger the Merrier? Efficient Large AI Model Inference in Wireless Edge Networks [56.37880529653111]
  The demand for large computation model (LAIM) services is driving a paradigm shift from traditional cloud-based inference to edge-based inference for low-latency, privacy-preserving applications.<n>In this paper, we investigate the LAIM-inference scheme, where a pre-trained LAIM is pruned and partitioned into on-device and on-server sub-models for deployment.
  arXiv  Detail & Related papers  (2025-05-14T08:18:55Z)
• An unsupervised approach towards promptable defect segmentation in laser-based additive manufacturing by Segment Anything [7.188573079798082]
  We construct a framework for image segmentation using a state-of-the-art Vision Transformer (ViT) based Foundation model. We obtain high accuracy without using any labeled data to guide the prompt tuning process. We envision constructing a real-time anomaly detection pipeline that could revolutionize current laser additive manufacturing processes.
  arXiv  Detail & Related papers  (2023-12-07T06:03:07Z)
• Toward Certified Robustness Against Real-World Distribution Shifts [65.66374339500025]
  We train a generative model to learn perturbations from data and define specifications with respect to the output of the learned model. A unique challenge arising from this setting is that existing verifiers cannot tightly approximate sigmoid activations. We propose a general meta-algorithm for handling sigmoid activations which leverages classical notions of counter-example-guided abstraction refinement.
  arXiv  Detail & Related papers  (2022-06-08T04:09:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.