1

Non-convex Distributionally Robust Optimization: Non-asymptotic Analysis
We proposed the first non-asymptotic analysis of algorithms for DRO with non-convex losses. Our algorithm incorporates momentum and adaptive step size, and has superior empirical performance.
Jikai Jin, Bohang Zhang, Haiyang Wang, Liwei Wang
PDF Cite ArXiv
Improved analysis of clipping algorithms for non-convex optimization
We provide an improved analysis of the convergence rates of clipping algorithms, theoretically justifying their superior performance in deep learning.
Bohang Zhang, Jikai Jin, Cong Fang, Liwei Wang
PDF Cite ArXiv