mlsanityData to 7 Oct 2026

Task-aware Distributed Source Coding under Dynamic Bandwidth

arXiv 2305.15523 ↗First posted 24 May 2023cs.IT cs.CV math.ITcited by 6

Not on the map. Why?

Abstract (arXiv)

Efficient compression of correlated data is essential to minimize communication overload in multi-sensor networks. In such networks, each sensor independently compresses the data and transmits them to a central node due to limited communication bandwidth. A decoder at the central node decompresses and passes the data to a pre-trained machine learning-based task to generate the final output. Thus, it is important to compress the features that are relevant to the task. Additionally, the final performance depends heavily on the total available bandwidth. In practice, it is common to encounter varying availability in bandwidth, and higher bandwidth results in better performance of the task. We design a novel distributed compression framework composed of independent encoders and a joint decoder, which we call neural distributed principal component analysis (NDPCA). NDPCA flexibly compresses data from multiple sources to any available bandwidth with a single model, reducing computing and storage overhead. NDPCA achieves this by learning low-rank task representations and efficiently distributing bandwidth among sensors, thus providing a graceful trade-off between performance and bandwidth. Experiments show that NDPCA improves the success rate of multi-view robotic arm manipulation by 9% and the accuracy of object detection tasks on satellite imagery by 14% compared to an autoencoder with uniform bandwidth allocation.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 24 of its 47 references that are in the map. First posted on arXiv 24 May 2023.

Builds on

24 of 47 references.

References · 24

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  2. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
  3. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
  6. 2018Variational image compression with a scale hyperpriorcited by 910
  7. 2016End-to-end Optimized Image Compressioncited by 673
  8. 2018Albumentations: fast and flexible image augmentationscited by 558
  9. 2018Behavioral Cloning from Observationcited by 482
  10. 2016Domain Separation Networkscited by 317
  11. 2020Training robust neural networks using Lipschitz boundscited by 98
  12. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70
12 more
  1. 2021Training Certifiably Robust Neural Networks with Efficient Local Lipschitz Boundscited by 64
  2. 2021Lossy Compression for Lossless Predictioncited by 51
  3. 2022Neural Distributed Image Compression with Cross-Attention Feature Alignmentcited by 15
  4. 2021Neural Distributed Source Codingcited by 13
  5. 2023LDMIC: Learning-based Distributed Multi-view Image Codingcited by 13
  6. 2023Collaborative Semantic Communication for Edge Inferencecited by 7
  7. 2021Task-aware Privacy Preservation for Multi-dimensional Datacited by 5
  8. 2022Decouple-and-Sample: Protecting sensitive information in task agnostic data releasecited by 4
  9. 2023Learning Sparse Control Tasks from Pixels by Latent Nearest-Neighbor-Guided Explorationscited by 4
  10. 2021Data Sharing and Compression for Cooperative Networked Controlcited by 3
  11. 2022Task-Aware Network Coding Over Butterfly Networkcited by 1
  12. 2022Differentially Private Timeseries Forecasts for Networked Controlcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 3; 2026: 1.

6 papers.