Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms
From MaRDI portal
Publication:4507444
DOI10.1137/S0363012998308169zbMath1015.60028MaRDI QIDQ4507444
Publication date: 18 October 2000
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Related Items
On the rates of convergence of parallelized averaged stochastic gradient algorithms, An Efficient Stochastic Newton Algorithm for Parameter Estimation in Logistic Regressions, Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm, Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergence, A fast and recursive algorithm for clustering large datasets with \(k\)-medians, Trajectory averaging for stochastic approximation MCMC algorithms, Convergence rate and averaging of nonlinear two-time-scale stochastic approximation algo\-rithms, Importance sampling and statistical Romberg method, Unconstrained recursive importance sampling, Online estimation of the asymptotic variance for averaged stochastic gradient algorithms, 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, CV<scp>a</scp> R HEDGING USING QUANTIZATION-BASED STOCHASTIC APPROXIMATION ALGORITHM, A framework for adaptive Monte Carlo procedures, Some multivariate risk indicators: Minimization by using a Kiefer–Wolfowitz approach to the mirror stochastic algorithm
