Learning Theoretic Foundations of Data-Driven Algorithm Design

Learning Theoretic Foundations of Data-Driven Algorithm Design

International Mathematical Union via YouTube Direct link

Intro

1 of 11

1 of 11

Intro

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Learning Theoretic Foundations of Data-Driven Algorithm Design

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Machine Learning for Algorithm Design Learning algorithms for solving combinatorial problems. E.g.
  3. 3 Data-driven Algorithm Design Data-driven algo design: use learning & data for algo design. Suited when repeatedly solve instances of the same algo problem
  4. 4 Data-driven algorithm design: Problem Setup
  5. 5 Uniform Convergence Uniform convergence for any algo in Als, average performance over samples close to its expected performance. • Imply that Ā that does best over the sample has high expected perfor…
  6. 6 General Sample Complexity via Dual Classes
  7. 7 Pseudo-dimension (for real valued classes)
  8. 8 Pseudo-dimension, Uniform Convergence
  9. 9 Online Algorithm Selection (via online optimization of piecewise Lipschitz functions)
  10. 10 Online Regret Guarantees Existing techniques (for finite, linear, or convex case) select
  11. 11 Summary and Discussion Data-driven algo design can overcome major shortcomings of classic design by adapting the algo to the domain at hand. Different methods work better in different settings Learn …

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.