~/talk

Robust Estimation and Generative Adversarial Nets

name:Chao Gao
links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 0:52Huber's Model
  3. 3:19An Example
  4. 4:45Multivariate Location Depth
  5. 8:06Multi-task Regression Depth
  6. 12:55Covariance Matrix
  7. 15:24Summary
  8. 17:58Computational Challenges
  9. 18:18Advantages of Tukey Median
  10. 19:26f-Learning
  11. 26:17theoretical foundation
  12. 31:54JS-GAN
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.