Revisiting the ODE method for recursive algorithms: fast convergence using quasi stochastic approximation
type: Item
instance of: scholarly article
title: Revisiting the ODE method for recursive algorithms: fast convergence using quasi stochastic approximation
author: Shuhang Chen
author: Adithya Devraj
author: Andrey Berstein
author: Sean P. Meyn
published in: Journal of Systems Science and Complexity
publication date: 2022-01-21T00:00:00Z
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7461584
zbMATH Keywords: learning and adaptive systems in artificial intelligence
zbMATH Keywords: reinforcement learning
zbMATH Keywords: stochastic approximation
MaRDI profile type: Publication
full work available at URL: s11424-021-1251-5
OpenAlex ID: W3211240378
cites work: Identification and stochastic adaptive control
cites work: Convergence rate of least-squares identification and adaptive control for stochastic systems†
cites work: Estimating time-varying parameters by the Kalman filter based algorithm: stability and convergence
cites work: A new approach to stochastic adaptive control
cites work: Adaptive control for time-varying systems: A combination of Martingale and Markov chain techniques
cites work: How much uncertainty can be dealt with by feedback?
cites work: Stability of Recursive Stochastic Tracking Algorithms
cites work: Performance analysis of general tracking algorithms
cites work: A Stochastic Approximation Method
cites work: On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
cites work: Asynchronous stochastic approximation and Q-learning
cites work: Control Systems and Reinforcement Learning
cites work: Q4626283
cites work: Analysis of recursive stochastic algorithms
cites work: Adaption and learning in automatic systems. Translated by Z. J. Nikolic
cites work: Stochastic approximation. A dynamical systems viewpoint.
cites work: THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
cites work: A variational perspective on accelerated methods in optimization
cites work: Sequences with low discrepancy generalisation and application to bobbins-monbo algorithm
cites work: Stochastic approximation with averaging innovation applied to finance
cites work: The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
cites work: Stability of Stochastic Approximations With “Controlled Markov” Noise and Temporal Difference Learning
cites work: New method of stochastic approximation type
cites work: Acceleration of Stochastic Approximation by Averaging
cites work: Real‐Time Optimization by Extremum‐Seeking Control
cites work: Stochastic averaging and stochastic extremum seeking
cites work: Stochastic Estimation of the Maximum of a Regression Function
cites work: Random-seeking methods for the stochastic unconstrained optimization
cites work: A one-measurement form of simultaneous perturbation stochastic approximation
cites work: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
cites work: A Kiefer-Wolfowitz algorithm with randomized differences
cites work: Random gradient-free minimization of convex functions
cites work: Two-timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences
cites work: Estimation and control in Markov chains
cites work: Adaptive control of Markov chains, I: Finite parameter set
cites work: Identification and Adaptive Control of Markov Chains
cites work: Simple statistical gradient-following algorithms for connectionist reinforcement learning
cites work: Stochastic simulation: Algorithms and analysis
cites work: Théorèmes de convergence presque sure pour une classe d'algorithmes stochastiques à pas decroissant
cites work: Introduction to Stochastic Search and Optimization
DOI: 10.1007/S11424-021-1251-5
description: scientific article; zbMATH DE number 7461584