Completed
Complexity of Vector-valued Prediction: From Linear Models to Stochastic Convex Optimization 9:55-
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Algorithmic Learning Theory Research Presentations - Session 5
Automatically move to the next video in the Classroom when playback concludes
- 1 Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model -9:52
- 2 Complexity of Vector-valued Prediction: From Linear Models to Stochastic Convex Optimization 9:55-
- 3 Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms 21:33-
- 4 Ranking Items from Discrete Ratings: The Cost of Unknown User Thresholds 34:08-
- 5 Sparse Nonparametric Contextual Bandits 46:05-
