Distributed Bandit Learning: How Much Communication is Needed to Achieve (Near) Optimal Regret. - Yuanhao Wang 001; Jiachen Hu; Xiaoyu Chen 008; Liwei Wang 001 (CoRR, 2019)

Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP. - Yuanhao Wang 001; Kefan Dong; Xiaoyu Chen 008; Liwei Wang 001 (ICLR, 2020)

Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication. - Yuanhao Wang 001; Jiachen Hu; Xiaoyu Chen 008; Liwei Wang 001 (ICLR, 2020)

(Locally) Differentially Private Combinatorial Semi-Bandits. - Xiaoyu Chen 008; Kai Zheng 007; Zixin Zhou; Yunchang Yang; Wei Chen 034; Liwei Wang 001 (ICML, 2020)

Efficient Reinforcement Learning in Factored MDPs with Application to Constrained RL. - Xiaoyu Chen 008; Jiachen Hu; Lihong Li 001; Liwei Wang 001 (ICLR, 2021)

Near-Optimal Representation Learning for Linear Bandits and Linear RL. - Jiachen Hu; Xiaoyu Chen 008; Chi Jin 001; Lihong Li 001; Liwei Wang 001 (ICML, 2021)

Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver. - Xiaoyu Chen 008; Jiachen Hu; Lin Yang 011; Liwei Wang 001 (ICLR, 2022)

Understanding Domain Randomization for Sim-to-real Transfer. - Xiaoyu Chen 008; Jiachen Hu; Chi Jin 001; Lihong Li 001; Liwei Wang 001 (ICLR, 2022)

Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation. - Xiaoyu Chen 008; Han Zhong 001; Zhuoran Yang; Zhaoran Wang 001; Liwei Wang 001 (ICML, 2022)

On the Power of Pre-training for Generalization in RL: Provable Benefits and Hardness. - Haotian Ye; Xiaoyu Chen 008; Liwei Wang 001; Simon Shaolei Du (ICML, 2023)

The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability. - Jiachen Hu; Rui Ai 002; Han Zhong 001; Xiaoyu Chen 008; Liwei Wang 001; Zhaoran Wang 001; Zhuoran Yang (CoRR, 2025)