Distributional Robustness, Learning, and Empirical Likelihood
summary
Claims that modest distributional robustness recovers a variance penalty and gives usable certificates, implemented two concrete tools: a convex reweighting using Empirical Likelihood Upper Confidence Bound with chi-squared divergence that solves in near-ERM time and raises Reuters recall on the rare “economics” class from ~68% to ~80% (~10% gain), and a Wasserstein balls approach that, with smooth nonlinearity approximations, yields neural-network training resistant to common white‑box attacks (FGSM, PGD) and produces conservative robustness certificates, but requires smoothness and large λ to avoid NP‑hardness.
AI-written summary · about
chapters (21)
- 0:00Intro
- 0:25Motivation
- 0:35Challenge one: Curly fries
- 1:26Challenge two changes in environment
- 1:47Challenge three adversaries
- 2:58Stochastic optimization problems
- 3:47Distributional robustness
- 5:08Vignette one regularization by variance
- 6:44Optimizing for bias and variance
- 7:21Empirical likelihood and robustness
- 10:07Optimal bias variance tradeoff
- 10:54Experiment: Reuters Corpus (multi-label)
- 14:56Vignette two: Wasserstein robustness
- 15:47Challenges
- 19:56Duality and robustness
- 20:48Stochastic gradient algorithm
- 21:55A certificate of robustness
- 22:46Digging into neural networks
- 23:57Experimental results adversarial classification
- 27:39Reading tea leaves
- 28:26Reinforcement learning?
related talks
12mDistribution-Free Robustness
53mDesigning Robust Learners
01h 17mRobust Optimization and Generalization
22mPanel Discussion
01h 28mMulti-Distribution Learning, for Robustness, Fairness, and Collaboration
01h 24mAdversarial Examples
01h 01mRobustness, Stochastics, Uncertainty 1
42mBeyond Adversarial Approaches on Distributional Robustness
