News:
"Conference on Online Learning Theory" seems to be the appropriate name for COLT'08, judging by the number of online-learning and, in particular, bandit papers.
We found an efficient sqrt{T}-regret algorithm for the adversarial continuum-armed bandit problem over arbitrary convex sets.
I finished a new
teapot.
Next conference: Foundations of Computational Mathematics, 16-18 June 2008, Hong Kong, China.
UC Berkeley
527 Soda Hall
Berkeley, CA 94720
E-mail: rakhlin
at cs dot berkeley dot edu
|