scientific article; zbMATH DE number 952465

MaRDI QIDQ4717464zbMATH OpenFDO

Authors Mariane Pelletier

Publication date 7 July 1997

zbMATH Keywords

almost sure central limit theoremasymptotically efficient algorithmsaveraging methodlaw of the iterated logarithm

Mathematics Subject Classification ID

Strong limit theorems (60F15)

Recommendations

• Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms
• Asymptotically efficient stochastic approximation
• An almost sure central limit theorem for stochastic approximation algorithms
• On the almost sure asymptotic behaviour of stochastic algorithm
• A generalization of the averaging procedure: the use of two-time-scale algorithms

Cited in

(11)

• On the almost sure asymptotic behaviour of stochastic algorithm
• An almost sure central limit theorem for stochastic approximation algorithms
• Efficiency of the stochastic approximation method
• Asymptotic Efficiency of Estimators: Algorithmic Approach
• scientific article; zbMATH DE number 4213221 (Why is no real title available?)
• scientific article; zbMATH DE number 3922395 (Why is no real title available?)
• Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms
• Sur quelques algorithmes récursifs pour les probabilités numériques
• Asymptotic Efficiency of Perturbation-Analysis-Based Stochastic Approximation with Averaging
• scientific article; zbMATH DE number 947091 (Why is no real title available?)
• Asymptotic optimality for consensus-type stochastic approximation algorithms using iterate averaging

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717464)