mlsanityData to 7 Oct 2026

Statistical Inference with Limited Memory: A Survey

arXiv 2312.15225 ↗First posted 23 Dec 2023cs.LG cs.IT math.ITcited by 1

Not on the map. Why?

Abstract (arXiv)

The problem of statistical inference in its various forms has been the subject of decades-long extensive research. Most of the effort has been focused on characterizing the behavior as a function of the number of available samples, with far less attention given to the effect of memory limitations on performance. Recently, this latter topic has drawn much interest in the engineering and computer science literature. In this survey paper, we attempt to review the state-of-the-art of statistical inference under memory constraints in several canonical problems, including hypothesis testing, parameter estimation, and distribution property testing/estimation. We discuss the main results in this developing field, and by identifying recurrent themes, we extract some fundamental building blocks for algorithmic construction, as well as useful techniques for lower bound derivations.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 140 references that are in the map. First posted on arXiv 23 Dec 2023.

Builds on

25 of 140 references.

References · 25

  1. 2020The Information Bottleneck Problem and Its Applications in Machine Learningcited by 66
  2. 2015Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequalitycited by 50
  3. 2018Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraintscited by 33
  4. 2016Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learningcited by 32
  5. 2018Inference under Information Constraints I: Lower Bounds from Chi-Square Contractioncited by 31
  6. 2014On Communication Cost of Distributed Statistical Estimation and Dimensionalitycited by 24
  7. 2013Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimationcited by 23
  8. 2019Memory-Sample Tradeoffs for Linear Regression with Small Errorcited by 22
  9. 2019Inference under Information Constraints II: Communication Constraints and Shared Randomnesscited by 22
  10. 2014Testing Identity of Structured Distributionscited by 19
  11. 2017Optimal Identity Testing with High Probabilitycited by 19
  12. 2018Detecting Correlations with Little Memory and Communicationcited by 19
13 more
  1. 2021Inference under Information Constraints III: Local Privacy Constraintscited by 13
  2. 2022Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalitiescited by 11
  3. 2019Communication and Memory Efficient Testing of Discrete Distributionscited by 8
  4. 2021Memory-Sample Lower Bounds for Learning Parity with Noisecited by 8
  5. 2019Estimating Entropy of Distributions in Constant Spacecited by 7
  6. 2019Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fitcited by 5
  7. 2019Communication Complexity of Estimating Correlationscited by 4
  8. 2018Distributed Estimation of Gaussian Correlationscited by 3
  9. 2022Estimation of Entropy in Constant Space with Improved Sample Complexitycited by 3
  10. 2023Testing properties of distributions in the streaming modelcited by 3
  11. 2020An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryptioncited by 1
  12. 2020Comparison Graphs: a Unified Method for Uniformity Testingcited by 1
  13. 2023Simpler Distribution Testing with Little Memorycited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.