en-es
en
0.25
0.5
0.75
1.25
1.5
1.75
2
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization
Published on 2013-08-093077 Views
The problem of stochastic convex optimization with bandit feedback (in the learning community) or without knowledge of gradients (in the optimization community) has received much attention in recent y
Related categories
Presentation
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization00:00
Bandit / Derivative-Free Stochastic Convex Optimization - 100:01
Bandit / Derivative-Free Stochastic Convex Optimization - 200:37
Attainable Performance - 102:00
Attainable Performance - 202:35
Our Results - 104:24
Our Results - 205:29
Our Results - 306:55
Quadratic Functions: Upper Bounds - 107:19
Quadratic Functions: Upper Bounds - 208:02
Quadratic Functions: Upper Bounds - 308:55
Quadratic Functions: Upper Bounds - 409:32
Proof Idea10:40
Quadratic Functions: Lower Bounds11:42
Strongly Convex and Smooth Functions13:03
Summary14:25