Skip to yearly menu bar Skip to main content


Poster

Fully Unconstrained Online Learning

Ashok Cutkosky · Zak Mhammedi

East Exhibit Hall A-C #4703
[ ]
Wed 11 Dec 4:30 p.m. PST — 7:30 p.m. PST

Abstract: We provide a technique for OLO that obtains regret GwTlog(wGT)+w2+G2 on G-Lipschitz losses for any comparison point w without knowing either G or w. Importantly, this matches the optimal bound GwT available with such knowledge (up to logarithmic factors), unless either w or G is so large that even GwT is roughly linear in T. Thus, at a high level it matches the optimal bound in all cases in which one can achieve sublinear regret.

Chat is not available.