Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing

From MaRDI portal
Publication:1296615

DOI10.1214/aoap/1027961032zbMath0965.62065OpenAlexW2029966711MaRDI QIDQ1296615

Mariane Pelletier

Publication date: 31 July 2001

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1027961032



Related Items

Multi-level stochastic approximation algorithms, Sur quelques algorithmes récursifs pour les probabilités numériques, Generalized rescaled Pólya urn and its statistical application, On-Line Expectation–Maximization Algorithm for latent Data Models, Convergence rates for annealing diffusion processes, Weak Convergence Rates of Population Versus Single-Chain Stochastic Approximation MCMC Algorithms, Recursive estimation in a class of models of deformation, On the Generalized Langevin Equation for Simulated Annealing, How Fast Is the Bandit?, A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits, Weak convergence of dynamical systems in two timescales, Asymptotics in random recursive circuits, Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization, Stochastic optimization with momentum: convergence, fluctuations, and traps avoidance, General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type, Central limit theorems for stochastic approximation with controlled Markov chain dynamics, Convergence of a random algorithm for function optimization, Central limit theorems for generalized Pólya urn models, 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, On the almost sure asymptotic behaviour of stochastic algorithm, Optimal survey schemes for stochastic gradient descent with applications to M-estimation, An almost sure central limit theorem for stochastic approximation algorithms, Adaptive Sampling for Incremental Optimization Using Stochastic Gradient Descent, Networks of reinforced stochastic processes: asymptotics for the empirical means, Unnamed Item



Cites Work