On the almost sure asymptotic behaviour of stochastic algorithm
From MaRDI portal
Publication:1807280
DOI10.1016/S0304-4149(98)00029-5zbMath0926.62072MaRDI QIDQ1807280
Publication date: 18 November 1999
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Stochastic approximation (62L20)
Related Items (20)
Lp and almost sure rates of convergence of averaged stochastic gradient algorithms: locally strongly convex objective ⋮ Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algo\-rithms ⋮ Recursive estimation in a class of models of deformation ⋮ On the rates of convergence of parallelized averaged stochastic gradient algorithms ⋮ Convergence in quadratic mean of averaged stochastic gradient algorithms without strong convexity nor bounded gradient ⋮ An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift ⋮ On the asymptotic rate of convergence of stochastic Newton algorithms and their weighted averaged versions ⋮ Théorèmes limites avec poids pour les martingales vectorielles ⋮ A Robbins-Monro procedure for estimation in semiparametric regression models ⋮ A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithm ⋮ General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type ⋮ Optimization based on a team of automata with binary outputs ⋮ The Compact Law of the Iterated Logarithm for Multivariate Stochastic Approximation Algorithms ⋮ Stochastic approximation algorithms: overview and recent trends. ⋮ Estimation of the shift parameter in regression models with unknown distribution of the observations ⋮ Asymptotic distribution and convergence rates of stochastic algorithms for entropic optimal transportation between probability measures ⋮ Stochastic approximation algorithms for superquantiles estimation ⋮ An almost sure central limit theorem for stochastic approximation algorithms ⋮ Online estimation of the asymptotic variance for averaged stochastic gradient algorithms ⋮ A law of the iterated logarithm for stochastic approximation procedures in \(d\)-dimensional Euclidean space.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur la loi des grands nombres pour les martingales vectorielles et l'estimateur des moindres carrés d'un modèle de régression. (On the law of large numbers for vectorial martingales and least square estimators of a regression model)
- Asymptotic behaviour of a class of stochastic approximation procedures
- Asymptotic properties of least-squares estimates in stochastic regression models
- Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
- Adaptive prediction by least squares predictors in stochastic regression models with applications to time series
- Almost sure approximations to the Robbins-Monro and Kiefer-Wolfowitz processes with dependent noise
- Arithmetic means and invariance principles in stochastic approximation
- Stochastic approximation methods for constrained and unconstrained systems
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing
- About the averaging approach in Gaussian schemes for stochastic approximation
- Averaging for estimating covariances in stochastic approximation
- Some results about averaging in stochastic approximation
- Stochastic algorithms
- On the Law of the Iterated Logarithm in Stochastic Approximation Processes
- Limit theorems for weighted sums and stochastic approximation processes
- Rates of Convergence for an Adaptive Filtering Algorithm Driven by Stationary Dependent Data
- Regularly varying functions
This page was built for publication: On the almost sure asymptotic behaviour of stochastic algorithm