An almost sure central limit theorem for stochastic approximation algorithms
type: Item
instance of: scholarly article
title: An almost sure central limit theorem for stochastic approximation algorithms
zbMATH Open document ID: 0951.62071
author: Mariane Pelletier
published in: Journal of Multivariate Analysis
publication date: 1999-11-25T00:00:00Z
Mathematics Subject Classification ID: 62L20
Mathematics Subject Classification ID: 60F05
Mathematics Subject Classification ID: 60F15
zbMATH DE Number: 1369820
zbMATH Keywords: almost sure invariance principles
zbMATH Keywords: Lyapunov equation
zbMATH Keywords: almost sure central limit theorem
MaRDI profile type: Publication
full work available at URL: jmva.1999.1830
OpenAlex ID: W2076563962
cites work: Q3997575
cites work: An almost everywhere central limit theorem
cites work: Q4896490
cites work: Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
cites work: Q3711438
cites work: Stochastic algorithms
cites work: Stochastic Approximation and Large Deviations: Upper Bounds and <scp>w.p.1</scp> Convergence
cites work: Q5538132
cites work: Q3896848
cites work: A note on the almost sure central limit theorem
cites work: Q3665988
cites work: Q4003497
cites work: Q4127226
cites work: Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
cites work: On the almost sure asymptotic behaviour of stochastic algorithm
cites work: An almost sure central limit theorem for independent random variables
cites work: On Strong Versions of the Central Limit Theorem
cites work: Asymptotic normality for a vector stochastic difference equation with applications in stochastic approximation
DOI: 10.1006/JMVA.1999.1830
description: scientific article; zbMATH DE number 1369820