Pith. sign in

REVIEW 1 cited by

Remote Inference over Dynamic Links via Adaptive Rate Deep Task-Oriented Vector Quantization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2501.02521 v1 pith:H2VOKGY3 submitted 2025-01-05 eess.SP cs.AI

classification eess.SPcs.AI
keywords inferenceremotecompressiondeepartoveqdatadynamiclearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A broad range of technologies rely on remote inference, wherein data acquired is conveyed over a communication channel for inference in a remote server. Communication between the participating entities is often carried out over rate-limited channels, necessitating data compression for reducing latency. While deep learning facilitates joint design of the compression mapping along with encoding and inference rules, existing learned compression mechanisms are static, and struggle in adapting their resolution to changes in channel conditions and to dynamic links. To address this, we propose Adaptive Rate Task-Oriented Vector Quantization (ARTOVeQ), a learned compression mechanism that is tailored for remote inference over dynamic links. ARTOVeQ is based on designing nested codebooks along with a learning algorithm employing progressive learning. We show that ARTOVeQ extends to support low-latency inference that is gradually refined via successive refinement principles, and that it enables the simultaneous usage of multiple resolutions when conveying high-dimensional data. Numerical results demonstrate that the proposed scheme yields remote deep inference that operates with multiple rates, supports a broad range of bit budgets, and facilitates rapid inference that gradually improves with more bits exchanged, while approaching the performance of single-rate deep quantization methods.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. OLALa: Online Learned Adaptive Lattice Codes for Heterogeneous Federated Learning

    eess.SP 2025-06 conditional novelty 6.0 of 10

    OLALa adapts lattice quantizers per client and per round in federated learning, preserving the O(1/T) convergence rate and improving accuracy over fixed lattice baselines.

Pith tools