Lesi Chen
10 papers · 2022–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🐝 Cross-Pollinator (13) 🧭 Keyword Pioneer 🗺️ Taxonomy Completionist (10) 🌉 Interdisciplinary Bridge
🌍
Conference Polyglot
(6)
🏆
Keyword Champion
(2)
💎
Century Club
(10)
⚡
Prolific Year
(5)
Conferences
COLT (2)
ICML (2)
JMLR (2)
NIPS (2)
AISTATS (1)
ICLR (1)
Top co-authors
Keywords
bilevel optimization
(3)
nonconvex optimization
(3)
stochastic optimization
(3)
complexity bound
(2)
stochastic algorithm
(2)
polyak-łojasiewicz condition
(2)
convex optimization
(2)
first-order oracle
(2)
minimax optimization
(2)
gradient descent
(2)
near-optimal rate
(1)
first-order algorithm
(1)
saddle point
(1)
gradient descent ascent
(1)
polyak-lojasiewicz condition
(1)
stochastic minimax optimization
(1)
gradient oracle complexity
(1)
convex-concave setting
(1)
nonconvex-nonconcave setting
(1)
gradient-free method
(1)
Papers
Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles
JMLR 2025
Solving Convex-Concave Problems with $\mathcal{O}(\epsilon^{-4/7})$ Second-Order Oracle Complexity
COLT 2025
Second-Order Min-Max Optimization with Lazy Hessians
ICLR 2025
Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem
NIPS 2024
Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
JMLR 2024
An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
AISTATS 2024
On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis
COLT 2024
Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers
ICML 2024
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
ICML 2023
Faster Stochastic Algorithms for Minimax Optimization under Polyak-{\L}ojasiewicz Condition
NIPS 2022