Unconstrained Online Learning with Unbounded Losses

Andrew Jacobsen, Ashok Cutkosky

Abstract: Algorithms for online learning typically require one or more boundedness assumptions: that the domain is bounded, that the losses are Lipschitz, or both. In this paper, we develop a new setting for...