Finite-Sample Symmetric Mean Estimation with Fisher Information Rate

June 28, 2023 Β· Declared Dead Β· πŸ› Annual Conference Computational Learning Theory

πŸ‘» 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 arXiv ID 2306.16573 Category math.ST Cross-listed cs.IT, cs.LG, math.PR, stat.ML Citations 8 Venue Annual Conference Computational Learning Theory Last Checked 6 months ago
Abstract
The mean of an unknown variance-$Οƒ^2$ distribution $f$ can be estimated from $n$ samples with variance $\frac{Οƒ^2}{n}$ and nearly corresponding subgaussian rate. When $f$ is known up to translation, this can be improved asymptotically to $\frac{1}{n\mathcal I}$, where $\mathcal I$ is the Fisher information of the distribution. Such an improvement is not possible for general unknown $f$, but [Stone, 1975] showed that this asymptotic convergence $\textit{is}$ possible if $f$ is $\textit{symmetric}$ about its mean. Stone's bound is asymptotic, however: the $n$ required for convergence depends in an unspecified way on the distribution $f$ and failure probability $Ξ΄$. In this paper we give finite-sample guarantees for symmetric mean estimation in terms of Fisher information. For every $f, n, Ξ΄$ with $n > \log \frac{1}Ξ΄$, we get convergence close to a subgaussian with variance $\frac{1}{n \mathcal I_r}$, where $\mathcal I_r$ is the $r$-$\textit{smoothed}$ Fisher information with smoothing radius $r$ that decays polynomially in $n$. Such a bound essentially matches the finite-sample guarantees in the known-$f$ setting.
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