Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2003.06898
Cited By
v1
v2
v3
v4 (latest)
Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning
15 March 2020
Fei Feng
Ruosong Wang
W. Yin
S. Du
Lin F. Yang
OffRL
SSL
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning"
5 / 5 papers shown
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP
Neural Information Processing Systems (NeurIPS), 2021
Zihan Zhang
Jiaqi Yang
Xiangyang Ji
S. Du
458
49
0
29 Jan 2021
A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost
Minbo Gao
Tianle Xie
S. Du
Lin F. Yang
242
51
0
02 Jan 2021
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective
Dylan J. Foster
Alexander Rakhlin
D. Simchi-Levi
Yunzong Xu
364
88
0
07 Oct 2020
FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs
Alekh Agarwal
Sham Kakade
A. Krishnamurthy
Wen Sun
OffRL
545
255
0
18 Jun 2020
Is Long Horizon Reinforcement Learning More Difficult Than Short Horizon Reinforcement Learning?
Ruosong Wang
S. Du
Lin F. Yang
Sham Kakade
OffRL
421
53
0
01 May 2020
1
Page 1 of 1
