Optimal estimation of the null distribution in large-scale inference
Not on the map. Why?
Abstract (arXiv)
The advent of large-scale inference has spurred reexamination of conventional statistical thinking. In a Gaussian model for n many z-scores with at most k < fracn2 nonnulls, Efron suggests estimating the location and scale parameters of the null distribution. Placing no assumptions on the nonnull effects, the statistical task can be viewed as a robust estimation problem. However, the best known robust estimators fail to be consistent in the regime k asymp n which is especially relevant in large-scale inference. The failure of estimators which are minimax rate-optimal with respect to other formulations of robustness (e.g. Huber's contamination model) might suggest the impossibility of consistent estimation in this regime and, consequently, a major weakness of Efron's suggestion. A sound evaluation of Efron's model thus requires a complete understanding of consistency. We sharply characterize the regime of k for which consistent estimation is possible and further establish the minimax estimation rates. It is shown consistent estimation of the location parameter is possible if and only if fracn2 - k = ω(√n), and consistent estimation of the scale parameter is possible in the entire regime k < fracn2. Faster rates than those in Huber's contamination model are achievable by exploiting the Gaussian character of the data. The minimax upper bound is obtained by considering estimators based on the empirical characteristic function. The minimax lower bound involves constructing two marginal distributions whose characteristic functions match on a wide interval containing zero. The construction notably differs from those in the literature by sharply capturing a scaling of n-2k in the minimax estimation rate of the location.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jan 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 2.
6 papers.
- 2025Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contaminationcited by 5
- 2024Efficient Sparse PCA via Block-Diagonalizationcited by 4
- 2025Entangled Mean Estimation in High-Dimensionscited by 3
- 2026Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transformscited by 1
- 2025Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contaminationcited by 0
- 2026Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contaminationcited by 0
- 2026Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination25 Feb 2026
- 2026Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms8 Jan 2026
- 2025Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination12 Oct 2025
- 2025Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination20 Feb 2025
- 2025Entangled Mean Estimation in High-Dimensions9 Jan 2025
- 2024Efficient Sparse PCA via Block-Diagonalization18 Oct 2024