Maximum Likelihood Estimation for Learning Populations of Parameters
Not on the map. Why?
Abstract (arXiv)
Consider a setting with N independent individuals, each with an unknown parameter, pi ∈ [0, 1] drawn from some unknown distribution P^star. After observing the outcomes of t independent Bernoulli trials, i.e., Xi ~ Binomial(t, pi) per individual, our objective is to accurately estimate P^star. This problem arises in numerous domains, including the social sciences, psychology, health-care, and biology, where the size of the population under study is usually large while the number of observations per individual is often limited. Our main result shows that, in the regime where t ll N, the maximum likelihood estimator (MLE) is both statistically minimax optimal and efficiently computable. Precisely, for sufficiently large N, the MLE achieves the information theoretic optimal error bound of O(frac1t) for t < clogN, with regards to the earth mover's distance (between the estimated and true distributions). More generally, in an exponentially large interval of t beyond c logN, the MLE achieves the minimax error bound of O(frac1√tlog N). In contrast, regardless of how large N is, the naive "plug-in" estimator for this problem only achieves the sub-optimal error of Theta(frac1√t).
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 2; 2024: 1; 2025: 0; 2026: 2.
11 papers.
- 2023Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variancescited by 5
- 2024Sharper Bounds for Chebyshev Moment Matching, with Applicationscited by 3
- 2022Probabilistic learning inference of boundary value problem with uncertainties based on Kullback-Leibler divergence under implicit constraintscited by 2
- 2022A Generative Framework for Personalized Learning and Estimation: Theory, Algorithms, and Privacycited by 2
- 2022Generalized Identifiability Bounds for Mixture Models with Grouped Samplescited by 2
- 2021Fisher-Pitman permutation tests based on nonparametric Poisson mixtures with application to single cell genomicscited by 1
- 2021NOTMAD: Estimating Bayesian Networks with Sample-Specific Structures and Parameterscited by 1
- 2023Testing with Non-identically Distributed Samplescited by 1
- 2026When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregationcited by 1
- 2021Nonparametric mixture MLEs under Gaussian-smoothed optimal transport distancecited by 0
- 2026Causal Inference with Unobserved Confounding: A Mixture Learning Perspectivecited by 0
- 2026Causal Inference with Unobserved Confounding: A Mixture Learning Perspective19 Sep 2026
- 2026When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation7 May 2026
- 2024Sharper Bounds for Chebyshev Moment Matching, with Applications22 Aug 2024
- 2023Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances5 Dec 2023
- 2023Testing with Non-identically Distributed Samples19 Nov 2023
- 2022Generalized Identifiability Bounds for Mixture Models with Grouped Samples22 Jul 2022
- 2022A Generative Framework for Personalized Learning and Estimation: Theory, Algorithms, and Privacy5 Jul 2022
- 2022Probabilistic learning inference of boundary value problem with uncertainties based on Kullback-Leibler divergence under implicit constraints10 Feb 2022
- 2021Nonparametric mixture MLEs under Gaussian-smoothed optimal transport distance4 Dec 2021
- 2021NOTMAD: Estimating Bayesian Networks with Sample-Specific Structures and Parameters1 Nov 2021
- 2021Fisher-Pitman permutation tests based on nonparametric Poisson mixtures with application to single cell genomics6 Jun 2021