12 papers
Doc2Harness: Benchmarking LLMs on Long-Horizon Harness Engineering of Coding Agents
Yuyao Ge, Shenghua Liu, Peizhong Gao +8
Agents driven by large language models are increasingly deployed on long-horizon tasks, where they use tools and modify real workspaces. How well they perform depends as much on th…
Optimal High-Order Methods for Solving Monotone Variational Inequalities
Xinliang Zhang, Lesi Chen, Linxuan Pan +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,…
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 c…
Second-Order Bilevel Optimization with Accelerated Convergence Rates
Sheng Yang, Chengchang Liu, Lesi Chen +1
This paper studies second-order methods for nonconvex-strongly-convex bilevel optimization. We propose a novel fully second-order bilevel approximation method (FSBA) that achieves…
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 ora…
On the Condition Number Dependency in Bilevel Optimization
Lesi Chen, Kaiyi Ji, Jingzhao Zhang
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…
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 st…
Solving Convex-Concave Problems with Second-Order Oracle Complexity
Lesi Chen, Chengchang Liu, Luo Luo +1
Previous algorithms can solve convex-concave minimax problems with second-order oracle calls usin…
Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
Lesi Chen, Chengchang Liu, Luo Luo +1
Second-order optimization methods are computationally expensive for large-scale problems. Recently, Doikov, Chayti, and Jaggi (ICML 2023) proposed the LazyCRN method that reduces c…
Second-Order Min-Max Optimization with Lazy Hessians
Lesi Chen, Chengchang Liu, Jingzhao Zhang
This paper studies second-order methods for convex-concave minimax optimization. Monteiro and Svaiter (2012) proposed a method to solve the problem with an optimal iteration comple…
Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
Huaqing Zhang, Lesi Chen, Jing Xu +1
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundament…