An Empirical Bayes Perspective on Heteroskedastic Mean Estimation
Yanjun Han, Abhishek Shetty, and Jacob Shkrob

TL;DR
This paper develops an empirical Bayes method for heteroskedastic mean estimation with unknown variances, achieving near-optimal error bounds and adaptively handling the subset-of-signals problem without tuning.
Contribution
It introduces a profile MLE approach modeling observations as normal scale mixtures, with a sharper entropy bound and adaptive minimax rate achievement in heteroskedastic settings.
Findings
Achieves near-optimal mean squared error bounds.
Adaptively attains minimax rates in subset-of-signals problems.
Provides a sharper entropy bound for normal scale mixtures.
Abstract
Towards understanding the fundamental limits of estimation from data of varied quality, we study the problem of estimating a mean parameter from heteroskedastic Gaussian observations where the variances are unknown and may vary arbitrarily across observations. While a simple linear estimator with known variances attains the smallest mean squared error, estimation without this knowledge is challenging due to the large number of nuisance parameters. We propose a simple and principled approach based on empirical Bayes: model the observations as if they were i.i.d. from a normal scale mixture and compute the profile maximum likelihood estimator (MLE) for the mean, treating the nonparametric mixing distribution as nuisance. Our result shows that this estimator achieves near-optimal error bounds across various heteroskedastic models in the literature. In particular, for the subset-of-signals…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference · Machine Learning and Algorithms
