2 citations · 6 across the 21 of their papers we have counts for
3 papers · 1 filter
Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
Francisco Patitucci, Ruichen Jiang, Aryan Mokhtari
A recent breakthrough in nonconvex optimization is the online-to-nonconvex conversion framework of [Cutkosky et al., 2023], which reformulates the task of finding an -…
On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
Jincheng Cao, Ruichen Jiang, Erfan Yazdandoost Hamedani +1
In this paper, we study the problem of solving a simple bilevel optimization problem, where the upper-level objective is minimized over the solution set of the lower-level problem.…
Online Learning-guided Learning Rate Adaptation via Gradient Alignment
Ruichen Jiang, Ali Kavis, Aryan Mokhtari
The performance of an optimizer on large-scale deep learning models depends critically on fine-tuning the learning rate, often requiring an extensive grid search over base learning…