The following pages link to PAC Bounds for Discounted MDPs (Q3164829):
Displaying 9 items.
- Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890) (← links)
- Near-optimal PAC bounds for discounted MDPs (Q465258) (← links)
- Efficient PAC learning for episodic tasks with acyclic state spaces (Q2465672) (← links)
- Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
- Reinforcement learning in finite MDPs: PAC analysis (Q2880979) (← links)
- Near-optimal regret bounds for reinforcement learning (Q2896090) (← links)
- Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
- Recent advances in reinforcement learning in finance (Q6146668) (← links)
- Achieving zero constraint violation for concave utility constrained reinforcement learning via primal-dual approach (Q6535433) (← links)
