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
Flagged first, then by citations
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 101–200 of 536
Hyperbolic Hierarchy-Aware Knowledge Graph Embedding for Link Prediction
Pan, Z., & Wang, P. (2021) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2021.findings-emnlp.251 · Cited by 33
Projection Robust Wasserstein Distance and Riemannian OptimizationPreprint
Lin, T., Fan, C., Ho, N., Cuturi, M., & Jordan, M. I. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.07458 · Cited by 35
Riemannian Adaptive Optimization Algorithm and its Application to Natural Language Processing
Sakai, H., & Iiduka, H. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3049845 · Cited by 29
H-Diffu: Hyperbolic Representations for Information Diffusion Prediction
Feng, S., Zhao, K., Fang, L., Feng, K., Wei, W., Li, X., & Shao, L. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3209067 · Cited by 29
Hyperbolic Disk Embeddings for Directed Acyclic GraphsPreprint
Suzuki, R., Takahama, R., & Onoda, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.04335 · Cited by 29
Fully Hyperbolic Graph Convolution Network for Recommendation
Wang, L., Hu, F., Wu, S., & Wang, L. (2021) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3459637.3482109 · Cited by 34
Extrapolation over temporal knowledge graph via hyperbolic embedding
Jia, Y., Lin, M., Wang, Y., Li, J., Chen, K., Siebert, J. I., Zhang, G. Z., & Liao, Q. (2023) · CAAI Transactions on Intelligence Technology · doi:10.1049/cit2.12186 · Cited by 28
Scalable Hyperbolic Recommender SystemsPreprint
Chamberlain, B. P., Hardwick, S. R., Wardrope, D. R., Dzogang, F., Daolio, F., & Vargas, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.08648 · Cited by 28
Embedding Heterogeneous Networks into Hyperbolic Space Without Meta-path
Wang, L., Gao, C., Huang, C., Liu, R., Ma, W., & Vosoughi, S. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i11.17217 · Cited by 27
Poincaré Wasserstein AutoencoderPreprint
Ovinnikov, I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.01427 · Cited by 30
Probing BERT in Hyperbolic SpacesPreprint
Chen, B., Fu, Y., Xu, G., Xie, P., Tan, C., Chen, M., & Jing, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.03869 · Cited by 46
Riemannian Stochastic Recursive Gradient Algorithm
Kasai, H., Sato, H., & Mishra, B. (2018) · International Conference on Machine Learning · Cited by 26
Mini-batch spectral clustering
Han, Y., & Filippone, M. (2017) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2017.7966346 · Cited by 26
Learning to Optimize on SPD Manifolds
Gao, Z. F., Wu, Y., Jia, Y., & Harandi, M. T. (2020) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr42600.2020.00772 · Cited by 26
R-SPIDER: A Fast Riemannian Stochastic Optimization Algorithm with Curvature Independent RatePreprint
Zhang, J., Zhang, H., & Sra, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.04194 · Cited by 26
Scalable and Effective Temporal Graph Representation Learning With Hyperbolic Geometry
Xu, Y., Zhang, W., Xu, X., Li, B., & Zhang, Y. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3394161 · Cited by 27
A Multi-Sensor Fusion Underwater Localization Method Based on Unscented Kalman Filter on Manifolds
Wang, Y., Xie, C., Liu, Y., Zhu, J., & Qin, J. (2024) · Sensors · doi:10.3390/s24196299 · Cited by 25
HSR: Hyperbolic Social Recommender
Li, A., Yang, B. X., Hussain, F. K., & Huo, H. (2021) · Information Sciences · doi:10.1016/j.ins.2021.11.040 · Cited by 28
Guo, Y., Zhou, D., Nie, R., Ruan, X., & Li, W. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.10.091 · Cited by 27
Unsupervised Deep Metric Learning via Orthogonality Based Probabilistic Loss
Dutta, U. K., Harandi, M. T., & Sekhar, C. C. (2020) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2020.3026982 · Cited by 25
Hierarchical Metadata-Aware Document Categorization under Weak Supervision
Zhang, Y., Chen, X., Yu, M., & Han, J. (2021) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/3437963.3441730 · Cited by 25
Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization
Li, J., Balasubramanian, K., & Ma, S. (2022) · Mathematics of Operations Research · doi:10.1287/moor.2022.1302 · Cited by 31
An intrinsic Cramér-Rao bound on SO(3) for (dynamic) attitude filtering
Bonnabel, S., & Barrau, A. (2015) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2015.7402526 · Cited by 24
Self-citationAkimoto, Y., Auger, A., & Hansen, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32937-1_5 · Cited by 24
Escaping from saddle points on Riemannian manifoldsPreprint
Sun, Y., Flammarion, N., & Fazel, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.07355 · Cited by 24
HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender SystemsPreprint
Tran, L. V., Tay, Y., Zhang, S., Cong, G., & Li, X. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.01703 · Cited by 24
Proceedings of the 4th Workshop on Representation Learning for NLP (RepL4NLP-2019)
Augenstein, I., Gella, S., Ruder, S., Kann, K., Can, B., Conneau, A., Welbl, J., Ren, X., & Rei, M. (2019) · doi:10.18653/v1/w19-43 · Cited by 24
Multimodal sentiment and emotion recognition in hyperbolic space
Araño, K. A., Orsenigo, C., Soto, M., & Vercellis, C. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115507 · Cited by 23
Hyperbolic Geometric Graph Representation Learning for Hierarchy-imbalance Node Classification
Fu, X., Wei, Y., Sun, Q., Yuan, H., Wu, J. X., Peng, H. M., & Li, J. (2023) · International World Wide Web Conference (WWW) · doi:10.1145/3543507.3583403 · Cited by 27
Supervised LogEuclidean Metric Learning for Symmetric Positive Definite MatricesPreprint
Yger, F., & Sugiyama, M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.03505 · Cited by 23
Understanding symmetries in deep networksPreprint
Badrinarayanan, V., Mishra, B., & Cipolla, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.01029 · Cited by 42
Skip-gram word embeddings in hyperbolic spacePreprint
Leimeister, M., & Wilson, B. J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.01498 · Cited by 23
Optimizing Oblique Projections for Nonlinear Systems using Trajectories
Otto, S. E., Padovan, A., & Rowley, C. W. (2022) · SIAM Journal on Scientific Computing · doi:10.1137/21m1425815 · Cited by 22
CO-SNE: Dimensionality Reduction and Visualization for Hyperbolic Data
Guo, Y., Guo, H., & Yu, S. X. (2022) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52688.2022.00011 · Cited by 22
The Euclidean Space is Evil: Hyperbolic Attribute Editing for Few-shot Image Generation
Li, L., Zhang, Y., & Wang, S. (2023) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51070.2023.02076 · Cited by 24
Gradient descent in hyperbolic spacePreprint
Wilson, B. J., & Leimeister, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.08207 · Cited by 22
McTorch, a manifold optimization library for deep learningPreprint
Meghwanshi, M., Jawanpuria, P., Kunchukuttan, A., Kasai, H., & Mishra, B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.01811 · Cited by 22
Computation for Latent Variable Model Estimation: A Unified Stochastic Proximal Framework
Zhang, S., & Chen, Y. (2022) · Psychometrika · doi:10.1007/s11336-022-09863-9 · Cited by 22
Hyperbolic Music Transformer for Structured Music Generation
Huang, W., Yu, Y., Xu, H., Su, Z., & Wu, Y. (2023) · IEEE Access · doi:10.1109/access.2023.3257381 · Cited by 22
Tag2Vec: Learning Tag Representations in Tag Networks
Wang, J., Lu, Z., Song, G., Fan, Y. B., Du, L., & Lin, W. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313622 · Cited by 21
Inferring Concept Hierarchies from Text Corpora via Hyperbolic EmbeddingsPreprint
Le, M., Roller, S., Meng-Papaxanthos, L., Kiela, D., & Nickel, M. (2019) · arXiv (Cornell University) · doi:10.3929/ethz-b-000445083 · Cited by 21
Stochastic Approximation for Optimization in Shape Spaces
Geiersbach, C., Loayza-Romero, E., & Welker, K. (2021) · SIAM Journal on Optimization · doi:10.1137/20m1316111 · Cited by 20
Constrained Stochastic Gradient Descent: The Good Practice
Roy, S. K., & Harandi, M. T. (2017) · International Conference on Digital Image Computing: Techniques and Applications (DICTA) · doi:10.1109/dicta.2017.8227420 · Cited by 19
Variational Bayes on manifolds
Tran, M., Nguyen, D. H., & Nguyen, D. (2021) · Statistics and Computing · doi:10.1007/s11222-021-10047-1 · Cited by 20
Dual-Geometric Space Embedding Model for Two-View Knowledge Graphs
Iyer, R. G., Bai, Y., Wang, W. W., & Sun, Y. (2022) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3534678.3539350 · Cited by 21
PERFECT: A Hyperbolic Embedding for Joint User and Community Alignment
Sun, L., Zhang, Z., Zhang, J., Wang, F., Du, Y., Su, S., & Yu, P. S. (2020) · Proceedings · doi:10.1109/icdm50108.2020.00059 · Cited by 19
Hyperbolic Recommender Systems.Preprint
Vinh, T. D. Q., Tay, Y., Zhang, S., Cong, G., & Li, X. (2018) · arXiv (Cornell University) · Cited by 19
Orthogonal Deep Neural NetworksPreprint
Jia, K., Li, S., Wen, Y., Liu, T., & Tao, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.05929 · Cited by 19
An Intrinsic Cramér-Rao Bound on Lie Groups
Bonnabel, S., & Barrau, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-25040-3_71 · Cited by 18
Self-citationWang, X., Jiang, J., Hong, L., Chen, L., & Sun, J. (2023) · Probabilistic Engineering Mechanics · doi:10.1016/j.probengmech.2023.103470 · Cited by 18
On Faster Convergence of Scaled Sign Gradient Descent
Li, X., Lin, K., Li, L., Hong, Y., & Chen, J. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2023.3280938 · Cited by 18
Liao, X., Liu, W., Chen, C., Zhou, P., Zhu, H., Tan, Y., Wang, J., & Qi, Y. (2023) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2023/440 · Cited by 25
Similarity Distance Learning on SPD Manifold for Writer Independent Offline Signature Verification
Zois, E. N., Tsourounis, D., & Kalivas, D. S. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3333681 · Cited by 18
Relative fisher information and natural gradient for learning large modular models
Sun, K., & Nielsen, F. (2017) · King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology) · Cited by 18
MATCH: Metadata-Aware Text Classification in A Large Hierarchy
Zhang, Y., Shen, Z., Dong, Y., Wang, K., & Han, J. (2021) · International World Wide Web Conference (WWW) · doi:10.1145/3442381.3449979 · Cited by 21
Minimum Stein Discrepancy EstimatorsPreprint
Barp, A., Briol, F., Duncan, A., Girolami, M., & Mackey, L. W. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.08283 · Cited by 18
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds
Obara, M., Okuno, T., & Takeda, A. (2022) · SIAM Journal on Optimization · doi:10.1137/20m1370173 · Cited by 17
Stochastic Variance Reduced Gradient Methods Using a Trust-Region-Like Scheme
Yu, T., Liu, X., Dai, Y., & Sun, J. (2021) · Journal of Scientific Computing · doi:10.1007/s10915-020-01402-x · Cited by 17
Zhou, X., Wang, P., Luo, Q., & Pan, Z. (2021) · International Joint Conference on Knowledge Graphs (IJCKG) · doi:10.1145/3502223.3502224 · Cited by 17
Qi, J., Yang, C.-H. H., Chen, P., & Tejedor, J. (2023) · IEEE/ACM Transactions on Audio Speech and Language Processing · doi:10.1109/taslp.2022.3231714 · Cited by 17
HYPER2: Hyperbolic embedding for hyper-relational link prediction
Yan, S., Zhang, Z., Sun, X., Xu, G., Jin, L., & Li, S. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.04.026 · Cited by 17
Learning to Optimize on Riemannian Manifolds
Gao, Z. F., Wu, Y., Fan, X., Harandi, M. T., & Jia, Y. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3215702 · Cited by 17
RicciNet: Deep Clustering via A Riemannian Generative Model
Sun, L., Hu, J., Zhou, S., Huang, Z., Ye, J., Peng, H., Yu, Z., & Yu, P. S. (2024) · International World Wide Web Conference (WWW) · doi:10.1145/3589334.3645428 · Cited by 17
Geometry, Manifolds, and Nonconvex Optimization: How Geometry Can Help Optimization
Manton, J. H. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.3004034 · Cited by 17
Probabilistic learning vector quantization on manifold of symmetric positive definite matrices
Tang, F., Feng, H., Peter Tiňo, B., Si, B., & Ji, D. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.04.024 · Cited by 17
A Riemannian gossip approach to subspace learning on Grassmann manifold
Mishra, B., Kasai, H., Jawanpuria, P., & Saroop, A. (2019) · Machine Learning · doi:10.1007/s10994-018-05775-x · Cited by 18
HyperKG: Hyperbolic Knowledge Graph Embeddings for Knowledge Base CompletionPreprint
Kolyvakis, P., Kalousis, A., & Kiritsis, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.04895 · Cited by 29
Improved Variance Reduction Methods for Riemannian Non-Convex Optimization
Han, A., & Gao, J. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3112139 · Cited by 19
Designing universal causal deep learning models: The geometric (Hyper)transformer
Acciaio, B., Kratsios, A., & Pammer, G. (2023) · Mathematical Finance · doi:10.1111/mafi.12389 · Cited by 24
Hyperbolic Neural Network-Based Preselection for Expensive Multiobjective Optimization
Li, B., Yang, Y., Hong, W., Yang, P., & Zhou, A. (2024) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2024.3409431 · Cited by 16
Multi-Facet Recommender Networks with Spherical Optimization
Tan, Y.-C., Yang, C., Wei, X., Ma, Y., & Zheng, X.-L. (2021) · IEEE International Conference on Data Engineering · doi:10.1109/icde51399.2021.00135 · Cited by 17
HiG2Vec: hierarchical representations of Gene Ontology and genes in the Poincaré ball
Kim, J., Kim, D., & Sohn, K.-A. (2021) · Bioinformatics · doi:10.1093/bioinformatics/btab193 · Cited by 16
Universal Approximation Theorems for Differentiable Geometric Deep LearningPreprint
Kratsios, A., & Papon, L. (2021) · arXiv (Cornell University) · doi:10.3929/ethz-b-000522026 · Cited by 21
Geometric methods for sampling, optimization, inference, and adaptive agents
Barp, A., Costa, L. D., França, G., Friston, K. J., Girolami, M., Jordan, M. I., & Pavliotis, G. A. (2022) · Handbook of statistics · doi:10.1016/bs.host.2022.03.005 · Cited by 24
Enhancing Recommendation with Automated Tag Taxonomy Construction in Hyperbolic Space
Tan, Y., Yang, C., Wei, X., Chen, C., Li, L., & Zheng, X. (2022) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00093 · Cited by 15
Quantization and clustering on Riemannian manifolds with an application to air traffic analysis
Brigant, A. L., & Puechmorel, S. (2019) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2019.05.008 · Cited by 15
Grassmannian learning mutual subspace method for image set recognition
de Souza, L. S., Sogi, N., Gatto, B. B., Kobayashi, T., & Fukui, K. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.10.040 · Cited by 16
RMAML: Riemannian meta-learning with orthogonality constraints
Tabealhojeh, H., Adibi, P., Karshenas, H., Roy, S. K., & Harandi, M. T. (2023) · Pattern Recognition · doi:10.1016/j.patcog.2023.109563 · Cited by 14
Flattening the Parent Bias: Hierarchical Semantic Segmentation in the Poincaré Ball
Weber, S., Zöngür, B., Araslanov, N., & Cremers, D. (2024) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52733.2024.02666 · Cited by 18
Learning Co-Sparse Analysis Operators With Separable Structures
Seibert, M., Wörmann, J., Gribonval, R., & Kleinsteuber, M. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2481875 · Cited by 14
Hyperbolic node embedding for signed networks
Song, W., Chen, H., Liu, X., Jiang, H., & Wang, S. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.10.008 · Cited by 16
Leveraging Hyperbolic Dynamic Neural Networks for Knowledge-Aware Recommendation
Zhang, Y., Li, K., Zhu, J., Yuan, M., Huang, Y., & Li, X. (2024) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2024.3353467 · Cited by 13
Adaptive Log-Euclidean Metrics for SPD Matrix Learning
Chen, Z., Song, Y., Xu, T., Huang, Z., Wu, X., & Sebe, N. (2024) · IEEE Transactions on Image Processing · doi:10.1109/tip.2024.3451930 · Cited by 20
Intrinsic Grassmann Averages for Online Linear, Robust and Nonlinear Subspace Learning
Chakraborty, R., Yang, L., Hauberg, S., & Vemuri, B. C. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2992392 · Cited by 13
A Riemannian optimization approach to the radial distribution network load flow problem
Heidarifar, M., Andrianesis, P. E., & Caramanis, M. C. (2021) · Automatica · doi:10.1016/j.automatica.2021.109620 · Cited by 13
STRUCTURE TENSOR IMAGE FILTERING USING RIEMANNIAN L1 AND L∞ CENTER-OF-MASS
Angulo, J. (2014) · Image Analysis & Stereology · doi:10.5566/ias.v33.p95-105 · Cited by 13
Intrinsic Grassmann Averages for Online Linear and Robust Subspace Learning
Chakraborty, R., Hauberg, S., & Vemuri, B. C. (2017) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2017.92 · Cited by 13
Massart, E. M., Hendrickx, J. M., & Absil, P.-A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-26980-7_77 · Cited by 13
Projection-free nonconvex stochastic optimization on Riemannian manifolds
Weber, M., & Sra, S. (2021) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drab066 · Cited by 13
Handling the Positive-Definite Constraint in the Bayesian Learning RulePreprint
Wu, L., Schmidt, M., & Khan, M. E. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.10060 · Cited by 13
Hyperbolic Busemann Learning with Ideal PrototypesPreprint
Atigh, M. G., Keller‐Ressel, M., & Mettes, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.14472 · Cited by 13
Liu, Y., Wang, L., An, S., Liu, P., & Fan, Z. (2025) · Measurement · doi:10.1016/j.measurement.2025.117316 · Cited by 12
Neural Natural Logic Inference for Interpretable Question Answering
Shi, J., Ding, X., Du, L., Liu, T., & Qin, B. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.298 · Cited by 12
Calissano, A., Feragen, A., & Vantini, S. (2023) · Biometrika · doi:10.1093/biomet/asad024 · Cited by 12
Stochastic Approximation on Riemannian Manifolds
Shah, S. M. (2019) · Applied Mathematics & Optimization · doi:10.1007/s00245-019-09581-2 · Cited by 12
Community preserving mapping for network hyperbolic embedding
Ye, D., Jiang, H., Jiang, Y., Wang, Q., & Hu, Y. (2022) · Knowledge-Based Systems · doi:10.1016/j.knosys.2022.108699 · Cited by 13
Symmetry-invariant optimization in deep networksPreprint
Badrinarayanan, V., Mishra, B., & Cipolla, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.01754 · Cited by 29
SKYPER: Legal case retrieval via skeleton-aware hypergraph embedding in the hyperbolic space
Yan, S., & Zhang, Z. (2024) · Information Sciences · doi:10.1016/j.ins.2024.121162 · Cited by 11
An Optimization Method in the Random Switching Frequency SVPWM for the Sideband Harmonic Dispersion
Wen, J., Cheng, X., Gao, Y., Liu, J. M., Ji, P., & Yang, J. J. (2024) · IEEE Journal of Emerging and Selected Topics in Power Electronics · doi:10.1109/jestpe.2024.3432587 · Cited by 11
Hyperbolic Contrastive Learning for Cross-Domain Recommendation
Yang, X., Chang, H., Lai, Z., Yang, J., Li, X., Lu, Y., Wang, S., Yin, D., & Min, E. (2024) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3627673.3679572 · Cited by 11
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