Almost sure convergence of stochastic gradient processes with matrix step sizes
From MaRDI portal
Publication:2489824
Recommendations
- Almost sure convergence of a stochastic approximation process in a convex set
- scientific article; zbMATH DE number 1275344
- On the convergence of linear stochastic approximation procedures
- Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
- scientific article; zbMATH DE number 1036075
Cites work
- Globally convergent stochastic optimization with optimal asymptotic distribution
- scientific article; zbMATH DE number 53271 (Why is no real title available?)
- scientific article; zbMATH DE number 3553601 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Introduction to Stochastic Search and Optimization
Cited in
(7)- A gradient method for unconstrained optimization in noisy environment
- Stochastic forward-backward splitting for monotone inclusions
- Almost sure convergence and in quadratic mean of the gradient stochastic process for the sequential estimation of a conditional expectation
- A fast and recursive algorithm for clustering large datasets with \(k\)-medians
- Almost sure convergence of a stochastic approximation process in a convex set
- Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?
- An extended Oja process for streaming canonical analysis
This page was built for publication: Almost sure convergence of stochastic gradient processes with matrix step sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489824)
