IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v78y1998i2p217-244.html
   My bibliography  Save this article

On the almost sure asymptotic behaviour of stochastic algorithms

Author

Listed:
  • Pelletier, Mariane

Abstract

We study the almost sure asymptotic behaviour of decreasing stepsized stochastic algorithms used for the search of zeros of a function. We prove a law of the iterated logarithm, which gives the almost sure convergence rate of the algorithm, and we establish a quadratic strong law of large numbers.

Suggested Citation

  • Pelletier, Mariane, 1998. "On the almost sure asymptotic behaviour of stochastic algorithms," Stochastic Processes and their Applications, Elsevier, vol. 78(2), pages 217-244, November.
    • Handle: RePEc:eee:spapps:v:78:y:1998:i:2:p:217-244
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(98)00029-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alain Breton & Alexander Novikov, 1995. "Some results about averaging in stochastic approximation," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 42(1), pages 153-171, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Costa, Manon & Gadat, Sébastien & Bercu, Bernard, 2020. "Stochastic approximation algorithms for superquantiles estimation," TSE Working Papers 20-1142, Toulouse School of Economics (TSE).
    2. Pelletier, Mariane, 1999. "An Almost Sure Central Limit Theorem for Stochastic Approximation Algorithms," Journal of Multivariate Analysis, Elsevier, vol. 71(1), pages 76-93, October.
    3. Yves F. Atchadé, 2006. "An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift," Methodology and Computing in Applied Probability, Springer, vol. 8(2), pages 235-254, June.
    4. Koval, Valery & Schwabe, Rainer, 2003. "A law of the iterated logarithm for stochastic approximation procedures in d-dimensional Euclidean space," Stochastic Processes and their Applications, Elsevier, vol. 105(2), pages 299-313, June.
    5. Claire Boyer & Antoine Godichon-Baggioni, 2023. "On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions," Computational Optimization and Applications, Springer, vol. 84(3), pages 921-972, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. S. Pergamenshchikov, 1998. "Asymptotic Expansions for the Stochastic Approximation Averaging Procedure in Continuous Time," Statistical Inference for Stochastic Processes, Springer, vol. 1(2), pages 197-223, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:78:y:1998:i:2:p:217-244. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.