~/talk

Optimization for Machine Learning I

links:none on file
slides:none on file

Casts learning as optimization over parameters and proves convex relaxations let local gradient info give global guarantees; uses stochastic gradient descent (one-sample updates) derived from follow-the-regularized-leader and shows expected error/regret scales as 1/sqrt(T), so epsilon accuracy needs O(1/epsilon^2) iterations. Presents FTRL/entropy and Euclidean regularizers (recovering multiplicative weights and GD), explains AdaGrad’s adaptive matrices for sparse data and claims instance-dependent √d improvements in regret.

AI-written summary · about

  1. 0:00Intro
  2. 3:15Mathematical optimization
  3. 5:03Learning - optimization over data laka. Empirical Risk Minimization
  4. 7:02Example: linear classification
  5. 11:29Convexity
  6. 14:11Convex relaxations for linear & kernel
  7. 16:16Gradient descent, constrained set
  8. 17:50Convergence of gradient descent
  9. 24:43Gradient Descent -caveat
  10. 27:17Statistical (PAC) learning
  11. 32:33Online gradient descent Zinkevich '05
  12. 34:31More powerful setting: Online Learning in Games
  13. 37:19Analysis
  14. 39:18Lower bound
  15. 45:10Stochastic gradient descent
  16. 47:38Stochastic vs. full gradient descent
  17. 53:24Minimize regret: best-in-hindsight
  18. 56:30Fixing FTL: Follow-The-Regularized-Leader (FTRL)
~/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.