Stable gradient-adjusted root mean square propagation on least squares problem
From MaRDI portal
Cites work
- A randomized Kaczmarz algorithm with exponential convergence
- An incremental least squares algorithm for large scale linear classification
- An introduction to matrix concentration inequalities
- An optimal randomized incremental gradient method
- Convex optimization algorithms
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 5546942 (Why is no real title available?)
- scientific article; zbMATH DE number 635657 (Why is no real title available?)
- scientific article; zbMATH DE number 7306906 (Why is no real title available?)
- Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods
- On adaptive stochastic heavy ball momentum for solving linear systems
- On the \(\mathcal{O}(\frac{\sqrt{d}}{T^{1/4}})\) convergence rate of RMSProp and its momentum extension measured by \(\ell_1\) norm
- On the fast convergence of minibatch heavy ball momentum
- On the real convergence rate of the conjugate gradient method
- Probability
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Randomized Kaczmarz with averaging
- Self-calibration and bilinear inverse problems via linear least squares
- Statistical models and methods for financial markets
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Stochastic reformulations of linear systems: algorithms and convergence theory
- Unified analysis of stochastic gradient methods for composite convex and smooth optimization
This page was built for publication: Stable gradient-adjusted root mean square propagation on least squares problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7300556)
