Yuanhao Wang
15 papers · 2020–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🏃 Academic Marathon (5) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (6) 🐝 Cross-Pollinator (4)
🏃
Academic Marathon
(5)
🧭
Keyword Pioneer
🐝
Cross-Pollinator
(4)
🔥
Unstoppable
(6)
💎
Century Club
(15)
❓
The Questioner
🗃️
Keyword Collector
(52)
Conferences
NIPS (5)
ICLR (3)
ICML (3)
AISTATS (2)
COLT (1)
ECCV (1)
Top co-authors
Keywords
minimax optimization
(3)
convergence rate
(3)
nash equilibrium
(2)
regret bound
(2)
convex optimization
(2)
markov game
(2)
reinforcement learning from human feedback
(1)
reward-based learning
(1)
online learning
(1)
multi-agent learning
(1)
gradient descent
(1)
linear function approximation
(1)
tensor factorization
(1)
linear convergence
(1)
sample complexity
(1)
zero-sum game
(1)
condition number
(1)
markov decision process
(1)
sublinear regret
(1)
adversarial learning
(1)
Papers
Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games
ICML 2025
Directional Smoothness and Gradient Methods: Convergence and Adaptivity
NIPS 2024
Is RLHF More Difficult than Standard RL? A Theoretical Perspective
NIPS 2023
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation
COLT 2023
Learning Adaptive Tensorial Density Fields for Clean Cryo-ET Reconstruction
NIPS 2023
Learning Rationalizable Equilibria in Multiplayer Games
ICLR 2023
Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits
ICML 2022
Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization
AISTATS 2022
On the Suboptimality of Negative Momentum for Minimax Optimization
AISTATS 2021
An Exponential Lower Bound for Linearly Realizable MDP with Constant Suboptimality Gap
NIPS 2021
Online Learning in Unknown Markov Games
ICML 2021
Stereo Event-based Particle Tracking Velocimetry for 3D Fluid Flow Reconstruction
ECCV 2020
Improved Algorithms for Convex-Concave Minimax Optimization
NIPS 2020
Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication
ICLR 2020
Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP
ICLR 2020