November 2024 No Need for an Oracle: The Nonparametric Maximum Likelihood Decision in the Compound Decision Problem Is Minimax
Ya’acov Ritov
Author Affiliations +
Statist. Sci. 39(4): 637-643 (November 2024). DOI: 10.1214/24-STS940

Abstract

We discuss the asymptotics of the nonparametric maximum likelihood estimator (NPMLE) in the normal mixture model. We then prove the convergence rate of the NPMLE decision in the empirical Bayes problem with normal observations. We point to (and heavily use) the connection between the NPMLE decision and Stein unbiased risk estimator (SURE). Next, we prove that the same solution is optimal in the compound decision problem where the unobserved parameters are not assumed to be random.

Similar results are usually claimed using an oracle-based argument. However, we contend that the standard oracle argument is not valid. It was only partially proved that it can be fixed, and the existing proofs of these partial results are tedious. Our approach, on the other hand, is straightforward and short.

Funding Statement

This work was supported in part by NSF Grant DMS-2113364. This paper follows the author’s Blackwell Lecture, JSM 2023.

Citation

Download Citation

Ya’acov Ritov. "No Need for an Oracle: The Nonparametric Maximum Likelihood Decision in the Compound Decision Problem Is Minimax." Statist. Sci. 39 (4) 637 - 643, November 2024. https://doi.org/10.1214/24-STS940

Information

Published: November 2024
First available in Project Euclid: 30 October 2024

Digital Object Identifier: 10.1214/24-STS940

Keywords: compound decision , Empirical Bayes , minimax , Nonparametric maximum likelihood , oracle

Rights: Copyright © 2024 Institute of Mathematical Statistics

Vol.39 • No. 4 • November 2024
Back to Top