Fundamental design principles for reinforcement learning algorithms
type: Item
instance of: scholarly article
title: Fundamental design principles for reinforcement learning algorithms
DOI: 10.1007/978-3-030-60990-0_4
author: Adithya Devraj
author: Ana Bušić
author: Sean P. Meyn
publication date: 2022-10-28T00:00:00Z
Mathematics Subject Classification ID: 68Txx
zbMATH DE Number: 7608704
describes a project that uses: SBEED
MaRDI profile type: Publication
full work available at URL: 978-3-030-60990-0 4
OpenAlex ID: W3175771377
cites work: Learning algorithms for Markov decision processes with average cost
cites work: Q3997575
cites work: Dynamic programming and optimal control. Vol. 2
cites work: A Finite Time Analysis of Temporal Difference Learning with Linear Function Approximation
cites work: Multidimensional Stochastic Approximation Methods
cites work: Oja's algorithm for graph clustering, Markov spectral decomposition, and risk sensitive control
cites work: Stochastic approximation. A dynamical systems viewpoint.
cites work: The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
cites work: A generalized Kalman filter for fixed point approximation and efficient temporal-difference learning
cites work: On a Stochastic Approximation Method
cites work: Q4391441
cites work: Large deviation asymptotics for busy periods
cites work: Q3093180
cites work: Hoeffding's inequality for uniformly ergodic Markov chains
cites work: Stochastic Estimation of the Maximum of a Regression Function
cites work: OnActor-Critic Algorithms
cites work: Convergence rate of linear two-time-scale stochastic approximation.
cites work: Spectral theory and limit theorems for geometrically ergodic Markov processes
cites work: Q4346705
cites work: Bandit Algorithms
cites work: Computable exponential convergence rates for stochastically ordered Markov processes
cites work: Stochastic approximations for finite-state Markov chains
cites work: Applications of a Kushner and Clark lemma to general classes of stochastic algorithms
cites work: Large deviation asymptotics and control variates for simulating large functions
cites work: Control Techniques for Complex Networks
cites work: Computable bounds for geometric convergence rates of Markov chains
cites work: Markov Chains and Stochastic Stability
cites work: Q5214215
cites work: Concentration inequalities for Markov chains by Marton couplings and spectral methods
cites work: New method of stochastic approximation type
cites work: Acceleration of Stochastic Approximation by Averaging
cites work: A Stochastic Approximation Method
cites work: A Newton-Raphson version of the multivariate Robbins-Monro procedure
cites work: A Tutorial on Thompson Sampling
cites work: Q4626283
cites work: Algorithms for Reinforcement Learning
cites work: A Concentration Bound for Stochastic Approximation via Alekseev’s Formula
cites work: Asynchronous stochastic approximation and Q-learning
cites work: Average cost temporal-difference learning
cites work: An analysis of temporal-difference learning with function approximation
cites work: Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives
cites work: An Extension of the Robbins-Monro Procedure
cites work: \({\mathcal Q}\)-learning
cites work: Q-learning and policy iteration algorithms for stochastic shortest path problems
description: scientific article; zbMATH DE number 7608704