7 citations · 36 across the 21 of their papers we have counts for
7 papers · 1 filter
GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP, and Beyond
Han Zhong, Wei Xiong, Sirui Zheng +4
We study sample efficient reinforcement learning (RL) under the general framework of interactive decision making, which includes Markov decision process (MDP), partially observable…
A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games
Wei Xiong, Han Zhong, Chengshuai Shi +2
Existing studies on provably efficient algorithms for Markov games (MGs) almost exclusively build on the "optimism in the face of uncertainty" (OFU) principle. This work focuses on…
Provable Sim-to-real Transfer in Continuous Domain with Partial Observations
Jiachen Hu, Han Zhong, Chi Jin +1
Sim-to-real transfer trains RL agents in the simulated environments and then deploys them in the real world. Sim-to-real transfer has been widely used in practice because it is oft…
Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation
Xiaoyu Chen, Han Zhong, Zhuoran Yang +2
We study human-in-the-loop reinforcement learning (RL) with trajectory preferences, where instead of receiving a numeric reward at each step, the agent only receives preferences ov…
Nearly Minimax Optimal Offline Reinforcement Learning with Linear Function Approximation: Single-Agent MDP and Markov Game
Wei Xiong, Han Zhong, Chengshuai Shi +3
Offline reinforcement learning (RL) aims at learning an optimal strategy using a pre-collected dataset without further interactions with the environment. While various algorithms h…
Why Robust Generalization in Deep Learning is Difficult: Perspective of Expressive Power
Binghui Li, Jikai Jin, Han Zhong +2
It is well-known that modern neural networks are vulnerable to adversarial examples. To mitigate this problem, a series of robust learning algorithms have been proposed. However, a…
Pessimistic Minimax Value Iteration: Provably Efficient Equilibrium Learning from Offline Datasets
Han Zhong, Wei Xiong, Jiyuan Tan +4
We study episodic two-player zero-sum Markov games (MGs) in the offline setting, where the goal is to find an approximate Nash equilibrium (NE) policy pair based on a dataset colle…