Stochastic Approximation with Averaging of the Iterates: Optimal Asymptotic Rate of Convergence for General Processes
From MaRDI portal
(Redirected from Publication:3138082)
Recommendations
Cited in
(34)- How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths
- Rate of mixing and the averaging principles for stochastic recursive procedures
- On a continuous time stochastic approximation problem
- Weighted averaging and stochastic approximation
- Asymptotically optimal smoothing of averaged LMS estimates for regression parameter tracking
- General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type
- Convergence rate of linear two-time-scale stochastic approximation.
- Weighted means of processes in stochastic approximation
- Rates of convergence of adaptive step-size of stochastic approximation algorithms
- Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
- The multivariate Révész's online estimator of a regression function and its averaging
- A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithm
- On a stochastic approximation procedure based on averaging
- Optimal non-asymptotic analysis of the Ruppert-Polyak averaging stochastic algorithm
- Recursive least-squares and accelerated convergence in stochastic approximation schemes
- A generalization of the averaging procedure: the use of two-time-scale algorithms
- A framework for adaptive Monte Carlo procedures
- Stochastic approximation method with gradient averaging for unconstrained problems
- scientific article; zbMATH DE number 3850322 (Why is no real title available?)
- The Robbins-Monro type stochastic differential equations. III: Polyak's averaging
- scientific article; zbMATH DE number 125286 (Why is no real title available?)
- Accelerated Stochastic Approximation
- On the estimation of the asymptotic covariance matrix for the averaged Robbins–Monro algorithm
- Asymptotic Efficiency of Perturbation-Analysis-Based Stochastic Approximation with Averaging
- scientific article; zbMATH DE number 778098 (Why is no real title available?)
- Asymptotically optimal rate of convergence of smoothed stochastic recursive algorithms
- Generalization of the Dvoretzky theorem of convergence rate of the stochastic approximation algorithms
- Asymptotic optimality for consensus-type stochastic approximation algorithms using iterate averaging
- Trajectory averaging for stochastic approximation MCMC algorithms
- Estimation and inference in adaptive learning models with slowly decreasing gains
- Multivariate compact law of the iterated logarithm for averaged stochastic approximation algorithms
- Weighted average iterated filtering using p-generalized Gaussian smoothing
- Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algo\-rithms
- Importance accelerated Robbins-Monro recursion with applications to parametric confidence limits
This page was built for publication: Stochastic Approximation with Averaging of the Iterates: Optimal Asymptotic Rate of Convergence for General Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138082)
