97 search results - page 8 / 20 » Logarithmic Regret Algorithms for Online Convex Optimization |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In this paper we study the problem of online aligning a newly arrived image to previously well-aligned images. Inspired by recent advances in batch image alignment using low rank ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...