Pith. sign in

REVIEW 2 cited by

Uniform bounds for robust 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 1812.03523 v4 pith:UXUBJTUG submitted 2018-12-09 math.ST math.PRstat.TH

classification math.STmath.PRstat.TH
keywords estimatorsmeanboundscorruptedmainmethodsproposedrobust
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper is devoted to the estimators of the mean that provide strong non-asymptotic guarantees under minimal assumptions on the underlying distribution. The main ideas behind proposed techniques are based on bridging the notions of symmetry and robustness. We show that existing methods, such as median-of-means and Catoni's estimators, can often be viewed as special cases of our construction. The main contribution of the paper is the proof of uniform bounds for the deviations of the stochastic process defined by proposed estimators. Moreover, we extend our results to the case of adversarial contamination where a constant fraction of the observations is arbitrarily corrupted. Finally, we apply our methods to the problem of robust multivariate mean estimation and show that obtained inequalities achieve optimal dependence on the proportion of corrupted samples.

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. 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. Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates

    cs.LG 2025-09 unverdicted novelty 6.0 of 10

    A novel robust asynchronous Q-learning algorithm achieves finite-time convergence rates that match clean-data bounds up to an additive term proportional to the corruption fraction, with a matching information-theoreti...

Pith tools