Finite-Sample Maximum Likelihood Estimation of Location

June 06, 2022 · Declared Dead · 🏛 Neural Information Processing Systems

👻 CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Shivam Gupta, Jasper C. H. Lee, Eric Price, Paul Valiant arXiv ID 2206.02348 Category math.ST Cross-listed cs.DS, cs.IT, cs.LG, stat.ML Citations 9 Venue Neural Information Processing Systems Last Checked 6 months ago
Abstract
We consider 1-dimensional location estimation, where we estimate a parameter $λ$ from $n$ samples $λ+ η_i$, with each $η_i$ drawn i.i.d. from a known distribution $f$. For fixed $f$ the maximum-likelihood estimate (MLE) is well-known to be optimal in the limit as $n \to \infty$: it is asymptotically normal with variance matching the Cramér-Rao lower bound of $\frac{1}{n\mathcal{I}}$, where $\mathcal{I}$ is the Fisher information of $f$. However, this bound does not hold for finite $n$, or when $f$ varies with $n$. We show for arbitrary $f$ and $n$ that one can recover a similar theory based on the Fisher information of a smoothed version of $f$, where the smoothing radius decays with $n$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — math.ST

Died the same way — 👻 Ghosted