Pith. sign in

REVIEW 1 cited by

Do we need to estimate the variance in robust mean estimation?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2107.00118 v5 pith:N2I7GDR2 submitted 2021-06-30 stat.ME math.STstat.TH

classification stat.MEmath.STstat.TH
keywords meanparameterestimatorrobustificationvariancedistributionsfunctionloss
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we propose self-tuned robust estimators for estimating the mean of heavy-tailed distributions, which refer to distributions with only finite variances. Our approach introduces a new loss function that considers both the mean parameter and a robustification parameter. By jointly optimizing the empirical loss function with respect to both parameters, the robustification parameter estimator can automatically adapt to the unknown data variance, and thus the self-tuned mean estimator can achieve optimal finite-sample performance. Our method outperforms previous approaches in terms of both computational and asymptotic efficiency. Specifically, it does not require cross-validation or Lepski's method to tune the robustification parameter, and the variance of our estimator achieves the Cram\'er-Rao lower bound. Project source code is available at \url{https://github.com/statsle/automean}.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set

    cs.LG 2026-07 accept novelty 7.0 of 10

    Fixed-action linear heteroscedastic bandits admit nearly harmonic-mean simple-regret rates that break the classical √Λ barrier, via variance-aware elimination and G-optimal design.

Pith tools