Qinghua Liu
20 papers · 2020–2025 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+11 more ↓ Show less ↑
π Academic Marathon (5) π Cross-Pollinator (10) π Conference Polyglot (7) π Interdisciplinary Bridge π Renaissance Researcher (7)
πΊοΈ
Taxonomy Completionist
(27)
π
Conference Polyglot
(7)
π
Academic Marathon
(5)
π€
Dynamic Duo
(12)
π
Triple Crown
π§¬
Topic Evolution
β
The Questioner
(3)
π
Century Club
(20)
β‘
Prolific Year
(5)
ποΈ
Keyword Collector
(68)
π₯
Unstoppable
(6)
Conferences
NIPS (9)
ICML (4)
COLT (2)
ICLR (2)
ACL (1)
ACML (1)
INTERSPEECH (1)
Top co-authors
Keywords
nash equilibrium
(6)
sample complexity
(5)
markov game
(4)
multi-agent reinforcement learning
(4)
regret bound
(2)
multi-agent learning
(2)
maximum likelihood estimation
(2)
zero-sum game
(2)
coarse correlated equilibrium
(2)
sample-efficient learning
(2)
game theory
(2)
convergence analysis
(1)
online learning
(1)
multimodal learning
(1)
time series anomaly detection
(1)
adversarial learning
(1)
function approximation
(1)
regret minimization
(1)
reinforcement learning theory
(1)
sample efficiency
(1)
Papers
Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment
ICML 2025
The Belief State Transformer
ICLR 2025
Evaluating the Long-Term Memory of Large Language Models
ACL 2025
DCoT: Dual Chain-of-Thought Prompting for Large Multimodal Models
ACML 2024
The Elephant in the Room: Towards A Reliable Time-Series Anomaly Detection Benchmark
NIPS 2024
PIAVE: A Pose-Invariant Audio-Visual Speaker Extraction Network
INTERSPEECH 2023
Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL
NIPS 2023
Is RLHF More Difficult than Standard RL? A Theoretical Perspective
NIPS 2023
Context-lumpable stochastic bandits
NIPS 2023
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation
COLT 2023
Sample-Efficient Reinforcement Learning of Partially Observable Markov Games
NIPS 2022
When Is Partially Observable Reinforcement Learning Not Scary?
COLT 2022
The Power of Exploiter: Provable Multi-Agent RL in Large State Spaces
ICML 2022
Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits
ICML 2022
Policy Optimization for Markov Games: Unified Framework and Faster Convergence
NIPS 2022
A Sharp Analysis of Model-based Reinforcement Learning with Self-Play
ICML 2021
Provable Rich Observation Reinforcement Learning with Combinatorial Latent States
ICLR 2021
Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms
NIPS 2021
Sample-Efficient Reinforcement Learning of Undercomplete POMDPs
NIPS 2020
Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimization
NIPS 2020