-
Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms
Finding the minimal structural assumptions that empower sample-efficient...
02/01/2021 ∙ by Chi Jin, et al. ∙
0
∙
share
read it
-
Constrained episodic reinforcement learning in concave-convex and knapsack settings
We propose an algorithm for tabular episodic reinforcement learning with...
06/09/2020 ∙ by Kianté Brantley, et al. ∙
8
∙
share
read it
-
Reinforcement Learning with Convex Constraints
In standard reinforcement learning (RL), a learning agent seeks to optim...
06/21/2019 ∙ by Sobhan Miryoosefi, et al. ∙
14
∙
share
read it
