The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Stochastic Gradient Descent on Riemannian Manifolds
Open accessAbstract
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.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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?
The cited source says what the claim attributes to it.
In the citing paper
“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.
Citations
Cites
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A. S., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,741
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,667
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Faraut, J., & Korányi, A. (1994) · doi:10.1093/oso/9780198534778.001.0001 · Cited by 1,659
A Riemannian Framework for Tensor Computing
Pennec, X., Fillard, P., & Ayache, N. (2005) · International Journal of Computer Vision · doi:10.1007/s11263-005-3222-z · Cited by 1,553
Analysis of recursive stochastic algorithms
Ljung, L. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101561 · Cited by 1,485
Principal components, minor components, and linear neural networks
Oja, E. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80089-9 · Cited by 826
Candès, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111771 · Cited by 602
Research works printed but not linked: 10
- tsuda, 2005, Matrix exponentiated gradient updates for online learning and Bregman projection, J Mach Learn Res, 36, 995
- higham, 1989, Matrix Nearness Problems and Applications
- o'neill, 1983, Semi-Riemaniann Geometry
- amari, 1998, Natural Gradient Works Efficiently in Learning
- barbaresco, 2008, Innovative tools for radar signal processing based on Cartan's geometry of symmetric positive-definite matrices and information geometry, Proc IEEE Radar Conf RADAR'08, 1
- bonnabel, 2011, Convergence des m�thodes de gradient stochastique sur les vari�t�s riemanniennes, Proc XIII i�me Colloque GRETSI Bordeaux
- bottou, 1998, Online Algorithms and Stochastic Approximations
- absil, 2007, Optimization Algorithms on Matrix Manifolds
- meyer, 2011, Geometric optimization algorithms for linear regression on fixed-rank matrices
- oja, 1983, Subspace Methods of Pattern Recognition
Cited by
Sorted by citations
Items 501–536 of 536
Leveraging Low-Rank Factorizations of Conditional Correlation Matrices in Graph Learning
Phi, T. H., Hippert-Ferrer, A., Bouchard, F., & Breloy, A. (2026) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2026.3656887
Analysis of Linear Regression Using Different Optimization Techniques
Harshita, K., Laxmi, H., Vaishnavi, P., Chandaragi, P., & Ganiger, R. (2025) · International Conference for Advancement in Technology (ICONAT) · doi:10.1109/iconat66879.2025.11362443
Adaptive Riemannian Manifold Learning for Real-Time Spectrum Sensing in Cognitive Radio Networks
Kamaluddin, K., Omar, A. H., & Hasan, S. (2026) · International Conference on Advanced Research in Computing (ICARC) · doi:10.1109/icarc68737.2026.11453944
Subspace representations in deep neural networks: A survey
Gandra, S. R., Gatto, B. B., & Santos, E. M. D. (2026) · Journal of the Brazilian Computer Society · doi:10.5753/jbcs.2026.5482
Pairwise gossip in CAT(k) metric spaces
Bellachehab, A. (2017) · doi:10.70675/3fa48ba7z41efz4a29zb4a7z75181b2046a3
Representation Learning for Large Scale Classification
Gerald, T. (2020) · theses.fr (ABES) · doi:10.70675/38f5f226zb12dz4f0fzb9a8z2b6e687f19df
Neural graph-to-text generation with euclidean and riemannian graph encoding
Montella, S. (2023) · theses.fr (ABES) · doi:10.70675/b0563a9fz0ff1z4daaza710za9e4d3ed4301
Joint modeling and learning approaches for hyperspectral imaging and changepoint detection
Wang, X. (2024) · theses.fr (ABES) · doi:10.70675/ee98a9fez3898z4c13z9a8fzef7101876c8f
A2G-QFL: Adaptive Aggregation with Two Gains in Quantum Federated Learning
Nanayakkara, S. I., & Pokhrel, S. R. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00132
Zhao, X., Wang, J., Yan, S., & Wang, Y. (2026) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2026.3692418
Tibermacine, I. E., Russo, S., Tamarri, J., Tibermacine, A., & Napoli, C. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.134096
Cross-Quantized Hyperbolic Representations for Enhancing Cartoon Image Retrieval
Nguyen, T.-H., & Le, T.-N.-H. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-0071-9_26
Rundo, F. (2026) · Big Data and Cognitive Computing · doi:10.3390/bdcc10060191
Natural Evolution Strategies with a Gaussian Mixture ModelPreprint
zhichao, T., Ji, C., Fu, Y., & He, Y. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6951045
CurvGCL: Mixed-curvature Manifolds Graph Contrastive Learning for Knowledge-enhanced Recommendation
Zhu, J., Bie, Y., Fu, B., & Hu, J. (2026) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3821218
Disciplined Geodesically Convex Programming: A Symbolic Framework for Verifying Geodesic Convexity
Cheng, A., Dixit, V., & Weber, M. (2026) · Mathematical Programming Computation · doi:10.1007/s12532-026-00325-2
Karimi, A., Harris, Z. B., & Arbab, M. H. (2026) · Journal of Applied Physics · doi:10.1063/5.0317711
Hyperbolic Fuzzy C-Means with Adaptive Weight-based Filtering for Efficient Clustering
Pratihar, A., Das, S., & Das, S. (2025) · Indian Conference on Computer Vision, Graphics and Image Processing · doi:10.1145/3774521.3774551
Embedding learning on multiplex networks for link prediction
Trautmann, O., Wolkenhauer, O., & Réda, C. (2026) · Artificial Intelligence Review · doi:10.1007/s10462-026-11656-w
Geometric Space, Architecture and Learning Objective for Large Pre-Trained Models
Yang, M., Liu, J., Tran, L. V., & Ying, R. (2026) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3770855.3818244 · Cited by 1
A Collaborative Optimization Algorithm for RBF Neural Network Based on Activity Density
Ma, M.-L., Su, Y.-N., Zhang, H., Wang, X.-Y., Dong, R., & Wang, B. (2026) · Neural Processing Letters · doi:10.1007/s11063-026-11877-8
Optimizing continuous-time quantum error correction for Markovian and non-Markovian noise models
Anonymous, Hegde, S., & Brun, T. A. (2026) · Physical Review A · doi:10.1103/5zyg-lhjt
Projection-robust zeroth-order optimization on manifolds under heavy-tailed oracle noise
Ma, Y., Li, C., & Zhang, S. (2026) · Journal of King Saud University - Computer and Information Sciences · doi:10.1007/s44443-026-01272-7
Ye, J., & Zhao, H. (2026) · IEEE Signal Processing Letters · doi:10.1109/lsp.2026.3728716
Hyperbolic graph contrastive learning for drug repositioning over heterogeneous biological networks
Lu, P., Ge, Y., Wan, S., Peng, E., Zhang, J., & Yang, Z. (2026) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2026.109340
Barot, V., Patel, M. R., Patel, M. R., & Barot, P. (2026) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2026.118114
Waveform-Encrypted LPI Radar Framework: Joint Sequence Design, Robust Decryption, and Analysis
Zhu, P., Fan, T., Yu, X., Qiu, H., Pan, B., Cui, G., Yang, X., & Shao, H. (2026) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2026.3732631
Discrete Differential Geometry as a Regularizer for Deep Learning on Manifold-Valued Data
Krishna, B. R., Pappoppula, S., Murthy, K. D. N., Rajeswari, M. B., Prasad, M. S. V. K. V., & Rao, T. V. L. (2026) · International Conference on Emerging Techniques in Computational Intelligence (ICETCI) · doi:10.1109/icetci71772.2026.11710553
COSMOS: continuous subspace manifold operating system learning as gauge dynamics on the Grassmannian
Battú, L. (2026) · Neural Computing and Applications · doi:10.1007/s00521-026-12581-3
Boolean-Information Geometry (BIG): Concept Declaration
Radisic, A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.15645327
Hyperbolic Graph Convolutional Neural Networks
Chami, I., Ying, R., Ré, C., & Leskovec, J. (2019) · arXiv · doi:10.48550/arxiv.1910.12933 · Cited by 344
Multi-relational Poincaré Graph Embeddings
Balažević, I., Allen, C., & Hospedales, T. (2019) · arXiv · doi:10.48550/arxiv.1905.09791 · Cited by 123
Metadata
- 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
- FWCI
- 16.96
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- 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 › Engineering › Control and Systems Engineering › 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
