Stochastic approximation. A dynamical systems viewpoint.

DOI10.1007/978-93-86279-38-5zbMath1159.60002MaRDI QIDQ1013655

Vivek S. Borkar

Publication date: 20 April 2009

Published in: Texts and Readings in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-93-86279-38-5

Mathematics Subject Classification ID

37-02: Research exposition (monographs, survey articles) pertaining to dynamical systems and ergodic theory

60-02: Research exposition (monographs, survey articles) pertaining to probability theory

Related Items

Finite-Time Analysis and Restarting Scheme for Linear Two-Time-Scale Stochastic Approximation, Unnamed Item, A Stochastic Approximation Method for Simulation-Based Quantile Optimization, Risk-Sensitive Reinforcement Learning via Policy Gradient Search, A Concentration Bound for Stochastic Approximation via Alekseev’s Formula, Global Convergence of Policy Gradient Methods to (Almost) Locally Optimal Policies, Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis, Improving control performance across AWGN channels using a relay node^†, Robust scheduling for flexible processing networks, Actor-Critic Algorithms with Online Feature Adaptation, Smoothed Functional Algorithms for Stochastic Optimization Using q -Gaussian Distributions, Asynchronous stochastic approximation with differential inclusions, Multi-agent consensus under a communication–broadcast mixed environment, Distributed Stochastic Optimization with Large Delays, Analyzing Approximate Value Iteration Algorithms, Sparse optimal control problems with intermediate constraints: Necessary conditions, Diffusion of binary opinions in a growing population with heterogeneous behaviour and external influence, Continuous monitoring for changepoints in data streams using adaptive estimation, Distributed dynamic reinforcement of efficient outcomes in multiagent coordination and network formation, Local voting protocol for decentralized load balancing of network with switched topology and noise in measurements, Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions, Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization, Distributed resource allocation over random networks based on stochastic approximation, Variance-constrained actor-critic algorithms for discounted and average reward MDPs, Stochastic heavy ball, Asymptotic bias of stochastic gradient search, Concentration bounds for temporal difference learning with linear function approximation: the case of batch data and uniform sampling, Revisiting the ODE method for recursive algorithms: fast convergence using quasi stochastic approximation, An ODE method to prove the geometric convergence of adaptive stochastic algorithms, Fundamental design principles for reinforcement learning algorithms, Multi-agent reinforcement learning: a selective overview of theories and algorithms, Stochastic approximation method using diagonal positive-definite matrices for convex optimization with fixed point constraints, Stochastic approximation with random step sizes and urn models with random replacement matrices having finite mean, Approximate consensus in the dynamic stochastic network with incomplete information and measurement delays, Multi-armed bandits based on a variant of simulated annealing, Event-driven stochastic approximation, Langevin type limiting processes for adaptive MCMC, Central limit theorems for stochastic approximation with controlled Markov chain dynamics, Simultaneous Perturbation Stochastic Approximation with Norm-Limited Update Vector, Approximate policy iteration: a survey and some new methods, Opportunistic Transmission over Randomly Varying Channels