Yuanhao Wang

Affiliations:
  • Princeton University, USA
  • Tsinghua University, Institute for Interdisciplinary Information Sciences, China (former)


According to our database1, Yuanhao Wang authored at least 21 papers between 2019 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Towards Principled Superhuman AI for Multiplayer Symmetric Games.
CoRR, 2024

Directional Smoothness and Gradient Methods: Convergence and Adaptivity.
CoRR, 2024

2023
Is RLHF More Difficult than Standard RL?
CoRR, 2023

Is RLHF More Difficult than Standard RL? A Theoretical Perspective.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Learning Rationalizable Equilibria in Multiplayer Games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits.
Proceedings of the International Conference on Machine Learning, 2022

Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
V-Learning - A Simple, Efficient, Decentralized Algorithm for Multiagent RL.
CoRR, 2021

An Exponential Lower Bound for Linearly-Realizable MDPs with Constant Suboptimality Gap.
CoRR, 2021

Don't Fix What ain't Broke: Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization.
CoRR, 2021

An Exponential Lower Bound for Linearly Realizable MDP with Constant Suboptimality Gap.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Online Learning in Unknown Markov Games.
Proceedings of the 38th International Conference on Machine Learning, 2021

On the Suboptimality of Negative Momentum for Minimax Optimization.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Provably Efficient Online Agnostic Learning in Markov Games.
CoRR, 2020

Refined Analysis of FPL for Adversarial Markov Decision Processes.
CoRR, 2020

Improved Algorithms for Convex-Concave Minimax Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach.
Proceedings of the 8th International Conference on Learning Representations, 2020

Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication.
Proceedings of the 8th International Conference on Learning Representations, 2020

Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
Distributed Bandit Learning: How Much Communication is Needed to Achieve (Near) Optimal Regret.
CoRR, 2019


  Loading...