On Estimation of $L_r$-Norms in Gaussian White Noise Models

Abstract

We provide a complete picture of asymptotically minimax estimation of $L_r$-norms (for any $r\ge 1$) of the mean in Gaussian white noise model over Nikolskii-Besov spaces. In this regard, we complement the work of Lepski, Nemirovski and Spokoiny (1999), who considered the cases of $r=1$ (with poly-logarithmic gap between upper and lower bounds) and $r$ even (with asymptotically sharp upper and lower bounds) over Hölder spaces. We additionally consider the case of asymptotically adaptive minimax estimation and demonstrate a difference between even and non-even $r$ in terms of an investigator's ability to produce asymptotically adaptive minimax estimators without paying a penalty.

arXiv commentThis version (v6) fixed an error in the proof of Lemma 5.6, and corrected some typos

References in corpus (8)

• Does Dirichlet Prior Smoothing Solve the Shannon Entropy Estimation Problem?
• Maximum Likelihood Estimation of Functionals of Discrete Distributions
• Higher order influence functions and minimax estimation of nonlinear functionals
• Testing composite hypotheses, Hermite polynomials and optimal estimation of a nonsmooth functional
• Nonquadratic estimators of a quadratic functional
• Minimax Estimation of the $L_1$ Distance
• Minimax Rate-Optimal Estimation of Divergences between Discrete Distributions
• Optimal rates of entropy estimation over Lipschitz balls

Cited by in corpus (4)

• The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal
• Minimax Rate-Optimal Estimation of Divergences between Discrete Distributions
• On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood
• Optimal Estimation of Schatten Norms of a rectangular Matrix