A Smoothed Analysis of the Greedy Algorithm for Linear Contextual Bandits - Theory Seminar

A Smoothed Analysis of the Greedy Algorithm for Linear Contextual Bandits - Theory Seminar

Paul G. Allen School via YouTube Direct link

Intro

1 of 16

1 of 16

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

A Smoothed Analysis of the Greedy Algorithm for Linear Contextual Bandits - Theory Seminar

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

  1. 1 Intro
  2. 2 meta-question
  3. 3 Classic Algorithm Design
  4. 4 Online Algorithms
  5. 5 Online ML Algorithms
  6. 6 Outline
  7. 7 Single-parameter model
  8. 8 Multi-parameter model
  9. 9 Regret wrt M
  10. 10 (good) performance of greedy algorithms?
  11. 11 Single-parameter regime
  12. 12 Multi-parameter regime
  13. 13 A change in perspective
  14. 14 Diversity
  15. 15 Margins
  16. 16 Why might we use greedy?

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.