Computational Implications of Reducing Data to Sufficient Statistics
Not on the map. Why?
Abstract (arXiv)
Given a large dataset and an estimation task, it is common to pre-process the data by reducing them to a set of sufficient statistics. This step is often regarded as straightforward and advantageous (in that it simplifies statistical analysis). I show that -on the contrary- reducing data to sufficient statistics can change a computationally tractable estimation problem into an intractable one. I discuss connections with recent work in theoretical computer science, and implications for some techniques to estimate graphical models.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Sep 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 1; 2026: 2.
6 papers.
- 2023Learning quantum Hamiltonians at any temperature in polynomial timecited by 20
- 2023Provable benefits of score matchingcited by 18
- 2025Local Diffusion Models and Phases of Data Distributionscited by 8
- 2023Solution Path of Time-varying Markov Random Fields with Discrete Regularizationcited by 1
- 2026Computationally sufficient statistics for Ising modelscited by 0
- 2026Finite Sample Bounds for Learning with Score Matchingcited by 0
- 2026Finite Sample Bounds for Learning with Score Matching13 May 2026
- 2026Computationally sufficient statistics for Ising models12 Feb 2026
- 2025Local Diffusion Models and Phases of Data Distributions8 Aug 2025
- 2023Learning quantum Hamiltonians at any temperature in polynomial time3 Oct 2023
- 2023Solution Path of Time-varying Markov Random Fields with Discrete Regularization25 Jul 2023
- 2023Provable benefits of score matching3 Jun 2023