Stochastic approximation and reinforcement learning: the interface and a little beyond
From MaRDI portal
Cites work
- \({\mathcal Q}\)-learning
- A concentration bound for stochastic approximation via Alekseev's formula
- A Dynamical System Approach to Stochastic Approximations
- A finite time analysis of temporal difference learning with linear function approximation
- A generalized URN problem and its applications
- A learning algorithm for risk-sensitive cost
- A measure of the tracking capability of recursive stochastic algorithms with constant gains
- A new learning algorithm for optimal stopping
- A New Value Iteration method for the Average Cost Dynamic Programming Problem
- A policy gradient algorithm for the risk-sensitive exponential cost MDP
- A sensitivity formula for risk-sensitive cost and the actor-critic algorithm
- A Stochastic Approximation Method
- Actor-critic algorithms with online feature adaptation
- Actor-Critic--Type Learning Algorithms for Markov Decision Processes
- An actor-critic algorithm for constrained Markov decision processes
- An almost sure central limit theorem for stochastic approximation algorithms
- An analysis of temporal-difference learning with function approximation
- An online actor-critic algorithm with function approximation for constrained Markov decision processes
- Analysis of recursive stochastic algorithms
- Asymptotic Distribution of Stochastic Approximation Procedures
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
- Asynchronous stochastic approximation and Q-learning
- Asynchronous Stochastic Approximations
- Average cost temporal-difference learning
- Avoidance of traps in stochastic approximation
- Concentration bounds for stochastic approximations
- Concentration of Contractive Stochastic Approximation and Reinforcement Learning
- Concentration of contractive stochastic approximation: additive and multiplicative noise
- Control systems and reinforcement learning
- Convergence of stochastic approximation via martingale and converse Lyapunov methods
- Convergence rates for stochastic approximation: biased noise with unbounded variance, and applications
- Convergence Results for Some Temporal Difference Methods Based on Least Squares
- Do stochastic algorithms avoid traps?
- Full gradient DQN reinforcement learning: a provably convergent scheme
- Global optimality guarantees for policy gradient methods
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- scientific article; zbMATH DE number 41285 (Why is no real title available?)
- scientific article; zbMATH DE number 48727 (Why is no real title available?)
- scientific article; zbMATH DE number 3638998 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 976356 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 1405930 (Why is no real title available?)
- scientific article; zbMATH DE number 3109895 (Why is no real title available?)
- Large deviations analysis of some recursive algorithms with state dependent noise
- Law of the Iterated Logarithm for a Constant-Gain Linear Stochastic Gradient Algorithm
- Learning algorithms for Markov decision processes with average cost
- Learning Automata - A Survey
- Least squares policy evaluation algorithms with linear function approximation
- Linear programming and sequential decisions
- Monotonic value function factorisation for deep multi-agent reinforcement learning
- Natural actor-critic algorithms
- Nonconvergence to unstable points in urn models and stochastic approximations
- Nonlinear Perron-Frobenius theory
- NP-hardness of checking the unichain condition in average cost MDPs
- On a Stochastic Approximation Method
- On Asymptotic Normality in Stochastic Approximation
- On the almost sure asymptotic behaviour of stochastic algorithm
- On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
- On the convergence, lock-in probability, and sample complexity of stochastic approximation
- On the Lock-in Probability of Stochastic Approximation
- On the theory of policy gradient methods: optimality, approximation, and distribution shift
- OnActor-Critic Algorithms
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Online Reinforcement Learning of Optimal Threshold Policies for Markov Decision Processes
- Q-Learning for Risk-Sensitive Control
- Reinforcement learning for long-run average cost.
- Reinforcement learning. An introduction
- Reinforcement learning: a tutorial survey and recent advances
- Remarks on Differential Inclusion limits of Stochastic Approximation
- Risk-Sensitive Optimal Control for Markov Decision Processes with Monotone Cost
- Risk-Sensitive Reinforcement Learning via Policy Gradient Search
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- Simplified description of slow Markov walks. I
- Some Pathological Traps for Stochastic Approximation
- Stability of Stochastic Approximation under Verifiable Conditions
- Stability of Stochastic Approximations With “Controlled Markov” Noise and Temporal Difference Learning
- Stabilization of stochastic approximation by step size adaptation
- Stochastic approximation
- Stochastic approximation and its applications
- Stochastic Approximation and Large Deviations: Upper Bounds and <scp>w.p.1</scp> Convergence
- Stochastic Approximation for Nonexpansive Maps: Application to Q-Learning Algorithms
- Stochastic approximation methods for constrained and unconstrained systems
- Stochastic approximation with `controlled Markov' noise
- Stochastic approximation with discontinuous dynamics, differential inclusions, and applications
- Stochastic approximation with long range dependent and heavy tailed noise
- Stochastic approximation with two time scales
- Stochastic approximation. A dynamical systems viewpoint
- Stochastic approximation: from statistical origin to big-data, multidisciplinary applications
- Stochastic Approximations and Differential Inclusions
- Stochastic Approximations and Differential Inclusions, Part II: Applications
- Stochastic learning and optimization. A sensitivity-based approach.
- Strong diffusion approximations for recursive stochastic algorithms
- The actor-critic algorithm as multi-time-scale stochastic approximation.
- The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
- The projected Bellman equation in reinforcement learning
- Transport-entropy inequalities and deviation estimates for stochastic approximation schemes
- Two models for analyzing the dynamics of adaptation algorithms
- Two Time-Scale Stochastic Approximation with Controlled Markov Noise and Off-Policy Temporal-Difference Learning
- Weak convergence and local stability properties of fixed step size recursive algorithms
- Whittle index based Q-learning for restless bandits with average reward
This page was built for publication: Stochastic approximation and reinforcement learning: the interface and a little beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860952)
