Jul 2026
Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization
AdaOGD-PFS is proposed, an adaptive-step-size method that achieves O(sqrt(G_T) regret with per-round feasibility while preserving per-round feasibility and identifies a nonnegative Polyak correction P_T that enters the regret bound with a negative sign.
Wen-Tao Zhang
· Trans. Mach. Learn. Res. · 0 citations