default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuan Li 0007
Person information
- unicode name: 李欢
- affiliation: Nankai University, Institute of Robotics and Automatic Information System, Tianjin, China
- affiliation (former): Nanjing University of Aeronautics and Astronautics, College of Computer Science and Technology, China
- affiliation (former, PhD 2019): Peking University, Key Laboratory of Machine Perception, Beijing, China
Other persons with the same name
- Huan Li (aka: Hu'an Li) — disambiguation page
- Huan Li 0001 — Beihang University, Beijing, China (and 1 more)
- Huan Li 0002
![[0000-0002-7840-1053]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-7840-1053")
— University of Pennsylvania, Department of Computer and Information Science, Philadelphia, PA, USA (and 1 more) - Huan Li 0003 — Zhejiang University, Department of Computer Science and Technology, Hangzhou, China (and 1 more)
- Huan Li 0004 — National Marine Data and Information Service, Tianjin, China (and 1 more)
- Huan Li 0005 — Chinese Academy of Sciences, Institute of Automation, Beijing, China
- Huan Li 0006 — Xidian University, School of Computer Science and Technology, Xi'an, China
- Huan Li 0008 — Université de Technologie de Belfort-Montbéliard, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[i13]Huan Li, Yiming Dong, Zhouchen Lin:
Convergence Rate Analysis of the AdamW-Style Shampoo: Unifying One-sided and Two-Sided Preconditioning. CoRR abs/2601.07326 (2026)- 2025
- [j14]Huan Li, Yiming Dong, Zhouchen Lin:
On the O(sqrt(d)/T^(1/4)) Convergence Rate of RMSProp and Its Momentum Extension Measured by l_1 Norm. J. Mach. Learn. Res. 26: 131:1-131:25 (2025) - [i12]Huan Li, Yiming Dong, Zhouchen Lin:
On the O(\frac{√d}}{K1/4}) Convergence Rate of AdamW Measured by ℓ1 Norm. CoRR abs/2505.11840 (2025) - [i11]Junjie Wang, Pan Zhou, Yiming Dong, Huan Li, Jia Li, Xun Zhou, Qicheng Lao, Cong Fang, Zhouchen Lin:
Conda: Column-Normalized Adam for Training Large Language Models Faster. CoRR abs/2509.24218 (2025) - 2024
- [j13]Huan Li, Zhouchen Lin:
Accelerated Gradient Tracking over Time-varying Graphs for Decentralized Optimization. J. Mach. Learn. Res. 25: 274:1-274:52 (2024) - [j12]Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan:
Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models. IEEE Trans. Pattern Anal. Mach. Intell. 46(12): 9508-9520 (2024) - [i10]Huan Li, Zhouchen Lin:
On the O(×d/T1/4) Convergence Rate of RMSProp and Its Momentum Extension Measured by 𝓁l Norm: Better Dependence on the Dimension. CoRR abs/2402.00389 (2024) - [i9]Yiming Dong, Huan Li, Zhouchen Lin:
Convergence Rate Analysis of LION. CoRR abs/2411.07724 (2024) - 2023
- [j11]Yibo Yang, Zhengyang Shen, Huan Li, Zhouchen Lin:
Optimization-inspired manual architecture design and neural architecture search. Sci. China Inf. Sci. 66(11) (2023) - [j10]Huan Li, Zhouchen Lin:
Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the in the O(epsilon^(-7/4)) Complexity. J. Mach. Learn. Res. 24: 157:1-157:37 (2023) - 2022
- [b2]Zhouchen Lin, Huan Li, Cong Fang:
Alternating Direction Method of Multipliers for Machine Learning. Springer 2022, ISBN 978-981-16-9839-2, pp. 1-263 - [j9]Huan Li, Zhouchen Lin, Yongchun Fang:
Variance Reduced EXTRA and DIGing and Their Optimal Acceleration for Strongly Convex Decentralized Optimization. J. Mach. Learn. Res. 23: 222:1-222:41 (2022) - [c5]Huan Li, Zhouchen Lin:
Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the O(ε-7/4) Complexity. ICML 2022: 12901-12916 - [i8]Huan Li, Zhouchen Lin:
Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the O(ε-7/4) Complexity. CoRR abs/2201.11411 (2022) - [i7]Xingyu Xie, Pan Zhou, Huan Li, Zhouchen Lin, Shuicheng Yan:
Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models. CoRR abs/2208.06677 (2022) - 2021
- [i6]Huan Li, Zhouchen Lin:
Accelerated Gradient Tracking over Time-varying Graphs for Decentralized Optimization. CoRR abs/2104.02596 (2021) - 2020
- [b1]Zhouchen Lin, Huan Li, Cong Fang:
Accelerated Optimization for Machine Learning - First-Order Algorithms. Springer 2020, ISBN 978-981-15-2909-2, pp. 1-275 - [j8]Huan Li, Zhouchen Lin:
On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent. J. Mach. Learn. Res. 21: 33:1-33:45 (2020) - [j7]Huan Li, Zhouchen Lin:
Provable accelerated gradient method for nonconvex low rank optimization. Mach. Learn. 109(1): 103-134 (2020) - [j6]Huan Li, Cong Fang, Zhouchen Lin:
Accelerated First-Order Optimization Algorithms for Machine Learning. Proc. IEEE 108(11): 2067-2082 (2020) - [j5]Huan Li, Zhouchen Lin:
Revisiting EXTRA for Smooth Distributed Optimization. SIAM J. Optim. 30(3): 1795-1821 (2020) - [j4]Huan Li, Cong Fang, Wotao Yin, Zhouchen Lin:
Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters. IEEE Trans. Signal Process. 68: 4855-4870 (2020) - [i5]Huan Li, Zhouchen Lin:
Revisiting EXTRA for Smooth Distributed Optimization. CoRR abs/2002.10110 (2020) - [i4]Huan Li, Zhouchen Lin, Yongchun Fang:
Optimal Accelerated Variance Reduced EXTRA and DIGing for Strongly Convex and Smooth Decentralized Optimization. CoRR abs/2009.04373 (2020)
2010 – 2019
- 2019
- [j3]Huan Li, Zhouchen Lin:
Accelerated Alternating Direction Method of Multipliers: An Optimal O(1 / K) Nonergodic Analysis. J. Sci. Comput. 79(2): 671-699 (2019) - 2018
- [j2]Canyi Lu, Huan Li, Zhouchen Lin:
Optimized projections for compressed sensing via direct mutual coherence minimization. Signal Process. 151: 45-55 (2018) - [c4]Huan Li, Zhouchen Lin:
Construction of Incoherent Dictionaries via Direct Babel Function Minimization. ACML 2018: 598-613 - [c3]Huan Li, Yibo Yang, Dongmin Chen, Zhouchen Lin:
Optimization Algorithm Inspired Deep Neural Network Structure Design. ACML 2018: 614-629 - [i3]Huan Li, Yibo Yang, Dongmin Chen, Zhouchen Lin:
Optimization Algorithm Inspired Deep Neural Network Structure Design. CoRR abs/1810.01638 (2018) - 2016
- [c2]Canyi Lu, Huan Li, Zhouchen Lin, Shuicheng Yan:
Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting. AAAI 2016: 739-745 - 2015
- [j1]Zhouchen Lin, Risheng Liu, Huan Li:
Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning. Mach. Learn. 99(2): 287-325 (2015) - [c1]Huan Li, Zhouchen Lin:
Accelerated Proximal Gradient Methods for Nonconvex Programming. NIPS 2015: 379-387 - [i2]Zhouchen Lin, Canyi Lu, Huan Li:
Optimized Projections for Compressed Sensing via Direct Mutual Coherence Minimization. CoRR abs/1508.03117 (2015) - [i1]Canyi Lu, Huan Li, Zhouchen Lin, Shuicheng Yan:
Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting. CoRR abs/1511.05133 (2015)
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 2026-06-09 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
