Consistency of stochastic approximation algorithm with quasi-associated random errors
From MaRDI portal
Publication:2834640
Recommendations
- scientific article; zbMATH DE number 3965945
- scientific article; zbMATH DE number 4096632
- Almost sure convergence of stochastic approximation algorithms with non-additive noise
- Almost sure rate of convergence of the parameter estimates in stochastic approximation algorithm
- Convergence of stochastic approximation algorithms under irregular conditions
- Stochastic approximation algorithms: Nonasymptotic estimation of their convergence rates
- Non-asymptotic confidence bounds for stochastic approximation algorithms with constant step size
- scientific article; zbMATH DE number 3864328
- Asymptotic properties of quasi-optimal algorithms of stochastic approximation under unknown density of noise
- Kiefer-Wolfowitz algorithm under quasi-associated random errors
Cites work
- scientific article; zbMATH DE number 3459735 (Why is no real title available?)
- A Stochastic Approximation Method
- An exponential inequality under weak dependence
- Antithetic and Negatively Associated Random Variables and Function Maximization
- Correlation inequalities on some partially ordered sets
- Exponential bounds in stochastic approximation procedures
Cited in
(4)- scientific article; zbMATH DE number 1944272 (Why is no real title available?)
- scientific article; zbMATH DE number 1341164 (Why is no real title available?)
- Complete convergence of stochastic approximation algorithm in \(\mathbb{R}^d\) under random noises
- Robbins-Monro algorithm with \(\psi\)-mixing random errors
This page was built for publication: Consistency of stochastic approximation algorithm with quasi-associated random errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834640)