default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunchi Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Florian Hübler, Junchi Yang, Xiang Li, Niao He:
Parameter-Agnostic Optimization under Relaxed Smoothness. AISTATS 2024: 4861-4869- [i9]Junchi Yang, Murat Yildirim, Qiu Feng:
Accelerating Distributed Optimization: A Primal-Dual Perspective on Local Steps. CoRR abs/2407.02689 (2024) - 2023
- [b1]Junchi Yang:
Towards Near-Optimal and Adaptive Algorithms in Minimax Optimization. ETH Zurich, Zürich, Switzerland, 2023 - [c8]Xiang Li, Junchi Yang, Niao He:
TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization. ICLR 2023 - [c7]Junchi Yang, Xiang Li, Ilyas Fatkhullin, Niao He:
Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods. NeurIPS 2023 - [c6]Liang Zhang, Junchi Yang, Amin Karbasi, Niao He:
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization. NeurIPS 2023 - [i8]Junchi Yang, Xiang Li, Ilyas Fatkhullin, Niao He:
Two Sides of One Coin: the Limits of Untuned SGD and the Power of Adaptive Methods. CoRR abs/2305.12475 (2023) - [i7]Liang Zhang, Junchi Yang, Amin Karbasi, Niao He:
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization. CoRR abs/2310.17759 (2023) - [i6]Florian Hübler, Junchi Yang, Xiang Li, Niao He:
Parameter-Agnostic Optimization under Relaxed Smoothness. CoRR abs/2311.03252 (2023) - 2022
- [c5]Junchi Yang, Antonio Orvieto, Aurélien Lucchi, Niao He:
Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity. AISTATS 2022: 5485-5517 - [c4]Junchi Yang, Xiang Li, Niao He:
Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization. NeurIPS 2022 - [i5]Junchi Yang, Xiang Li, Niao He:
Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization. CoRR abs/2206.00743 (2022) - [i4]Xiang Li, Junchi Yang, Niao He:
TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization. CoRR abs/2210.17478 (2022) - 2021
- [c3]Siqi Zhang, Junchi Yang, Cristóbal Guzmán, Negar Kiyavash, Niao He:
The complexity of nonconvex-strongly-concave minimax optimization. UAI 2021: 482-492 - [i3]Siqi Zhang, Junchi Yang, Cristóbal Guzmán, Negar Kiyavash, Niao He:
The Complexity of Nonconvex-Strongly-Concave Minimax Optimization. CoRR abs/2103.15888 (2021) - [i2]Junchi Yang, Antonio Orvieto, Aurélien Lucchi, Niao He:
Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity. CoRR abs/2112.05604 (2021) - 2020
- [c2]Junchi Yang, Negar Kiyavash, Niao He:
Global Convergence and Variance Reduction for a Class of Nonconvex-Nonconcave Minimax Problems. NeurIPS 2020 - [c1]Junchi Yang, Siqi Zhang, Negar Kiyavash, Niao He:
A Catalyst Framework for Minimax Optimization. NeurIPS 2020 - [i1]Junchi Yang, Negar Kiyavash, Niao He:
Global Convergence and Variance-Reduced Optimization for a Class of Nonconvex-Nonconcave Minimax Problems. CoRR abs/2002.09621 (2020)
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 2024-08-08 20:15 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:
