Stochastic approximation algorithms: overview and recent trends.

DOI10.1007/BF02823149MaRDI QIDQ5955825zbMATH OpenOpenAlexFDO

Authors B. Bharath, Vivek Borkar

Publication date 18 February 2002

Published in Sādhanā (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02823149

Mathematics Subject Classification ID

Stochastic approximation (62L20)

Cites work

• scientific article; zbMATH DE number 5979097 (Why is no real title available?)
• scientific article; zbMATH DE number 3841285 (Why is no real title available?)
• scientific article; zbMATH DE number 3875113 (Why is no real title available?)
• scientific article; zbMATH DE number 3878095 (Why is no real title available?)
• scientific article; zbMATH DE number 3826915 (Why is no real title available?)
• scientific article; zbMATH DE number 3954793 (Why is no real title available?)
• scientific article; zbMATH DE number 43585 (Why is no real title available?)
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 47120 (Why is no real title available?)
• scientific article; zbMATH DE number 48727 (Why is no real title available?)
• scientific article; zbMATH DE number 50447 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 51537 (Why is no real title available?)
• scientific article; zbMATH DE number 51708 (Why is no real title available?)
• scientific article; zbMATH DE number 53271 (Why is no real title available?)
• scientific article; zbMATH DE number 3459735 (Why is no real title available?)
• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 1233801 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 976356 (Why is no real title available?)
• scientific article; zbMATH DE number 1043533 (Why is no real title available?)
• scientific article; zbMATH DE number 3992765 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• scientific article; zbMATH DE number 825585 (Why is no real title available?)
• scientific article; zbMATH DE number 926779 (Why is no real title available?)
• scientific article; zbMATH DE number 3206654 (Why is no real title available?)
• scientific article; zbMATH DE number 3298471 (Why is no real title available?)
• scientific article; zbMATH DE number 3326058 (Why is no real title available?)
• scientific article; zbMATH DE number 3069611 (Why is no real title available?)
• A Dynamical System Approach to Stochastic Approximations
• A Newton-Raphson version of the multivariate Robbins-Monro procedure
• A Stochastic Approximation Method
• A fundamental approach to the convergence analysis of least squares algorithms
• A generalized URN problem and its applications
• A learning algorithm for discrete-time stochastic control
• A stochastic method for global optimization
• A strong approximation theorem for stochastic recursive algorithms
• A tutorial survey of reinforcement learning
• A two Timescale Stochastic Approximation Scheme for Simulation-Based Parametric Optimization
• Acceleration of Stochastic Approximation by Averaging
• Actor-Critic--Type Learning Algorithms for Markov Decision Processes
• Adaption and learning in automatic systems. Translated by Z. J. Nikolic
• An alternative proof for convergence of stochastic approximation algorithms
• An analysis of temporal-difference learning with function approximation
• Analysis of recursive stochastic algorithms
• Annealing of Iterative Stochastic Schemes
• Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
• Asymptotically optimal rate of convergence of smoothed stochastic recursive algorithms
• Asynchronous Stochastic Approximations
• Asynchronous stochastic approximation and Q-learning
• Chaotic relaxation
• Continuous action set learning automata for stochastic optimization
• Convergence Rate of Stochastic Approximation Algorithms in the Degenerate Case
• Convergence of a class of random search algorithms
• Convergence of sa algorithms in multi-root or multi-extreme cases
• Convergence of solutions to equations arising in neural networks
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Distributed computation of fixed points of \(\infty\)-nonexpansive maps
• Do stochastic algorithms avoid traps?
• Equation of state calculations by fast computing machines
• Equivalent necessary and sufficient conditions on noise sequences for stochastic approximation algorithms
• Extensions of infinitesimal perturbation analysis
• Feature-based methods for large scale dynamic programming
• General results on the convergence of stochastic algorithms
• Gradient Convergence in Gradient methods with Errors
• Gradient approach for recursive estimation and control in finite Markov chains
• Identification and stochastic adaptive control
• Infinitesimal and finite perturbation analysis for queueing networks
• Large deviations analysis of some recursive algorithms with state dependent noise
• Learning Optimal Discriminant Functions through a Cooperative Game of Automata
• Learning automata algorithms for pattern classification.
• Learning dynamics in games with stochastic perturbations
• Learning mixed equilibria
• Learning through reinforcement and replicator dynamics
• Markov chains and stochastic stability
• Minimization by Random Search Techniques
• Multiscale Stochastic Approximation for Parametric Optimization of Hidden Markov Models
• Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
• New method of stochastic approximation type
• Nonconvergence to unstable points in urn models and stochastic approximations
• Nonparametric sequential estimation of zeros and extrema of regression functions
• On extensions of Polyak's averaging approach to stochastic approximation
• On optimal estimation methods using stochastic approximation procedures
• On positive real transfer functions and the convergence of some recursive schemes
• On the Convergence of Stochastic Iterative Dynamic Programming Algorithms
• On the almost sure asymptotic behaviour of stochastic algorithm
• Ordinal optimization of DEDS
• Passive stochastic approximation
• Passive stochastic approximation with constant step size and window width
• Probability metrics and recursive algorithms
• Pseudogradient adaptation and training algorithms
• Random optimization
• Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $
• Recursive algorithms, urn processes and chaining number of chain recurrent sets
• Recursive self-tuning control of finite Markov chains
• Simulation-based optimization of Markov reward processes
• Smoothed (conditional) perturbation analysis of discrete event dynamical systems
• Smoothing Derivatives of Functions and Applications
• Some Pathological Traps for Stochastic Approximation
• Some results characterizing the finite time behaviour of the simulated annealing algorithm.
• Stochastic Approximation and Large Deviations: Upper Bounds and <scp>w.p.1</scp> Convergence
• Stochastic Approximations via Large Deviations: Asymptotic Properties
• Stochastic Estimation of the Maximum of a Regression Function
• Stochastic Minimization with Constant Step-Size: Asymptotic Laws
• Stochastic approximation algorithms for parallel and distributed processing
• Stochastic approximation method with gradient averaging for unconstrained problems
• Stochastic approximation methods for constrained and unconstrained systems
• Stochastic approximation with averaging and feedback: rapidly convergent "on-line" algorithms
• Stochastic approximation with random truncations, state-dependent noise and discontinuous dynamics
• Stochastic approximation with two time scales
• Stochastic differential equations: singularity of coefficients, regression models, and stochastic approximation
• Stochastic optimization of regenerative systems using infinitesimal perturbation analysis
• Strong convergence of a stochastic approximation algorithm
• Structure theorems for partially asynchronous iterations of a nonnegative matrix with random delays.
• The dynamic system method and the traps
• Transformation of observations in stochastic approximation
• Two Timescale Analysis of the Alopex Algorithm for Optimization
• Weak convergence of recursions
• Weighted Means in Stochastic Approximation of Minima
• \({\mathcal Q}\)-learning

Cited in

(5)

• Stochastic approximation with nondecaying gain: Error bound and data‐driven gain‐tuning
• Annealing stochastic approximation Monte Carlo algorithm for neural network training
• Two Timescale Analysis of the Alopex Algorithm for Optimization
• Learning automata algorithms for pattern classification.
• Recurrent algorithms of structural classification analysis for complex organized information

This page was built for publication: Stochastic approximation algorithms: overview and recent trends.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955825)