~/talk

Off-the-shelf Algorithmic Stability

links:none on file
slides:none on file

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

  1. 0:00Introduction
  2. 1:29Algorithmic stability overview
  3. 10:07Bagging for stability
  4. 14:13Epsilon-delta stability guarantees
  5. 22:57Bagging: bias vs accuracy
  6. 30:48Stability in classification
  7. 38:13Selection stability with argmax
  8. 46:23Model selection trade-offs
  9. 49:38Open questions
  10. 50:22Q&A
~/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.