2019
DOI: 10.1287/stsy.2018.0019
|View full text |Cite
|
Sign up to set email alerts
|

A Concentration Bound for Stochastic Approximation via Alekseev’s Formula

Abstract: Given an ODE and its perturbation, the Alekseev formula expresses the solutions of the latter in terms related to the former. By exploiting this formula and a new concentration inequality for martingale-differences, we develop a novel approach for analyzing nonlinear Stochastic Approximation (SA). This approach is useful for studying a SA's behaviour close to a Locally Asymptotically Stable Equilibrium (LASE) of its limiting ODE; this LASE need not be the limiting ODE's only attractor. As an application, we ob… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
43
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 37 publications
(44 citation statements)
references
References 26 publications
0
43
0
1
Order By: Relevance
“…with Φ y (s, s, y 0 ) = I,D being the Jacobian matrix of g(λ(·), ·). As shown in Lemma 5.3, [15], there exists K, κ y > 0 so that the following holds for t ≥ s:…”
Section: A Deviation Bound For {Xmentioning
confidence: 98%
See 4 more Smart Citations
“…with Φ y (s, s, y 0 ) = I,D being the Jacobian matrix of g(λ(·), ·). As shown in Lemma 5.3, [15], there exists K, κ y > 0 so that the following holds for t ≥ s:…”
Section: A Deviation Bound For {Xmentioning
confidence: 98%
“…Here y(t) ≡ y, x(t) ≡ λ(y) is a constant trajectory and Φ x (·) satisfies the linear system: (12) with initial condition Φ x (t, s, x 0 , y 0 ) = I, where D is the Jacobian matrix of h(·, y). As shown in Lemma 5.3, [15], there exist K, κ x > 0 so that the following holds for t ≥ s and x 0 ∈ V r :…”
Section: A Deviation Bound For {Xmentioning
confidence: 99%
See 3 more Smart Citations