Follow
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes. (arXiv:2201.11206v1 [cs.LG]) http://arxiv.org/abs/2201.11206
Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes. (arXiv:2201.11206v1 [cs.LG]) http://arxiv.org/abs/2201.11206