Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations

author: Francesco Orabona, Toyota Technological Institute at Chicago
published: July 15, 2014,   recorded: June 2014,   views: 41
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

We study algorithms for online linear optimization in Hilbert spaces, focusing on the case where the player is unconstrained. We develop a novel characterization of a large class of minimax algorithms, recovering, and even improving, several previous results as immediate corollaries. Moreover, using our tools, we develop an algorithm that provides a regret bound of O(UTlog(UT−−√log2T+1)√), where U is the L2 norm of an arbitrary comparator and both T and U are unknown to the player. This bound is optimal up to loglogT√ terms. When T is known, we derive an algorithm with an optimal regret bound (up to constant factors). For both the known and unknown T case, a Normal approximation to the conditional value of the game proves to be the key analysis tool.

See Also:

Download slides icon Download slides: colt2014_orabona_learning.pdf (461.6 KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: