On learning parametric distributions from quantized samples
Not on the map. Why?
Abstract (arXiv)
We consider the problem of learning parametric distributions from their quantized samples in a network. Specifically, n agents or sensors observe independent samples of an unknown parametric distribution; and each of them uses k bits to describe its observed sample to a central processor whose goal is to estimate the unknown distribution. First, we establish a generalization of the well-known van Trees inequality to general Lp-norms, with p > 1, in terms of Generalized Fisher information. Then, we develop minimax lower bounds on the estimation error for two losses: general Lp-norms and the related Wasserstein loss from optimal transport.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 17 references that are in the map. First posted on arXiv 25 May 2021.
Builds on
1 of 17 references.
References · 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Scalable Learning from Probability Measures with Mean Measure Quantization
- 2026Non-Adaptive 1-Bit Mean Estimation: Minimax Rates and the Sample-Interval Tradeoff
- 2024Finite Sample Bounds for Non-Parametric Regression: Optimal Sample Efficiency and Space Complexity
- 2022Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities
- 2026Minimax Optimality and Spectral Routing for Majority-Vote Ensembles under Markov Dependence
- 2022Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms
- 2026Minimax bounds for watermarked and masked recursive discrete distribution estimation
- 2026Spectral Perturbation of the Empirical Fisher Information Matrix under Weight Quantization