Pages that link to "Item:Q465258"
From MaRDI portal
The following pages link to Near-optimal PAC bounds for discounted MDPs (Q465258):
Displaying 8 items.
- Extreme state aggregation beyond Markov decision processes (Q329613) (← links)
- Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890) (← links)
- Near-optimal reinforcement learning in polynomial time (Q1604817) (← 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)
- PAC Bounds for Discounted MDPs (Q3164829) (← links)
- Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis (Q5162625) (← links)
