On the almost sure asymptotic behaviour of stochastic algorithm

From MaRDI portal
Publication:1807280

DOI10.1016/S0304-4149(98)00029-5zbMath0926.62072MaRDI QIDQ1807280

Mariane Pelletier

Publication date: 18 November 1999

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)




Related Items (20)

Lp and almost sure rates of convergence of averaged stochastic gradient algorithms: locally strongly convex objectiveConvergence rate and averaging of nonlinear two-time-scale stochastic approximation algo\-rithmsRecursive estimation in a class of models of deformationOn the rates of convergence of parallelized averaged stochastic gradient algorithmsConvergence in quadratic mean of averaged stochastic gradient algorithms without strong convexity nor bounded gradientAn adaptive version for the Metropolis adjusted Langevin algorithm with a truncated driftOn the asymptotic rate of convergence of stochastic Newton algorithms and their weighted averaged versionsThéorèmes limites avec poids pour les martingales vectoriellesA Robbins-Monro procedure for estimation in semiparametric regression modelsA companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithmGeneral multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert typeOptimization based on a team of automata with binary outputsThe Compact Law of the Iterated Logarithm for Multivariate Stochastic Approximation AlgorithmsStochastic approximation algorithms: overview and recent trends.Estimation of the shift parameter in regression models with unknown distribution of the observationsAsymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measuresStochastic approximation algorithms for superquantiles estimationAn almost sure central limit theorem for stochastic approximation algorithmsOnline estimation of the asymptotic variance for averaged stochastic gradient algorithmsA law of the iterated logarithm for stochastic approximation procedures in \(d\)-dimensional Euclidean space.



Cites Work


This page was built for publication: On the almost sure asymptotic behaviour of stochastic algorithm