Robust Estimation and Generative Adversarial Nets
Talkat Robust and High-Dimensional Statistics (Simons Institute workshop, 2018) · 2018-10-29..11-02·
summary
Works through Huber epsilon contamination and shows that depth estimators like Tukey's median and multi-task regression depths achieve exact minimax rates for location, regression and covariance problems but are computationally intractable beyond p≈10. Casts depth as total variation F‑learning so GANs become optimization proxies. Pure TV‑GAN fails in practice, while JS‑GAN discriminators with hidden layers provably recover nonlinear moments and give robust estimators that scale to p≈5000. Practical caveat is unstable nonconvex optimization and simple fixes for covariance (intercept neuron or extra layer) are required.
AI-written summary · about
chapters (12)
- 0:00Intro
- 0:52Huber's Model
- 3:19An Example
- 4:45Multivariate Location Depth
- 8:06Multi-task Regression Depth
- 12:55Covariance Matrix
- 15:24Summary
- 17:58Computational Challenges
- 18:18Advantages of Tukey Median
- 19:26f-Learning
- 26:17theoretical foundation
- 31:54JS-GAN
related talks
11mNonparametric Density Estimation and Convergence of GANs under Besov IPMs
47mIs Minimax Optimization the Right Framework to Understand Learning in Minimax Games?
01h 00mTutorial on Deep Learning IV
01h 30mDeep Learning Techniques for Monocular Depth Estimation
52mDeep Generative Models And Unsupervised Methods For Inverse Problems
40mTraining generative models from locally privatized data via entropic optimal transport
43mHitchhiker’s Guide to Generative Adversarial Networks (GANs)
49mGeneralized Energy-Based Models
