mlsanityData to 7 Oct 2026

Minimal Communication-Cost Statistical Learning

arXiv 2406.08193 ↗First posted 12 Jun 2024stat.ML cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

A client device which has access to n training data samples needs to obtain a statistical hypothesis or model W and then to send it to a remote server. The client and the server devices share some common randomness sequence as well as a prior on the hypothesis space. In this problem a suitable hypothesis or model W should meet two distinct design criteria simultaneously: (i) small (population) risk during the inference phase and (ii) small 'complexity' for it to be conveyed to the server with minimum communication cost. In this paper, we propose a joint training and source coding scheme with provable in-expectation guarantees, where the expectation is over the encoder's output message. Specifically, we show that by imposing a constraint on a suitable Kullback-Leibler divergence between the conditional distribution induced by a compressed learning model widehatW given W and the prior, one guarantees simultaneously small average empirical risk (aka training loss), small average generalization error and small average communication cost. We also consider a one-shot scenario in which the guarantees on the empirical risk and generalization error are obtained for every encoder's output message.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 34 references that are in the map. First posted on arXiv 12 Jun 2024.

Builds on

20 of 34 references.

References · 20

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  3. 2018Sparsified SGD with Memorycited by 373
  4. 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
  5. 2018Distributed learning of deep neural network over multiple agentscited by 277
  6. 2017Sparse Communication for Distributed Gradient Descentcited by 243
  7. 2018The Convergence of Sparsified Gradient Methodscited by 228
  8. 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 179
  9. 2018Error Compensated Quantized SGD and its Applications to Large-scale Distributed Optimizationcited by 76
  10. 2020Catastrophic Fisher Explosion: Early Phase Fisher Matrix Impacts Generalizationcited by 61
  11. 20158-Bit Approximations for Parallelism in Deep Learningcited by 56
  12. 2018Minimal Random Code Learning: Getting Bits Back from Compressed Model Parameterscited by 56
8 more
  1. 2018Distributed Variational Representation Learningcited by 32
  2. 2021Algorithms for the Communication of Samplescited by 31
  3. 2016Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithmcited by 29
  4. 2022Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithmscited by 22
  5. 2023Data-dependent Generalization Bounds via Variable-Size Compressibilitycited by 9
  6. 2019Exploring Fast and Communication-Efficient Algorithms in Large-scale Distributed Networkscited by 8
  7. 2021In-Network Learning: Distributed Training and Inference in Networkscited by 8
  8. 2023Semantic Communication of Learnable Conceptscited by 2

Built on by

Not cited yet.