Lectures :

1. Lecture 1: Introduction, course details, learning frameworks, A Bit of Fun [Notes]
   Reference : [1] (ch 1 and 3)
   Video in two parts (for some reason!) Part 1Part 2

2. Lecture 2: Online Bit Prediction and Cover's Result [Notes] (same as lecture 1)
   Video

3. Lecture 3: Cover's Result Rademacher Complexity and More [Notes] [Supplementary Material on Stability]
   

4. Lecture 4: Sequential Rademacher Complexity and Finite Lemma [Notes]
   Video

5. Lecture 5: Finite Lemma [Notes]
   Video

6. Lecture 6: Properties of Rademacher Complexity [Notes]
   Video

7. Lecture 7: Properties of Rademacher Complexity [Notes]
   Video

8. Lecture 8: Covering Numbers and Chaining [Notes]
   Video

9. Lecture 9: Covering Numbers and Chaining [Notes]
   Video

10. Lecture 10: Lower Bounds and Optimality [Notes]
    Video

11. Lecture 11: Relaxations [Notes]
    Video

12. Lecture 12: Relaxations [Notes]
    Video

13. Lecture 13: Online Mirror Descent [Notes]
    Video

14. Lecture 14: Online Mirror Descent [Notes] [Supplement]
    Video

15. Lecture 15: Online Mirror Descent Contd. [Notes]
    Video

16. Lecture 16: Online Linear Bandit Algorithms [Notes]
    Video

17. Lecture 17: Online Linear Bandit Algorithms [Notes]
    Video

18. Lecture 18: Lower Bounds with Stochastic Multi-armed Bandits [Notes]
    Video

19. Lecture 19: UCB Algorithm for Stochastic Multi-armed Bandits [Notes]
    Video

20. Lecture 20: Contextual Bandits [Notes]
    Video

21. Lecture 21: Oracle Efficient Contextual Bandits [Notes]
    Video

22. Lecture 22: Oracle Efficient Contextual Bandits [Notes]
    Video

23. Lecture 23: Decision Estimation Coefficient for Learning With Partial Information [Notes]
    Video

24. Lecture 24: Decision Estimation Coefficient for Learning With Partial Information [Notes]
    

---