Poster
Fully Unconstrained Online Learning
Ashok Cutkosky · Zak Mhammedi
East Exhibit Hall A-C #4703
Abstract:
We provide a technique for OLO that obtains regret on -Lipschitz losses for any comparison point without knowing either or . Importantly, this matches the optimal bound available with such knowledge (up to logarithmic factors), unless either or is so large that even is roughly linear in . Thus, at a high level it matches the optimal bound in all cases in which one can achieve sublinear regret.
Chat is not available.