Sample complexity of variance-reduced distributionally robust Q-learning
From MaRDI portal
Cites work
- \({\mathcal Q}\)-learning
- An introduction to deep reinforcement learning
- Continuous-time Markov chains and applications. A two-time-scale approach
- Distributionally robust modeling of optimal control
- Finite-sample analysis of nonlinear stochastic approximation with applications in reinforcement learning
- Finite-time error bounds of biased stochastic approximation with application to TD-learning
- Learning models with uniform performance via distributionally robust optimization
- Lectures on stochastic programming. Modeling and theory.
- Minimax Control of Discrete-Time Stochastic Systems
- Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
- Reinforcement learning. An introduction
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Robust Dynamic Programming
- Robust Markov Decision Processes
This page was built for publication: Sample complexity of variance-reduced distributionally robust Q-learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7029040)
