Off-the-shelf Algorithmic Stability
summary
Bagging is shown to stabilize any black‑box learner by averaging models trained on random bags and yields provable epsilon‑delta stability where delta epsilon^2 scales with n and the per‑bag inclusion probability p; examples include CNNs, trees, and logistic regression across bag size regimes (m small, m proportional to n, or m≈n−√n). For classification, aggregating class weight vectors plus an inflated argmax returns small stable label sets; experiments on Fashion MNIST and SINDy model selection confirm stability while typically preserving accuracy, at the cost of extra compute.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 1:29Algorithmic stability overview
- 10:07Bagging for stability
- 14:13Epsilon-delta stability guarantees
- 22:57Bagging: bias vs accuracy
- 30:48Stability in classification
- 38:13Selection stability with argmax
- 46:23Model selection trade-offs
- 49:38Open questions
- 50:22Q&A
related talks
01h 01mRobustness, Stochastics, Uncertainty 1
41mGeneralization Bounds for Uniformly Stable Algorithms
28mStability and Convergence Trade-Off of Iterative Optimization Algorithms
38mWhy giving your algorithm ALL THE FEATURES does not always work
27mPreventing Overfitting in Adaptive Data Analysis via Stability
53mDesigning Robust Learners
48mVariable Selection with Error Control: Another Look at Stability Selection
42mWhat (Doesn't) Make Learning Algorithms Generalize?
