From the 1 of 9 linked papers with an AI index.
9 papers
Halpern Iteration Achieves th-Order Oracle Complexity for Monotone Variational Inequalities
Lesi Chen, Xinliang Zhang, Hengyu Wang +3
We study second- and higher-order methods for solving smooth monotone variational inequalities (MVI). Monteiro and Svaiter (SIAM J. Optim., 2012) showed that a second-order method,…
Optimal Convex Optimization with Inexact Second-Order Oracles
Lesi Chen, Chengchang Liu, Luo Luo +2
In this paper, we present a novel second-order method called Accelerated Inexact Newton Extragradient (AINE) for convex optimization using -inexact Hessians. We show that AINE…
Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
Lesi Chen, Chengchang Liu, Luo Luo +1
The paper proposes new second‑order optimization algorithms that reduce the gradient complexity for both convex and nonconvex problems, establishing tighter theoretical bounds than…
On the Condition Number Dependency in Bilevel Optimization
Lesi Chen, Jingzhao Zhang, Kaiyi Ji
Bilevel optimization minimizes an objective function, defined by an upper-level problem whose feasible region is the solution of a lower-level problem. We study the oracle complexi…
Solving Convex-Concave Problems with th-Order Oracle Complexity
Lesi Chen, Xinliang Zhang, Chengchang Liu +3
When the objective has Lipschitz continuous th-order derivatives, it is known that convex-concave minimax problems can be solved with th-order or…
Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization
Lesi Chen, Junru Li, El Mahdi Chayti +1
This paper studies the complexity of finding an -stationary point for stochastic bilevel optimization when the upper-level problem is nonconvex and the lower-level problem is s…