Dependency-Aware HARQ and Link Adaptation for Wireless Transmission of Open-Vocabulary Scene Graphs
Abstract
Wireless visual uplinks increasingly carry structured representations for edge inference, making packet reliability part of task-aware link adaptation. In open-vocabulary scene-graph transmission, an indexed triplet is usable only if both its triplet packet and the vocabulary packets defining any newly introduced tokens are recovered. This prerequisite coupling makes the marginal value of packet reliability depend on neighboring packet reliabilities. We formulate a dependency-aware semantic distortion and jointly optimize finite choices of modulation and coding scheme (MCS), transmit power, and Chase-combining hybrid automatic repeat request (HARQ) depth under expected delay and energy constraints. The distortion is multi-affine in packet failure probabilities and cannot, in general, be reduced to static separable unequal error protection (UEP) weights when prerequisites are active. This structure yields a state-dependent reliability coefficient and explicit switching thresholds among wireless actions. A Lagrangian block method performs exact per-packet finite-action updates for fixed multipliers. On reduced instances, it matches exhaustive optimization in 28 of 30 cases, with a worst gap of 1.095%. On GQA traces using a table-driven block error rate (BLER) abstraction, it reduces mean semantic distortion by 58.71% and grounded-query failure by 57.03% relative to dependency-agnostic HARQ under the same budgets.
Related
- Point Cloud Transmission With Patch-Based Rate Adaptation
- Vocabulary Growth Fundamentals: Bernstein Functions and Hausdorff Sequences
- The Geometry of Updates: Fisher Alignment at Vocabulary Scale
- Vocabulary-size-independent Convergence of Discrete Diffusion Models: adjoint equations induce the right space
- Generalization properties of the token perceptron: the role of embedding and vocabulary
BibTeX
@misc{liu2026dependencyaware,
title = {{Dependency-Aware HARQ and Link Adaptation for Wireless Transmission of Open-Vocabulary Scene Graphs}},
author = {Yuli Liu and Jiacheng Ruan and Caiming Sun},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.08110},
eprint = {2608.08110},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.08110},
}
RIS
TY - UNPB
TI - Dependency-Aware HARQ and Link Adaptation for Wireless Transmission of Open-Vocabulary Scene Graphs
AU - Yuli Liu
AU - Jiacheng Ruan
AU - Caiming Sun
PY - 2026
DA - 2026/08/31
PB - arXiv
DO - 10.48550/arxiv.2608.08110
UR - https://arxiv.org/abs/2608.08110
AB - Wireless visual uplinks increasingly carry structured representations for edge inference, making packet reliability part of task-aware link adaptation. In open-vocabulary scene-graph transmission, an indexed triplet is usable only if both its triplet packet and the vocabulary packets defining any newly introduced tokens are recovered. This prerequisite coupling makes the marginal value of packet reliability depend on neighboring packet reliabilities. We formulate a dependency-aware semantic distortion and jointly optimize finite choices of modulation and coding scheme (MCS), transmit power, and Chase-combining hybrid automatic repeat request (HARQ) depth under expected delay and energy constraints. The distortion is multi-affine in packet failure probabilities and cannot, in general, be reduced to static separable unequal error protection (UEP) weights when prerequisites are active. This structure yields a state-dependent reliability coefficient and explicit switching thresholds among wireless actions. A Lagrangian block method performs exact per-packet finite-action updates for fixed multipliers. On reduced instances, it matches exhaustive optimization in 28 of 30 cases, with a worst gap of 1.095%. On GQA traces using a table-driven block error rate (BLER) abstraction, it reduces mean semantic distortion by 58.71% and grounded-query failure by 57.03% relative to dependency-agnostic HARQ under the same budgets.
ER -