Optimal Sub-Gaussian Mean Estimation in $\mathbb{R}$

November 17, 2020 Β· Declared Dead Β· πŸ› IEEE Annual Symposium on Foundations of Computer Science

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jasper C. H. Lee, Paul Valiant arXiv ID 2011.08384 Category math.ST Cross-listed cs.DS, cs.IT, cs.LG, stat.ML Citations 3 Venue IEEE Annual Symposium on Foundations of Computer Science Last Checked 5 months ago
Abstract
We revisit the problem of estimating the mean of a real-valued distribution, presenting a novel estimator with sub-Gaussian convergence: intuitively, "our estimator, on any distribution, is as accurate as the sample mean is for the Gaussian distribution of matching variance." Crucially, in contrast to prior works, our estimator does not require prior knowledge of the variance, and works across the entire gamut of distributions with bounded variance, including those without any higher moments. Parameterized by the sample size $n$, the failure probability $Ξ΄$, and the variance $Οƒ^2$, our estimator is accurate to within $Οƒ\cdot(1+o(1))\sqrt{\frac{2\log\frac{1}Ξ΄}{n}}$, tight up to the $1+o(1)$ factor. Our estimator construction and analysis gives a framework generalizable to other problems, tightly analyzing a sum of dependent random variables by viewing the sum implicitly as a 2-parameter $ψ$-estimator, and constructing bounds using mathematical programming and duality techniques.
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