~/talk

What (Doesn't) Make Learning Algorithms Generalize?

name:Roi Livni
links:none on file
slides:none on file

Shows that empirical risk minimization needs dimension-dependent samples (at least log D) while adding regularization yields 1/ε^2 sample complexity for stochastic convex optimization; full gradient descent can require m^2 steps to be stable and generalize, but stochastic gradient descent generalizes with only m steps despite producing predictors that fail conventional simplicity or stability tests. Proofs use a max-coordinate construction and assume a first-order oracle (value and gradient) to build explicit counterexamples and bounds.

AI-written summary · about

  1. 0:00Intro
  2. 1:21Hardness of learning
  3. 2:55Common practice in machine learning
  4. 9:00Resolving Conundrum: Non uniform rates
  5. 10:35Example: Linear optimization
  6. 15:03Stochastic Convex Optimization as a case study
  7. 23:21Case Study1: Gradient Descent
  8. 26:35Implicit regularization?
  9. 28:19Case Study1.5: Regularized Gradient Descent
  10. 29:36Case Study 1.75: Any type regularized GD?
  11. 30:22Proof idea of ALK'21
  12. 31:41Case Study2: Stochastic Gradient Descent
  13. 33:05Proof (ignoring projections)
  14. 36:50SGD doesn't minimize the empirical risk
~/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.