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

v1v2 (latest)

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

22 October 2020

Nicholas J. A. Harvey

ArXiv (abs)PDF HTML

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

9 / 9 papers shown

Title
Online Sequential Decision-Making with Unknown Delays Ping Wu Heyan Huang Zhengyang Liu 38 3 0 12 Feb 2024
A Unified Analysis for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions Daoli Zhu Lei Zhao Shuzhong Zhang 111 2 0 30 Aug 2023
GBM-based Bregman Proximal Algorithms for Constrained Learning Zhenwei Lin Qi Deng 62 1 0 21 Aug 2023
Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity Xiao Li Lei Zhao Daoli Zhu Anthony Man-Cho So 16 3 0 23 May 2023
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods Davoud Ataee Tarzanagh Parvin Nazari Bojian Hou Li Shen Laura Balzano 134 12 0 06 Jul 2022
Randomized Coordinate Subgradient Method for Nonsmooth Composite Optimization Lei Zhao Ding-Yuan Chen Daoli Zhu Xiao Li 62 1 0 30 Jun 2022
From the Greene--Wu Convolution to Gradient Estimation over Riemannian Manifolds Tianyu Wang Yifeng Huang Didong Li 40 8 0 17 Aug 2021
Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements Kimon Antonakopoulos P. Mertikopoulos 57 12 0 16 Jul 2021
Smoothness Analysis of Adversarial Training Sekitoshi Kanai Masanori Yamada Hiroshi Takahashi Yuki Yamanaka Yasutoshi Ida AAML 95 6 0 02 Mar 2021