Fetching the paper…
Reading the bibliography…
Stochastic gradient descent is a simple approach to find the local minima of a cost function whose evaluations are corrupted by noise.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Quasi-martingales
D.L. Fisk · 1965
Earlier work this paper cites.
Analysis of recursive stochastic algorithms
L. Ljung · 1977
Earlier work this paper cites.
Analysis of stochastic approximation schemes with discontinuous and dependent forcing terms with applications to data communication algorithms
A. Benveniste, M. Goursat, and G. Ruget · 1980
Earlier work this paper cites.
Subspace methods of pattern recognition
E. Oja · 1983
Earlier work this paper cites.
Semi-Riemaniann geometry
B. O’Neill · 1983
Earlier work this paper cites.
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
J.N. Tsitskilis, D. P. Bertsekas, and M. Athans · 1986
Earlier work this paper cites.
Matrix nearness problems and applications
Nicholas J. Higham · 1989
Earlier work this paper cites.
Principal components, minor components, and linear neural networks
E. Oja · 1992
Earlier work this paper cites.
Analysis on Symmetric Cones
J. Faraut and A. Koranyi · 1994
Earlier work this paper cites.
Natural gradient works efficiently in learning
S.I. Amari · 1998
Earlier work this paper cites.
Online Algorithms and Stochastic Approximations
L. Bottou · 1998
Earlier work this paper cites.
The geometry of algorithms with orthogonality constraints
T.A. Arias Edelman, A. and S.T. Smith · 1998
Earlier work this paper cites.
A Riemannian interpolation inequality a la Borell, Brascamp and Lieb
D. Cordero-Erausquin, R. J. McCann, and M. Schmuckenschlager · 2001
Cited alongside, same era.
Stability of multiagent systems with time-dependent communication links
L. Moreau · 2005
Cited alongside, same era.
Covariance, subspace, and intrinsic Cramer-Rao bounds
S.T. Smith · 2005
Cited alongside, same era.
Matrix exponentiated gradient updates for online learning and bregman projection
Ratsch-G. Tsuda, K. and M. Warmuth · 2005
Cited alongside, same era.
Randomized gossip algorithms
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah · 2006
Cited alongside, same era.
Learning low-rank kernel matrices
B. Kulis, M. Sustik, and Dhillon I.S · 2006
Cited alongside, same era.
Adaptive filtering for estimation for a low-rank positive semidefinite matrix
S. Bonnabel, G. Meyer, and R. Sepulchre · 2010
Later among the works it cites.
Low-rank optimization on the cone of positive semidefinite matrices
M. Journee, P.-A. Absil F. Bach, and R. Sepulchre · 2010
Later among the works it cites.
Coordinated motion design on lie groups
A. Sarlette, S. Bonnabel, and R. Sepulchre · 2010
Later among the works it cites.
Riemannian LP center of mass: existence, uniqueness, and convexity
B. Afsari · 2011
Closest in time.
Convergence des méthodes de gradient stochastique sur les variétés riemanniennes
S. Bonnabel · 2011
Closest in time.
Four encounters with system identification
L. Ljung, H. Hjalmarsson, and H. Ohlsson · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A riemannian framework for tensor computing
X. Pennec, P. Fillard, and N. Ayache · 2006
Cited alongside, same era.
Optimization Algorithms on Matrix Manifolds
P.A. Absil, R. Mahony, and R. Sepulchre · 2007
Cited alongside, same era.
Innovative tools for radar signal processing based on cartan’s geometry of symmetric positive-definite matrices and information geometry
F. Barbaresco · 2008
Cited alongside, same era.
Global synchronization on the circle
Sarlette S., S.E. Tuna, V.D. Blondel, and R. Sepulchre · 2008
Cited alongside, same era.
Stabilization of planar collective motion with limited communication
S. Sepulchre, P. Derek, and N.E. Leonard · 2008
Cited alongside, same era.
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
E.J. Candès and Y. Plan · 2009
Cited alongside, same era.
Geometric optimization algorithms for linear regression on fixed-rank matrices
G. Meyer · 2011
Closest in time.
Linear regression under fixed-rank constraints: a Riemannian approach
G. Meyer, S. Bonnabel, and R. Sepulchre · 2011
Closest in time.
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
G. Meyer, S. Bonnabel, and R. Sepulchre · 2011
Closest in time.
Average consensus on Riemannian manifolds with bounded curvature
R. Tron, B. Afsari, and R. Vidal · 2011
Closest in time.
Stochastic algorithms for computing means of probability measures
M. Arnaudon, C. Dombry, A. Phan, and Le Yang · 2012
Closest in time.
Online learning in the embedded manifold of low-rank matrices
U. Shalit, D. Weinshall, and G. Chechik · 2012
Closest in time.