Dimension-Free Exponentiated Gradient
published: Nov. 7, 2014, recorded: January 2014, views: 1714
Report a problem or upload filesIf 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.
We present a new online learning algorithm that extends the exponentiated gradient to infinite dimensional spaces. Our analysis shows that the algorithm is implicitly able to estimate the L2 norm of the unknown competitor, U, achieving a regret bound of the order of O(Ulog(UT+1))T−−√), instead of the standard O((U2+1)T−−√), achievable without knowing U. For this analysis, we introduce novel tools for algorithms with time-varying regularizers, through the use of local smoothness. Through a lower bound, we also show that the algorithm is optimal up to logT−−−−√ term for linear and Lipschitz losses
Download slides: machine_orabona_exponentiated_gradient_01.pdf (251.9 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !