2 papers
cs.LG2024
Universal Online Convex Optimization Meets Second-order Bounds
Lijun Zhang, Yibo Wang, Guanghui Wang +2
Recently, several universal methods have been proposed for online convex optimization, and attain minimax rates for multiple types of convex functions simultaneously. However, they…
cs.LG2024
Riemannian Projection-free Online Learning
Zihao Hu, Guanghui Wang, Jacob Abernethy
The projection operation is a critical component in a wide range of optimization algorithms, such as online gradient descent (OGD), for enforcing constraints and achieving optimal…