AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Finite-Sample Maximum Likelihood Estimation of Location

Shivam Gupta, Jasper C.H. Lee, Eric Price, Paul Valiant

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
apply Gaussian smoothing (r=0.05) before MLEMLE · Gaussian-spiked Laplace, n=500estimation errorImproved
smoothed MLE (r=0.05) instead of unsmoothed MLE at large nMLE · Gaussian-spiked Laplace, n=3000estimation errorMixed
increase smoothing parameter r for small n (below about 1000) (ablation)smoothed MLE · Gaussian-spiked Laplace, n<1000mean squared errorMixed
increase smoothing parameter r for large n (n >> 1000) (ablation)smoothed MLE · Gaussian-spiked Laplace, n>>1000mean squared errorHurt
use smoothed MLE instead of empirical mean or Lee-Valiant estimatormean estimation baselines · Gaussian-spiked Laplace, n=500estimation errorImproved
use unsmoothed MLE instead of empirical mean or Lee-Valiant at n=3000mean estimation baselines · Gaussian-spiked Laplace, n=3000estimation errorImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy