Reinforcement learning in finite MDPs: PAC analysis
From MaRDI portal
Recommendations
- PAC Reinforcement Learning Algorithm for General-Sum Markov Games
- PAC Bounds for Discounted MDPs
- Near-optimal PAC bounds for discounted MDPs
- From perturbation analysis to Markov decision processes and reinforcement learning
- Reinforcement learning with approximation spaces
- Finite-sample analysis of least-squares policy iteration
- Learning algorithms for finite horizon constrained Markov decision processes
Cited in
(36)- Reinforcement learning with immediate rewards and linear hypotheses
- An information-theoretic analysis of return maximization in reinforcement learning
- Efficient PAC learning for episodic tasks with acyclic state spaces
- Provably efficient learning with typed parametric models
- 10.1162/153244303765208377
- 10.1162/153244303768966148
- scientific article; zbMATH DE number 2089367 (Why is no real title available?)
- scientific article; zbMATH DE number 1804129 (Why is no real title available?)
- PAC Bounds for Discounted MDPs
- Extreme state aggregation beyond Markov decision processes
- Solving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning Methods
- Reinforcement learning: a comparison of UCB versus alternative adaptive policies
- Learning to play using low-complexity rule-based policies: illustrations through Ms. Pac-Man
- Hybrid answer set programming
- Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
- Knows what it knows: a framework for self-aware learning
- Near-optimal PAC bounds for discounted MDPs
- scientific article; zbMATH DE number 2159039 (Why is no real title available?)
- scientific article; zbMATH DE number 1453042 (Why is no real title available?)
- Learning and planning for time-varying MDPs using maximum likelihood estimation
- scientific article; zbMATH DE number 7626790 (Why is no real title available?)
- scientific article; zbMATH DE number 7307478 (Why is no real title available?)
- Unsupervised basis function adaptation for reinforcement learning
- Speedy categorical distributional reinforcement learning and complexity analysis
- A Small Gain Analysis of Single Timescale Actor Critic
- Identity concealment games: how I learned to stop revealing and love the coincidences
- Recent advances in reinforcement learning in finance
- Reducing reinforcement learning to KWIK online regression
- Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
- Controlling estimation error in reinforcement learning via reinforced operation
- Online reinforcement learning control by Bayesian inference
- Learning algorithms for verification of Markov decision processes
- Episodic reinforcement learning in finite MDPs: minimax lower bounds revisited
- Client selection for federated policy optimization with environment heterogeneity
- Model-free reinforcement learning for branching Markov decision processes
- An analysis of model-based interval estimation for Markov decision processes
This page was built for publication: Reinforcement learning in finite MDPs: PAC analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880979)
