A Concentration Bound for Distributed Stochastic Approximation

10/09/2022
by   Harsh Dolhare, et al.
0

We revisit the classical model of Tsitsiklis, Bertsekas and Athans for distributed stochastic approximation with consensus. The main result is an analysis of this scheme using the ODE approach to stochastic approximation, leading to a high probability bound for the tracking error between suitably interpolated iterates and the limiting differential equation. Several future directions will also be highlighted.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2021

A Concentration Bound for LSPE(λ)

The popular LSPE(λ) algorithm for policy evaluation is revisited to deri...
research
11/11/2021

On the Problem of Reformulating Systems with Uncertain Dynamics as a Stochastic Differential Equation

We identify an issue in recent approaches to learning-based control that...
research
08/06/2018

About the Stein equation for the generalized inverse Gaussian and Kummer distributions

We propose a Stein characterization of the Kummer distribution on (0, ∞)...
research
08/12/2019

Stochastic differential theory of cricket

A new formalism for analyzing the progression of cricket game using Stoc...
research
06/27/2021

Concentration of Contractive Stochastic Approximation and Reinforcement Learning

Using a martingale concentration inequality, concentration bounds `from ...
research
09/30/2012

On The Convergence of a Nash Seeking Algorithm with Stochastic State Dependent Payoff

Distributed strategic learning has been getting attention in recent year...

Please sign up or login with your details

Forgot password? Click here to reset