


default search action
Lesi Chen
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Lesi Chen, Haishan Ye, Luo Luo:
An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization. AISTATS 2024: 1990-1998 - [c6]Lesi Chen, Jing Xu, Jingzhao Zhang:
On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis. COLT 2024: 947-980 - [c5]Yuxing Liu, Lesi Chen, Luo Luo:
Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers. ICML 2024 - [c4]Huaqing Zhang, Lesi Chen, Jing Xu, Jingzhao Zhang:
Functionally Constrained Algorithm Solves Convex Simple Bilevel Problem. NeurIPS 2024 - [i8]Huaqing Zhang, Lesi Chen, Jing Xu, Jingzhao Zhang:
Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems. CoRR abs/2409.06530 (2024) - [i7]Lesi Chen, Chengchang Liu, Jingzhao Zhang:
Second-Order Min-Max Optimization with Lazy Hessians. CoRR abs/2410.09568 (2024) - 2023
- [c3]Lesi Chen, Jing Xu, Luo Luo:
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization. ICML 2023: 5219-5233 - [c2]Chengchang Liu
, Lesi Chen
, Luo Luo
, John C. S. Lui
:
Communication Efficient Distributed Newton Method with Fast Convergence Rates. KDD 2023: 1406-1416 - [i6]Lesi Chen, Jing Xu, Jingzhao Zhang:
On Bilevel Optimization without Lower-level Strong Convexity. CoRR abs/2301.00712 (2023) - [i5]Lesi Chen, Jing Xu, Luo Luo:
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization. CoRR abs/2301.06428 (2023) - [i4]Lesi Chen, Yaohua Ma, Jingzhao Zhang:
Near-Optimal Fully First-Order Algorithms for Finding Stationary Points in Bilevel Optimization. CoRR abs/2306.14853 (2023) - [i3]Lesi Chen, Boyuan Yao, Luo Luo:
Faster Stochastic Algorithms for Minimax Optimization under Polyak-Łojasiewicz Conditions. CoRR abs/2307.15868 (2023) - 2022
- [c1]Lesi Chen, Boyuan Yao, Luo Luo:
Faster Stochastic Algorithms for Minimax Optimization under Polyak-{\L}ojasiewicz Condition. NeurIPS 2022 - [i2]Lesi Chen, Luo Luo:
Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization. CoRR abs/2208.05925 (2022) - [i1]Lesi Chen, Haishan Ye, Luo Luo:
A Simple and Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization. CoRR abs/2212.02387 (2022)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-15 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint