no code implementations • 2 Oct 2023 • Xuxing Chen, Krishnakumar Balasubramanian, Promit Ghosal, Bhavya Agrawalla
We conduct a comprehensive investigation into the dynamics of gradient descent using large-order constant step-sizes in the context of quadratic regression models.
no code implementations • 11 Jul 2023 • Xuxing Chen, Krishnakumar Balasubramanian, Saeed Ghadimi
We develop and analyze stochastic approximation algorithms for solving nested compositional bi-level optimization problems.
no code implementations • 21 Jun 2023 • Xuxing Chen, Tesi Xiao, Krishnakumar Balasubramanian
In this paper, we introduce a novel fully single-loop and Hessian-inversion-free algorithmic framework for stochastic bilevel optimization and present a tighter analysis under standard smoothness assumptions (first-order Lipschitzness of the UL function and second-order Lipschitzness of the LL function).
1 code implementation • 20 Feb 2023 • Tesi Xiao, Xuxing Chen, Krishnakumar Balasubramanian, Saeed Ghadimi
We focus on decentralized stochastic non-convex optimization, where $n$ agents work together to optimize a composite objective function which is a sum of a smooth term and a non-smooth convex term.
no code implementations • 23 Oct 2022 • Xuxing Chen, Minhui Huang, Shiqian Ma, Krishnakumar Balasubramanian
Bilevel optimization recently has received tremendous attention due to its great success in solving important machine learning problems like meta learning, reinforcement learning, and hyperparameter optimization.
no code implementations • 8 Feb 2022 • Minhui Huang, Xuxing Chen, Kaiyi Ji, Shiqian Ma, Lifeng Lai
Moreover, we propose an inexact NEgative-curvature-Originated-from-Noise Algorithm (iNEON), a pure first-order algorithm that can escape saddle point and find local minimum of stochastic bilevel optimization.