The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Stability of Stochastic Approximation under Verifiable Conditions
Abstract
In this paper we address the problem of the stability and convergence of the stochastic approximation procedure \[ \theta_{n+1} = \theta_n + \gamma_{n+1} [h(\theta_n)+\xi_{n+1}]. \] The stability of such sequences $\{\theta_n\}$ is known to heavily rely on the behavior of the mean field h at the boundary of the parameter set and the magnitude of the stepsizes used. The conditions typically required to ensure convergence, and in particular the boundedness or stability of $\{ \theta_n \}$, are either too difficult to check in practice or not satisfied at all. This is the case even for very simple models. The most popular technique for circumventing the stability problem consists of constraining $\{ \theta_n \}$ to a compact subset ${\mathcal{K}}$ in the parameter space. This is obviously not a satisfactory solution, as the choice of ${\mathcal{K}}$ is a delicate one. In this paper we first prove a ``deterministic' stability result, which relies on simple conditions on the sequences $\{ \xi_n \}$ and $ \{ \gamma_n \}$. We then propose and analyze an algorithm based on projections on adaptive truncation sets, which ensures that the aforementioned conditions required for stability are satisfied. We focus in particular on the case where $\{ \xi_n \}$ is a so-called Markov state-dependent noise. We establish both the stability and convergence with probability 1 (w.p. 1) of the algorithm under a set of simple and verifiable assumptions. We illustrate our results with an example related to adaptive Markov chain Monte Carlo algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Cited by
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Self-citationOn-Line Expectation–Maximization Algorithm for latent Data Models
Cappé, O., & Moulines, E. (2009) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2009.00698.x · Cited by 477
On adaptive Markov chain Monte Carlo algorithms
Atchadé, Y. F., & Rosenthal, J. S. (2005) · Bernoulli · doi:10.3150/bj/1130077595 · Cited by 353
Value iteration and adaptive dynamic programming for data-driven adaptive optimal control design
Bian, T., & Jiang, Z.-P. (2016) · Automatica · doi:10.1016/j.automatica.2016.05.003 · Cited by 348
On the ergodicity properties of some adaptive MCMC algorithms
Andrieu, C., & Moulines, É. (2006) · The Annals of Applied Probability · doi:10.1214/105051606000000286 · Cited by 277
Self-citation
Metadata
- Authors
- Andrieu, C., Moulines, É., & Priouret, P.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 2005-01
- Volume
- 44
- Issue
- 1
- Pages
- 283-312
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2133555934
- Cited by
- 194
- References
- 1
- FWCI
- 6.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Stability of Stochastic Approximation under Verifiable Conditions. https://app.cochat.ai/papers/10.1137/s0363012902417267
- The paper
- Andrieu, C., Moulines, É., & Priouret, P. (2005). Stability of Stochastic Approximation under Verifiable Conditions. SIAM Journal on Control and Optimization. https://doi.org/10.1137/s0363012902417267
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.