en-de
en-pt
en-sl
en
en-zh
en-fr
en-es
0.25
0.5
0.75
1.25
1.5
1.75
2
Bandit Algorithms for Online Linear Optimization
Published on 2009-08-265681 Views
In the online linear optimization problem a forecaster chooses, at each time instance, a vector x from a certain given subset S of the D-dimensional Euclidean space and suffers a time-dependent loss t