University of California, Los Angeles; Amii, University of Alberta, DeepMind; Simon Fraser University
XXX
Constrained Markov Decision Processes;Sample complexity;Generative model;Model-based RL;Primal-dual algorithm
Near-Optimal Sample Complexity Bounds for Constrained MDPs