Lesi Chen

Orcid: 0009-0006-8213-2294

According to our database1, Lesi Chen authored at least 14 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2022
2023
2024
0
1
2
3
4
5
6
7
2
3
2
4
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Second-Order Min-Max Optimization with Lazy Hessians.
CoRR, 2024

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems.
CoRR, 2024

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Faster Stochastic Algorithms for Minimax Optimization under Polyak-Łojasiewicz Conditions.
CoRR, 2023

Near-Optimal Fully First-Order Algorithms for Finding Stationary Points in Bilevel Optimization.
CoRR, 2023

On Bilevel Optimization without Lower-level Strong Convexity.
CoRR, 2023

Communication Efficient Distributed Newton Method with Fast Convergence Rates.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization.
Proceedings of the International Conference on Machine Learning, 2023

2022
A Simple and Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization.
CoRR, 2022

Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization.
CoRR, 2022

Faster Stochastic Algorithms for Minimax Optimization under Polyak-{\L}ojasiewicz Condition.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022


  Loading...