2 papers
cs.LG2023
Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs
Kaixuan Ji, Qingyue Zhao, Jiafan He +2
Recent studies have shown that episodic reinforcement learning (RL) is no harder than bandits when the total reward is bounded by , and proved regret bounds that have a polyloga…
cs.LG2023
On the Interplay Between Misspecification and Sub-optimality Gap in Linear Contextual Bandits
Weitong Zhang, Jiafan He, Zhiyuan Fan +1
We study linear contextual bandits in the misspecified setting, where the expected reward function can be approximated by a linear function class up to a bounded misspecification l…