Achieving Õ(1/ε) Sample Complexity for Constrained Markov Decision Process.
Jiashuo JiangYinyu YePublished in: CoRR (2024)
Keyphrases
- sample complexity
- markov decision process
- theoretical analysis
- state space
- learning problems
- reinforcement learning
- markov decision processes
- upper bound
- active learning
- pac learning
- optimal policy
- learning algorithm
- generalization error
- special case
- supervised learning
- lower bound
- infinite horizon
- initial state
- transition probabilities
- training examples
- sample size
- data sets
- machine learning algorithms
- dynamic programming
- optimal control
- finite state
- worst case
- probability distribution
- reward function
- pairwise
- search algorithm
- support vector
- irrelevant features