Cited by 540Stochastic Gradient Optimization TechniquesDistributed Control Multi-Agent SystemsAdvanced Optimization Algorithms Research

Stochastic Gradient Descent on Riemannian Manifolds

Open access
Bonnabel, Silvere·2013·IEEE Transactions on Automatic Control

Abstract

Stochastic gradient descent is a simple approach to find the local minima of a cost function whose evaluations are corrupted by noise. In this paper, we develop a procedure extending stochastic gradient descent algorithms to the case where the function is defined on a Riemannian manifold. We prove that, as in the Euclidian case, the gradient descent algorithm converges to a critical point of the cost function. The algorithm has numerous potential applications, and is illustrated here by four examples. In particular a novel gossip algorithm on the set of covariance matrices is derived and tested numerically.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tac.2013.2254619

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • An analytic closed-form expression for the exponential map in the n-dimensional Poincaré ball is computed, allowing full Riemannian optimization in the Poincaré ball, as opposed to the approximate optimization method used by Nickel & Kiela (2017).

    “We also compute an analytic closed-form expression for the exponential map in the n -dimensional Poincar´ e ball, allowing us to perform full Riemannian optimization (Bonnabel, 2013) in the Poincar´ e ball, as opposed to the approximate optimization method used by (Nickel & Kiela, 2017).”

    From Hyperbolic Entailment Cones for Learning Hierarchical Embeddings (2018) · cites this paper as Bonnabel, 2013

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 10

  1. [1][1] P.A. Absil, R. Mahony, and R. Sepulchre. Optimization Algorithms on Matrix Manifolds . Princeton University Press, 2007. -
  2. [3][3] S.I. Amari. Natural gradient works efficiently in learning . Neural Computation, MIT Press, 1998. -
  3. [5][5] F. Barbaresco. Innovative tools for radar signal processing based on cartan's geometry of symmetric positive-definite matrices and information geometry. In IEEE Radar Conference , 2008. -
  4. [9][9] L. Bottou. Online Algorithms and Stochastic Approximations . Online Learning and Neural Networks, Edited by David Saad, Cambridge University Press, 1998. -
  5. [16][16] Nicholas J. Higham. Matrix nearness problems and applications . Oxford University Press, 1989. -
  6. [21][21] G. Meyer. Geometric optimization algorithms for linear regression on fixed-rank matrices . PhD thesis, University of Li` ege, 2011. -
  7. [25][25] E. Oja. Subspace methods of pattern recognition. Research Studies Press, 1983. -
  8. [27][27] B. O'Neill. Semi-Riemaniann geometry . Pure and applied mathematics. Academic Press Inc., New York, 1983. -
  9. [34][34] S.T. Smith. Covariance, subspace, and intrinsic Cramer-Rao bounds. IEEE Trans. on Signal Processing , 53(5):1610-1629, 2005. -
  10. [37][37] Ratsch-G. Tsuda, K. and M. Warmuth. Matrix exponentiated gradient updates for online learning and bregman projection. Journal of Machine Learning Research , 36(6):9951018, 2005.

Cited by

Sorted by citations

Authors
Bonnabel, S.
Affiliations
Centre de Robotique (FR)
Corresponding author
Bonnabel, Silvere
Venue
IEEE Transactions on Automatic Control
Published
2013-09
Volume
58
Issue
9
Pages
2217-2229
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2138674039
Cited by
540
References
27
Citations by year
2026: 33 · 2025: 52 · 2024: 56 · 2023: 51 · 2022: 52 · 2021: 80 · 2020: 64 · 2019: 53 · 2018: 26 · 2017: 24 · 2016: 22 · 2015: 12 · 2014: 8 · 2013: 4 · 2012: 3
FWCI
16.96
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Automatic Control (publishedVersion)
  • arXiv (Cornell University) (publishedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Control Multi-Agent Systems
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
Keywords
stochastic gradient descent, Riemannian manifolds, gossip algorithms, covariance matrix, distributed optimization, Riemannian optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review