2 papers
math.OC2026
Mirror Descent Under Generalized Smoothness
Dingzhi Yu, Wei Jiang, Hongyi Tao +2
Smoothness is crucial for attaining fast rates in first-order optimization. However, many optimization problems in modern machine learning involve non-smooth objectives. Recent stu…
cs.LG2025
Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
Yuanyu Wan, Chang Yao, Yitao Ma +2
Although online convex optimization (OCO) under arbitrary delays has received increasing attention recently, previous studies focus on stationary environments with the goal of mini…