Online Learning and Online Convex Optimization I

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=C26gciixFHk


Duration: 44:15
9,085 views
97

Nicolo Cesa-Bianchi, University of Milan
https://simons.berkeley.edu/talks/nicolo-cesa-bianchi-08-24-2016-1
Algorithms and Uncertainty Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2016-08-26Energy and Uncertainty II
2016-08-26Energy and Uncertainty I
2016-08-26Uncertainty in Algorithmic Mechanism Design
2016-08-25Understanding the Empirical Hardness of NP-Complete Problems II
2016-08-25Understanding the Empirical Hardness of NP-Complete Problems I
2016-08-25Beyond Worst-Case Analysis II
2016-08-25Beyond Worst-Case Analysis I
2016-08-24Reinforcement Learning and Markov Decision Processes II
2016-08-24Reinforcement Learning and Markov Decision Processes I
2016-08-24Online Learning and Online Convex Optimization II
2016-08-24Online Learning and Online Convex Optimization I
2016-08-24Sample Complexity and Uniform Convergence II
2016-08-24Sample Complexity and Uniform Convergence I
2016-08-23Online Scheduling Meets Queueing II
2016-08-23Online Scheduling Meets Queueing I
2016-08-23Competitive Analysis of Online Algorithms II
2016-08-23Competitive Analysis of Online Algorithms I
2016-08-22Sequential Decision Making: Prophets and Secretaries II
2016-08-22Sequential Decision Making: Prophets and Secretaries I
2016-08-22Approximation Algorithms for Stochastic Optimization II
2016-08-22Approximation Algorithms for Stochastic Optimization I


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Algorithms and Uncertainty Boot Camp
Nicolo Cesa-Bianchi