General multilevel adaptations for stochastic approximation algorithms. II: CLTs
From MaRDI portal
Publication:1994904
DOI10.1016/j.spa.2020.11.001zbMath1460.62135arXiv1912.08130OpenAlexW3107024012MaRDI QIDQ1994904
Publication date: 18 February 2021
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.08130
stochastic approximationstable convergencemultilevel Monte Carlocentral limit theorem (CLT)Ruppert-Polyak average
Central limit and other weak theorems (60F05) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05) Stochastic approximation (62L20)
Related Items (3)
Central limit theorems for stochastic gradient descent with averaging for stable manifolds ⋮ Multi-index antithetic stochastic gradient algorithm ⋮ Robbins-Monro algorithm with \(\psi\)-mixing random errors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multilevel Monte Carlo for Lévy-driven SDEs: central limit theorems for adaptive Euler schemes
- Multi-level stochastic approximation algorithms
- Almost sure approximations to the Robbins-Monro and Kiefer-Wolfowitz processes with dependent noise
- General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type
- Stochastic algorithms
- Central limit theorem for the multilevel Monte Carlo Euler method
- Unbiased Estimation with Square Root Convergence for SDE Models
- Multilevel Monte Carlo Methods
- A Generalization of the Averaging Procedure: The Use of Two-Time-Scale Algorithms
- Multilevel Monte Carlo Path Simulation
- Acceleration of Stochastic Approximation by Averaging
- A general method for debiasing a Monte Carlo estimator
- Asymptotic Distribution of Stochastic Approximation Procedures
- Expansion of the global error for numerical schemes solving stochastic differential equations
- A Stochastic Approximation Method
This page was built for publication: General multilevel adaptations for stochastic approximation algorithms. II: CLTs