An overview of classical robust statistics and generalizations to the future
summary
Huber theory is presented with precise claims: Huber loss is minimax-optimal for asymptotic variance under Huber ε‑contamination (γ is tuned to ε), the M‑estimator variance depends on ψ = l′ and the influence function proportional to ψ explains why bounded ψ controls robustness. Nonconvex “redescending” losses give finite rejection points. For heterogeneous one‑sample‑per‑distribution data, modal‑interval and shorth estimators with k ≈ log n succeed (classical cube‑root n−1/3 rates appear for other regimes). Private testing uses a clamped log-likelihood ratio per sample plus Laplace noise and is minimax‑optimal up to constants.
AI-written summary · about
chapters (13)
- 0:00Introduction to robustness
- 2:09M-estimators for location
- 5:28Huber contamination model
- 9:02Understanding M-estimators
- 13:38Minimax variance optimality
- 19:38Huber's saddle point solution
- 28:55Influence function framework
- 35:08Robustness of Huber estimator
- 40:41Redescending M-estimators
- 44:24Modern M-estimator settings
- 47:37Modal and shortest gap methods
- 52:16Asymptotics of unconventional estimators
- 56:53Robust testing and privacy
related talks
22mPanel Discussion
12mDistribution-Free Robustness
29mOn Learning Distributions from their Samples
53mDesigning Robust Learners
34mDistributional Robustness, Learning, and Empirical Likelihood
41mEfficient Algorithms for Outlier-Robust Regression
44mA Modern Maximum-Likelihood Theory for High-Dimensional Logistic Regression
48mComputational-Statistical Tradeoffs in Robust High-Dimensional Estimation
