A Provably Efficient Algorithm for Linear Markov Decision Process with
Low Switching Cost

A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost

2 January 2021

Papers citing "A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost"

10 / 10 papers shown

Title
To Switch or Not to Switch? Balanced Policy Switching in Offline Reinforcement Learning Tao Ma Xuzhi Yang Zoltan Szabo OffRL 58 0 0 01 Jul 2024
Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data Ruiqi Zhang Andrea Zanette OffRL OnRL 35 5 0 10 Jul 2023
Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time Xiang Ji Gen Li OffRL 14 7 0 24 May 2023
A Reduction-based Framework for Sequential Decision Making with Delayed Feedback Yunchang Yang Hangshi Zhong Tianhao Wu B. Liu Liwei Wang S. Du OffRL 25 8 0 03 Feb 2023
Offline Reinforcement Learning with Differential Privacy Dan Qiao Yu-Xiang Wang OffRL 27 23 0 02 Jun 2022
Byzantine-Robust Online and Offline Distributed Reinforcement Learning Yiding Chen Xuezhou Zhang K. Zhang Mengdi Wang Xiaojin Zhu OffRL 13 16 0 01 Jun 2022
Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism Ming Yin Yaqi Duan Mengdi Wang Yu-Xiang Wang OffRL 30 65 0 11 Mar 2022
Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets Yifei Min Tianhao Wang Ruitu Xu Zhaoran Wang Michael I. Jordan Zhuoran Yang 23 21 0 07 Mar 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost Dan Qiao Ming Yin Ming Min Yu-Xiang Wang 24 28 0 13 Feb 2022
Optimism in Reinforcement Learning with Generalized Linear Function Approximation Yining Wang Ruosong Wang S. Du A. Krishnamurthy 127 135 0 09 Dec 2019