Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms

From MaRDI portal
Revision as of 08:10, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4507444

DOI10.1137/S0363012998308169zbMath1015.60028MaRDI QIDQ4507444

Mariane Pelletier

Publication date: 18 October 2000

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)




Related Items (22)

Lp and almost sure rates of convergence of averaged stochastic gradient algorithms: locally strongly convex objectiveEstimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergenceA framework for adaptive Monte Carlo proceduresOnline statistical inference for parameters estimation with linear-equality constraintsConvergence rate and averaging of nonlinear two-time-scale stochastic approximation algo\-rithmsThe multivariate Révész's online estimator of a regression function and its averagingTrajectory averaging for stochastic approximation MCMC algorithmsImportance sampling and statistical Romberg methodSome multivariate risk indicators: Minimization by using a Kiefer–Wolfowitz approach to the mirror stochastic algorithmOptimal non-asymptotic analysis of the Ruppert-Polyak averaging stochastic algorithmAdaptive importance sampling for multilevel Monte Carlo Euler methodOn the rates of convergence of parallelized averaged stochastic gradient algorithmsConvergence in quadratic mean of averaged stochastic gradient algorithms without strong convexity nor bounded gradientA fast and recursive algorithm for clustering large datasets with \(k\)-mediansOn the asymptotic rate of convergence of stochastic Newton algorithms and their weighted averaged versionsA companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithmNon asymptotic controls on a recursive superquantile approximationEfficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithmCV<scp>a</scp> R HEDGING USING QUANTIZATION-BASED STOCHASTIC APPROXIMATION ALGORITHMUnconstrained recursive importance samplingAn Efficient Stochastic Newton Algorithm for Parameter Estimation in Logistic RegressionsOnline estimation of the asymptotic variance for averaged stochastic gradient algorithms







This page was built for publication: Asymptotic Almost Sure Efficiency of Averaged Stochastic Algorithms