en-es
en
0.25
0.5
0.75
1.25
1.5
1.75
2
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret
Published on Aug 09, 20133296 Views
We consider algorithms for “smoothed online convex optimization” problems, a variant of the class of online convex optimization problems that is strongly related to metrical task systems. Prior litera
Related categories
Chapter list
Simultaneous Bounds on Competitiveness and Regret00:00
Key message00:12
Smoother Online Convex Optimization (1)00:50
Smoother Online Convex Optimization (2)01:12
Smoother Online Convex Optimization (3)01:21
Smoother Online Convex Optimization (4)01:26
Smoother Online Convex Optimization (5)01:46
SOCO Formulation (1)01:49
SOCO Formulation (2)02:31
SOCO Two views (1)03:12
Metrical Task System04:09
SOCO Two views (2)06:08
Online Convex Optimization06:40
SOCO Two views (3)07:56
SOCO: Fundamental Incompatibility (1)08:03
SOCO: Fundamental Incompatibility (2)09:06
SOCO: Fundamental Incompatibility (3)09:17
SOCO: Fundamental Incompatibility (4)10:47
SOCO: Fundamental Incompatibility (5)11:14
Incompatibility: Proof sketch (1)11:37
Incompatibility: Proof sketch (2)12:28
Incompatibility: Proof sketch (3)13:35
SOCO: Balancing the metrics (1)16:33
SOCO: Balancing the metrics (2)17:03
Summary17:38
Thanks18:18