15 citations · 15 across the 1 of their papers we have counts for
1 paper
Cambridge Yang, Michael Littman, Michael Carbin
In reinforcement learning, the classic objectives of maximizing discounted and finite-horizon cumulative rewards are PAC-learnable: There are algorithms that learn a near-optimal p…