default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuanhao Wang 0001
Person information
- affiliation: Princeton University, USA
- affiliation (former): Tsinghua University, Institute for Interdisciplinary Information Sciences, China
Other persons with the same name
- Yuanhao Wang 0002 — China Agricultural University, Guangzhou, China
- Yuanhao Wang 0003
![[0000-0003-2632-2326]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-2632-2326")
— King Abdullah University of Science and Technology, Thuwal, Saudi Arabia (and 1 more) - Yuanhao Wang 0004 — Brown University, Department of Computer Science, Providence, RI, USA
- Yuanhao Wang 0005 — Wuhan University of Technology, School of Logistic Engineering, China
- Yuanhao Wang 0006 — Chinese Academy of Sciences, Institute of Atmospheric Physics, Center for Monsoon System Research, Beijing, China
- Yuanhao Wang 0007 — National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
- Yuanhao Wang 0008 — Chongqing University, School of Big Data & Software Engineering, China
- Yuanhao Wang 0009 — Southeast University, School of Integrated Circuits, Nanjing, China
- Yuanhao Wang 0010 — Beihang University, School of Electronic Information Engineering, Beijing, China
- Yuanhao Wang 0011 — Carnegie Mellon University, Pittsburgh, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Aaron Mishkin, Ahmed Khaled, Yuanhao Wang, Aaron Defazio, Robert M. Gower:
Directional Smoothness and Gradient Methods: Convergence and Adaptivity. CoRR abs/2403.04081 (2024)- [i15]Jiawei Ge, Yuanhao Wang, Wenzhe Li, Chi Jin:
Towards Principled Superhuman AI for Multiplayer Symmetric Games. CoRR abs/2406.04201 (2024) - 2023
- [c12]Yuanhao Wang, Qinghua Liu, Yu Bai, Chi Jin:
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation. COLT 2023: 2793-2848 - [c11]Yuanhao Wang, Dingwen Kong, Yu Bai, Chi Jin:
Learning Rationalizable Equilibria in Multiplayer Games. ICLR 2023 - [c10]Yuanhao Wang, Qinghua Liu, Chi Jin:
Is RLHF More Difficult than Standard RL? A Theoretical Perspective. NeurIPS 2023 - [i14]Yuanhao Wang, Qinghua Liu, Yu Bai, Chi Jin:
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation. CoRR abs/2302.06606 (2023) - [i13]Yuanhao Wang, Qinghua Liu, Chi Jin:
Is RLHF More Difficult than Standard RL? CoRR abs/2306.14111 (2023) - 2022
- [c9]Guodong Zhang, Yuanhao Wang, Laurent Lessard, Roger B. Grosse:
Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization. AISTATS 2022: 7659-7679 - [c8]Qinghua Liu, Yuanhao Wang, Chi Jin:
Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits. ICML 2022: 14036-14053 - [i12]Qinghua Liu, Yuanhao Wang, Chi Jin:
Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits. CoRR abs/2203.06803 (2022) - [i11]Yuanhao Wang, Dingwen Kong, Yu Bai, Chi Jin:
Learning Rationalizable Equilibria in Multiplayer Games. CoRR abs/2210.11402 (2022) - 2021
- [c7]Guodong Zhang, Yuanhao Wang:
On the Suboptimality of Negative Momentum for Minimax Optimization. AISTATS 2021: 2098-2106 - [c6]Yi Tian, Yuanhao Wang, Tiancheng Yu, Suvrit Sra:
Online Learning in Unknown Markov Games. ICML 2021: 10279-10288 - [c5]Yuanhao Wang, Ruosong Wang, Sham M. Kakade:
An Exponential Lower Bound for Linearly Realizable MDP with Constant Suboptimality Gap. NeurIPS 2021: 9521-9533 - [i10]Guodong Zhang, Yuanhao Wang, Laurent Lessard, Roger B. Grosse:
Don't Fix What ain't Broke: Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization. CoRR abs/2102.09468 (2021) - [i9]Yuanhao Wang, Ruosong Wang, Sham M. Kakade:
An Exponential Lower Bound for Linearly-Realizable MDPs with Constant Suboptimality Gap. CoRR abs/2103.12690 (2021) - [i8]Chi Jin, Qinghua Liu, Yuanhao Wang, Tiancheng Yu:
V-Learning - A Simple, Efficient, Decentralized Algorithm for Multiagent RL. CoRR abs/2110.14555 (2021) - 2020
- [c4]Yuanhao Wang, Kefan Dong, Xiaoyu Chen, Liwei Wang:
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP. ICLR 2020 - [c3]Yuanhao Wang, Jiachen Hu, Xiaoyu Chen, Liwei Wang:
Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication. ICLR 2020 - [c2]Yuanhao Wang, Guodong Zhang, Jimmy Ba:
On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach. ICLR 2020 - [c1]Yuanhao Wang, Jian Li:
Improved Algorithms for Convex-Concave Minimax Optimization. NeurIPS 2020 - [i7]Yuanhao Wang, Jian Li:
Improved Algorithms for Convex-Concave Minimax Optimization. CoRR abs/2006.06359 (2020) - [i6]Guodong Zhang, Yuanhao Wang:
On the Suboptimality of Negative Momentum for Minimax Optimization. CoRR abs/2008.07459 (2020) - [i5]Yuanhao Wang, Kefan Dong:
Refined Analysis of FPL for Adversarial Markov Decision Processes. CoRR abs/2008.09251 (2020) - [i4]Yi Tian, Yuanhao Wang, Tiancheng Yu, Suvrit Sra:
Provably Efficient Online Agnostic Learning in Markov Games. CoRR abs/2010.15020 (2020)
2010 – 2019
- 2019
- [i3]Kefan Dong, Yuanhao Wang, Xiaoyu Chen, Liwei Wang:
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP. CoRR abs/1901.09311 (2019) - [i2]Yuanhao Wang, Jiachen Hu, Xiaoyu Chen, Liwei Wang:
Distributed Bandit Learning: How Much Communication is Needed to Achieve (Near) Optimal Regret. CoRR abs/1904.06309 (2019) - [i1]Yuanhao Wang, Guodong Zhang, Jimmy Ba:
On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach. CoRR abs/1910.07512 (2019)
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-12-22 19:57 CET 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:
