Compositional Properties of Statistical Procedures: An Information-Theoretic View
summary
Argues that mutual information and KL chain rules explain linear degradation under adaptive composition but fail for deterministic estimators (mutual information can be infinite), so stability uses erasure mutual information and, crucially, Wasserstein stability and transportation inequalities. Derives concrete bounds: Gibbs gives ~beta/N stability, SGD approximates ERM with extra error O(1/sqrt(T)) (so total O(1/N + 1/sqrt(T)); under strong convexity synchronous coupling yields contraction and stability essentially O(1/N). Uses Dobrushin comparison, couplings, and Markov-chain viewpoints; MCMC analysis is suggested but not completed.
AI-written summary · about
chapters (6)
- 0:00Introduction to statistical decision procedures
- 17:37Stability and information theoretic measures
- 26:12Geometric approach to stability and Wasserstein distance
- 35:13Analyzing stochastic gradient descent stability
- 44:15The de Bruijn comparison theorem for composition
- 52:52Detailed SGD analysis and conclusion
related talks
31mStrong Data Processing Inequalities and Estimation with Constraints
46mA Necessary and Sufficient Stability Notion for Adaptive Generalization
01h 15mAn overview of classical robust statistics and generalizations to the future
53mDesigning Robust Learners
01h 01mRobustness, Stochastics, Uncertainty 1
01h 01mRobustness, Stochastics, Uncertainty 2
28mData Driven Convergence in Statistical Estimators
12mIterative Methods and High-Dimensional Statistics
