High-dimensional Location Estimation via Norm Concentration for Subgamma Vectors
Shivam Gupta, Jasper C. H. Lee, Eric Price
Abstract
In location estimation, we are given n samples from a known distribution f shifted by an unknown translation λ, and want to estimate λ as precisely as possible. Asymptotically, the maximum likelihood estimate achieves the Cramér-Rao bound of error N (0, 1 nI ), where I is the Fisher information of f . However, the n required for convergence depends on f , and may be arbitrarily large. We build on the theory using smoothed estimators to bound the error for finite n in terms of I r , the Fisher information of the r-smoothed distribution. As n → ∞, r → 0 at an explicit rate and this converges to the Cramér-Rao bound. We (1) improve the prior work for 1-dimensional f to converge for constant failure probability in addition to high probability, and (2) extend the theory to high-dimensional distributions. In the process, we prove a new bound on the norm of a high-dimensional random variable whose 1-dimensional projections are subgamma, which may be of independent interest. Gupta et al. (2022) addressed this question in the special case of 1 dimension. They showed that, while the MLE can have bad finite-sample performance, it is possible to improve the behavior by a simple adaptation: add Gaussian noise of some appropriately chosen radius r, where r decreases with the number of samples, to both the samples and model before performing MLE. Accordingly, the theoretical guarantees for the smoothed MLE replaces the Fisher information of f with the Fisher information of the smoothed distribution f r , also called the Recent work by
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext fa9483ae-7e40-4f99-bc95-973f47a0afb5Cited by top-tier papers6
- Improved Sample Complexity Bounds for Diffusion Model TrainingShivam Gupta, Aditya Parulekar, Eric Price, Zhiyang XunNeurIPS 2024 · 16 citations
- Minimax-Optimal Location EstimationShivam Gupta, Jasper C. H. Lee, Eric Price, Paul ValiantNeurIPS 2023 · 6 citations
- Mitigating Instability in High Residual Adaptive Sampling for PINNs via Langevin DynamicsMinseok Jeong, Giup Seo, Euiseok HwangNeurIPS 2025 · 2 citations
- First Order Stochastic Optimization with Oblivious NoiseIlias Diakonikolas, Sushrut Karmalkar, Jongho Park, Christos TzamosNeurIPS 2023 · 1 citation
- Sharp Optimality of Simple, Plug-in Estimation of the Fisher Information of a Smoothed DensitySubhodh KotekalICML 2025
Builds on1
Related papers
- Optimal Sub-Gaussian Mean Estimation in Jasper C. H. Lee, Paul ValiantFOCS 2021 · 5 citations
- Outlier Robust Mean Estimation with Subgaussian Rates via StabilityIlias Diakonikolas, Daniel M. Kane, Ankit PensiaNeurIPS 2020 · 76 citations
- Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic LocalizationJoe Benton, Valentin De Bortoli, Arnaud Doucet, George DeligiannidisICLR 2024 · 203 citations
- Robust Mean Estimation Without Moments for Symmetric DistributionsGleb Novikov, David Steurer, Stefan TiegelNeurIPS 2023
- Curse of Dimensionality on Randomized Smoothing for Certifiable RobustnessAounon Kumar, Alexander Levine, Tom Goldstein, Soheil FeiziICML 2020 · 102 citations
