Exploration with Limited Memory - Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits

Exploration with Limited Memory - Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits

Association for Computing Machinery (ACM) via YouTube Direct link

Intro

1 of 16

1 of 16

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Exploration with Limited Memory - Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits

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

  1. 1 Intro
  2. 2 A Naive Algorithm
  3. 3 Median Elimination (Even-Dar et al., 2002, 2006)
  4. 4 Sample Complexity
  5. 5 A twist on perspective: Memory
  6. 6 Streaming Coin Tossing Problem
  7. 7 Comparison with the Naive Algorithm
  8. 8 Motivating Question
  9. 9 First Attempt: Proof Sketch
  10. 10 Noisy Comparisons and Multi-Armed Bandits
  11. 11 Concepts and Notations
  12. 12 First Idea
  13. 13 Main Idea: Budgeting
  14. 14 Analysis: GAME-OF-COINS
  15. 15 Top-k Coins Algorithm
  16. 16 Conclusion and Summary

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.