Pith. sign in

REVIEW 2 cited by

Robust empirical mean Estimators

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 1112.3914 v1 pith:3OJYS3TM submitted 2011-12-16 math.ST stat.TH

classification math.STstat.TH
keywords problemestimatorsrobustestimationmeanconstructiondensityempirical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study robust estimators of the mean of a probability measure $P$, called robust empirical mean estimators. This elementary construction is then used to revisit a problem of aggregation and a problem of estimator selection, extending these methods to not necessarily bounded collections of previous estimators. We consider then the problem of robust $M$-estimation. We propose a slightly more complicated construction to handle this problem and, as examples of applications, we apply our general approach to least-squares density estimation, to density estimation with K\"ullback loss and to a non-Gaussian, unbounded, random design and heteroscedastic regression problem. Finally, we show that our strategy can be used when the data are only assumed to be mixing.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 54 citations worldwide. Full citation record

  1. Improved Concentration for Mean Estimators via Shrinkage

    math.ST 2025-12 conditional novelty 7.0 of 10

    A general class of shrinkage-based robust mean estimators is shown to attain near-optimal sub-Gaussian concentration whenever the base estimator has bounded error and is computed on an independent sample.

  2. On the Benefits of Accelerated Optimization in Robust and Private Estimation

    math.ST 2025-06 conditional novelty 6.0 of 10

    Momentum-accelerated Frank-Wolfe and gradient descent reduce both iteration counts and privacy noise for private and heavy-tailed-robust estimation, yielding rates such as 1/(nε) instead of 1/(nε)^{2/3}.

Pith tools