Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses

Recently, researchers from convex optimization proposed the notions of "relative Lipschitz continuity" and "relative strong convexity". Both of the notions are generalizations oftheirclassicalcounterparts.