{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/riemannian-optimization","name":"Riemannian optimization","slug":"riemannian-optimization","description_markdown":"Optimization methods on Riemannian manifolds.","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":153,"papers_with_code":50,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":153,"of_with_code":50,"tagged_in_all":153,"counts":{"archive_papers_tagged":153,"with_a_code_link":50,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":153,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/poincare-embeddings-for-learning-hierarchical","slug":"poincare-embeddings-for-learning-hierarchical","title":"Poincaré Embeddings for Learning Hierarchical Representations","date":"2017-05-22","arxiv_id":"1705.08039","repositories_listed":9,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":8,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/poincare-embeddings-for-learning-hierarchical#ran","syntology_url":"https://syntology.ai/paper/1705.08039","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.08039"}},"official":null}},{"url":"/paper/exponential-machines","slug":"exponential-machines","title":"Exponential Machines","date":"2016-05-12","arxiv_id":"1605.03795","repositories_listed":3,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exponential-machines#ran","syntology_url":"https://syntology.ai/paper/1605.03795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.03795"}},"official":{"repos":["Bihaqo/exp-machines"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-spectral-framework-for-tracking-communities","slug":"a-spectral-framework-for-tracking-communities","title":"A Spectral Framework for Tracking Communities in Evolving Networks","date":"2024-12-10","arxiv_id":"2412.07378","repositories_listed":2,"syntology":null},{"url":"/paper/symmetric-spaces-for-graph-embeddings-a","slug":"symmetric-spaces-for-graph-embeddings-a","title":"Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach","date":"2021-06-09","arxiv_id":"2106.04941","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/symmetric-spaces-for-graph-embeddings-a#ran","syntology_url":"https://syntology.ai/paper/2106.04941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04941"}},"official":{"repos":["fedelopez77/sympa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/geoopt-riemannian-optimization-in-pytorch","slug":"geoopt-riemannian-optimization-in-pytorch","title":"Geoopt: Riemannian Optimization in PyTorch","date":"2020-05-06","arxiv_id":"2005.02819","repositories_listed":2,"syntology":null},{"url":"/paper/geomstats-a-python-package-for-riemannian","slug":"geomstats-a-python-package-for-riemannian","title":"geomstats: a Python Package for Riemannian Geometry in Machine Learning","date":"2018-05-21","arxiv_id":"1805.08308","repositories_listed":2,"syntology":null},{"url":"/paper/efficient-optimization-with-orthogonality","slug":"efficient-optimization-with-orthogonality","title":"Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method","date":"2025-05-18","arxiv_id":"2505.12378","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/efficient-optimization-with-orthogonality#ran","syntology_url":"https://syntology.ai/paper/2505.12378","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12378"}},"official":{"repos":["andyjm3/RSDM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/riemannian-optimization-on-relaxed-indicator","slug":"riemannian-optimization-on-relaxed-indicator","title":"Riemannian Optimization on Relaxed Indicator Matrix Manifold","date":"2025-03-26","arxiv_id":"2503.20505","repositories_listed":1,"syntology":null},{"url":"/paper/causal-abstraction-learning-based-on-the","slug":"causal-abstraction-learning-based-on-the","title":"Causal Abstraction Learning based on the Semantic Embedding Principle","date":"2025-02-01","arxiv_id":"2502.00407","repositories_listed":1,"syntology":null},{"url":"/paper/elliptical-wishart-distributions-information","slug":"elliptical-wishart-distributions-information","title":"Elliptical Wishart distributions: information geometry, maximum likelihood estimator, performance analysis and statistical learning","date":"2024-11-05","arxiv_id":"2411.02726","repositories_listed":1,"syntology":null},{"url":"/paper/the-gaussian-discriminant-variational","slug":"the-gaussian-discriminant-variational","title":"The Gaussian Discriminant Variational Autoencoder (GdVAE): A Self-Explainable Model with Counterfactual Explanations","date":"2024-09-19","arxiv_id":"2409.12952","repositories_listed":1,"syntology":null},{"url":"/paper/optimal-matrix-mimetic-tensor-algebras-via","slug":"optimal-matrix-mimetic-tensor-algebras-via","title":"Optimal Matrix-Mimetic Tensor Algebras via Variable Projection","date":"2024-06-11","arxiv_id":"2406.06942","repositories_listed":1,"syntology":null},{"url":"/paper/optimization-without-retraction-on-the-random","slug":"optimization-without-retraction-on-the-random","title":"Optimization without Retraction on the Random Generalized Stiefel Manifold","date":"2024-05-02","arxiv_id":"2405.01702","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/optimization-without-retraction-on-the-random#ran","syntology_url":"https://syntology.ai/paper/2405.01702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01702"}},"official":{"repos":["simonvary/landing-generalized-stiefel"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fireants-adaptive-riemannian-optimization-for","slug":"fireants-adaptive-riemannian-optimization-for","title":"FireANTs: Adaptive Riemannian Optimization for Multi-Scale Diffeomorphic Matching","date":"2024-04-01","arxiv_id":"2404.01249","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fireants-adaptive-riemannian-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2404.01249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.01249"}},"official":{"repos":["rohitrango/fireants"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-learning-with-generalized-ridge","slug":"meta-learning-with-generalized-ridge","title":"Meta-Learning with Generalized Ridge Regression: High-dimensional Asymptotics, Optimality and Hyper-covariance Estimation","date":"2024-03-27","arxiv_id":"2403.19720","repositories_listed":1,"syntology":null},{"url":"/paper/registration-of-algebraic-varieties-using","slug":"registration-of-algebraic-varieties-using","title":"Registration of algebraic varieties using Riemannian optimization","date":"2024-01-16","arxiv_id":"2401.08562","repositories_listed":1,"syntology":null},{"url":"/paper/block-diagonal-orthogonal-relation-and-matrix","slug":"block-diagonal-orthogonal-relation-and-matrix","title":"Block-Diagonal Orthogonal Relation and Matrix Entity for Knowledge Graph Embedding","date":"2024-01-11","arxiv_id":"2401.05967","repositories_listed":1,"syntology":null},{"url":"/paper/fast-hyperboloid-decision-tree-algorithms","slug":"fast-hyperboloid-decision-tree-algorithms","title":"Fast hyperboloid decision tree algorithms","date":"2023-10-20","arxiv_id":"2310.13841","repositories_listed":1,"syntology":null},{"url":"/paper/low-complexity-subspace-descent-over","slug":"low-complexity-subspace-descent-over","title":"Low-complexity subspace-descent over symmetric positive definite manifold","date":"2023-05-03","arxiv_id":"2305.02041","repositories_listed":1,"syntology":null},{"url":"/paper/infeasible-deterministic-stochastic-and","slug":"infeasible-deterministic-stochastic-and","title":"Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraints","date":"2023-03-29","arxiv_id":"2303.16510","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/infeasible-deterministic-stochastic-and#ran","syntology_url":"https://syntology.ai/paper/2303.16510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.16510"}},"official":{"repos":["simonvary/landing-stiefel"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-riemannian-admm","slug":"a-riemannian-admm","title":"A Riemannian ADMM","date":"2022-11-03","arxiv_id":"2211.02163","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-on-spd-manifolds-for","slug":"graph-neural-networks-on-spd-manifolds-for","title":"Graph Neural Networks on SPD Manifolds for Motor Imagery Classification: A Perspective from the Time-Frequency Analysis","date":"2022-10-25","arxiv_id":"2211.02641","repositories_listed":1,"syntology":null},{"url":"/paper/learning-graphical-factor-models-with","slug":"learning-graphical-factor-models-with","title":"Learning Graphical Factor Models with Riemannian Optimization","date":"2022-10-21","arxiv_id":"2210.11950","repositories_listed":1,"syntology":null},{"url":"/paper/rieoptax-riemannian-optimization-in-jax","slug":"rieoptax-riemannian-optimization-in-jax","title":"Rieoptax: Riemannian Optimization in JAX","date":"2022-10-10","arxiv_id":"2210.04840","repositories_listed":1,"syntology":null},{"url":"/paper/neural-collapse-with-normalized-features-a","slug":"neural-collapse-with-normalized-features-a","title":"Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold","date":"2022-09-19","arxiv_id":"2209.09211","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-collapse-with-normalized-features-a#ran","syntology_url":"https://syntology.ai/paper/2209.09211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.09211"}},"official":{"repos":["cjyaras/normalized-neural-collapse"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/riemannian-optimization-for-non-centered","slug":"riemannian-optimization-for-non-centered","title":"Riemannian optimization for non-centered mixture of scaled Gaussian distributions","date":"2022-09-07","arxiv_id":"2209.03315","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-on-tensor-regression-riemannian","slug":"tensor-on-tensor-regression-riemannian","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","date":"2022-06-17","arxiv_id":"2206.08756","repositories_listed":1,"syntology":null},{"url":"/paper/feedback-gradient-descent-efficient-and","slug":"feedback-gradient-descent-efficient-and","title":"Feedback Gradient Descent: Efficient and Stable Optimization with Orthogonality for DNNs","date":"2022-05-12","arxiv_id":"2205.08385","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/feedback-gradient-descent-efficient-and#ran","syntology_url":"https://syntology.ai/paper/2205.08385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08385"}},"official":{"repos":["bokveizen/Feedback-Gradient-Descent"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/riemannian-block-spd-coupling-manifold-and","slug":"riemannian-block-spd-coupling-manifold-and","title":"Riemannian block SPD coupling manifold and its application to optimal transport","date":"2022-01-30","arxiv_id":"2201.12933","repositories_listed":1,"syntology":null},{"url":"/paper/projective-manifold-gradient-layer-for-deep-1","slug":"projective-manifold-gradient-layer-for-deep-1","title":"Projective Manifold Gradient Layer for Deep Rotation Regression","date":"2021-10-22","arxiv_id":"2110.11657","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-bures-wasserstein-geometry-for","slug":"generalized-bures-wasserstein-geometry-for","title":"Learning with symmetric positive definite matrices via generalized Bures-Wasserstein geometry","date":"2021-10-20","arxiv_id":"2110.10464","repositories_listed":1,"syntology":null},{"url":"/paper/nonlinear-matrix-recovery-using-optimization","slug":"nonlinear-matrix-recovery-using-optimization","title":"Nonlinear matrix recovery using optimization on the Grassmann manifold","date":"2021-09-13","arxiv_id":"2109.06095","repositories_listed":1,"syntology":null},{"url":"/paper/vector-transport-free-riemannian-lbfgs-for","slug":"vector-transport-free-riemannian-lbfgs-for","title":"Vector Transport Free Riemannian LBFGS for Optimization on Symmetric Positive Definite Matrix Manifolds","date":"2021-08-25","arxiv_id":"2108.11019","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-train-density-estimation","slug":"tensor-train-density-estimation","title":"Tensor-Train Density Estimation","date":"2021-07-30","arxiv_id":"2108.00089","repositories_listed":1,"syntology":null},{"url":"/paper/on-riemannian-optimization-over-positive","slug":"on-riemannian-optimization-over-positive","title":"On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry","date":"2021-06-01","arxiv_id":"2106.00286","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-fast-matrix-factorization-for","slug":"accurate-and-fast-matrix-factorization-for","title":"Accurate and fast matrix factorization for low-rank learning","date":"2021-04-21","arxiv_id":"2104.10785","repositories_listed":1,"syntology":null},{"url":"/paper/operator-valued-formulas-for-riemannian","slug":"operator-valued-formulas-for-riemannian","title":"Operator-valued formulas for Riemannian Gradient and Hessian and families of tractable metrics","date":"2020-09-21","arxiv_id":"2009.10159","repositories_listed":1,"syntology":null},{"url":"/paper/geomstats-a-python-package-for-riemannian-2","slug":"geomstats-a-python-package-for-riemannian-2","title":"Geomstats: A Python Package for Riemannian Geometry in Machine Learning","date":"2020-04-07","arxiv_id":"2004.04667","repositories_listed":1,"syntology":null},{"url":"/paper/spherical-text-embedding","slug":"spherical-text-embedding","title":"Spherical Text Embedding","date":"2019-11-04","arxiv_id":"1911.01196","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spherical-text-embedding#ran","syntology_url":"https://syntology.ai/paper/1911.01196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01196"}},"official":{"repos":["yumeng5/Spherical-Text-Embedding"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/accelerated-inference-in-markov-random-fields","slug":"accelerated-inference-in-markov-random-fields","title":"Accelerated Inference in Markov Random Fields via Smooth Riemannian Optimization","date":"2018-10-27","arxiv_id":"1810.11689","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-adaptive-optimization-methods","slug":"riemannian-adaptive-optimization-methods","title":"Riemannian Adaptive Optimization Methods","date":"2018-10-01","arxiv_id":"1810.00760","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-frank-wolfe-with-application-to","slug":"riemannian-frank-wolfe-with-application-to","title":"Riemannian Optimization via Frank-Wolfe Methods","date":"2017-10-30","arxiv_id":"1710.10770","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-networks-for-dimensionality-reduction","slug":"tensor-networks-for-dimensionality-reduction","title":"Tensor Networks for Dimensionality Reduction and Large-Scale Optimizations. Part 2 Applications and Future Perspectives","date":"2017-08-30","arxiv_id":"1708.09165","repositories_listed":1,"syntology":null},{"url":"/paper/an-alternative-to-em-for-gaussian-mixture","slug":"an-alternative-to-em-for-gaussian-mixture","title":"An Alternative to EM for Gaussian Mixture Models: Batch and Stochastic Riemannian Optimization","date":"2017-06-10","arxiv_id":"1706.03267","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-optimization-for-skip-gram","slug":"riemannian-optimization-for-skip-gram","title":"Riemannian Optimization for Skip-Gram Negative Sampling","date":"2017-04-26","arxiv_id":"1704.08059","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-stochastic-variance-reduced-1","slug":"riemannian-stochastic-variance-reduced-1","title":"Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport","date":"2017-02-18","arxiv_id":"1702.05594","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-mean-metric-learning","slug":"geometric-mean-metric-learning","title":"Geometric Mean Metric Learning","date":"2016-07-18","arxiv_id":"1607.05002","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-stochastic-variance-reduced","slug":"riemannian-stochastic-variance-reduced","title":"Riemannian stochastic variance reduced gradient on Grassmann manifold","date":"2016-05-24","arxiv_id":"1605.07367","repositories_listed":1,"syntology":null},{"url":"/paper/pymanopt-a-python-toolbox-for-optimization-on","slug":"pymanopt-a-python-toolbox-for-optimization-on","title":"Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation","date":"2016-03-10","arxiv_id":"1603.03236","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pymanopt-a-python-toolbox-for-optimization-on#ran","syntology_url":"https://syntology.ai/paper/1603.03236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.03236"}},"official":{"repos":["pymanopt/pymanopt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mixest-an-estimation-toolbox-for-mixture","slug":"mixest-an-estimation-toolbox-for-mixture","title":"MixEst: An Estimation Toolbox for Mixture Models","date":"2015-07-22","arxiv_id":"1507.06065","repositories_listed":1,"syntology":null},{"url":null,"slug":"2506-10628","title":"Leveraging Low-rank Factorizations of Conditional Correlation Matrices in Graph Learning","date":"2025-06-12","arxiv_id":"2506.10628","repositories_listed":0,"syntology":null},{"url":null,"slug":"polar-polar-decomposed-low-rank-adapter","title":"PoLAR: Polar-Decomposed Low-Rank Adapter Representation","date":"2025-06-03","arxiv_id":"2506.03133","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-multiplicative-update-for-sparse","title":"Riemannian Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates","date":"2025-03-31","arxiv_id":"2503.24075","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-evolution-for-grassmann-manifold","title":"Differential Evolution for Grassmann Manifold Optimization: A Projection Approach","date":"2025-03-27","arxiv_id":"2503.21984","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-reduced-rank-regression","title":"Higher Order Reduced Rank Regression","date":"2025-03-09","arxiv_id":"2503.06528","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-spectral-clustering-on-the","title":"Multi-view Spectral Clustering on the Grassmannian Manifold With Hypergraph Representation","date":"2025-03-08","arxiv_id":"2503.06066","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-distributionally-robust-optimization","title":"The Distributionally Robust Optimization Model of Sparse Principal Component Analysis","date":"2025-03-04","arxiv_id":"2503.02494","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-accurate-manifold-denoising-by-tunneling","title":"Fast, Accurate Manifold Denoising by Tunneling Riemannian Optimization","date":"2025-02-24","arxiv_id":"2502.16819","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-factorized-positive-definite","title":"Spectral-factorized Positive-definite Curvature Learning for NN Training","date":"2025-02-10","arxiv_id":"2502.06268","repositories_listed":0,"syntology":null},{"url":null,"slug":"gauss-newton-dynamics-for-neural-networks-a","title":"A Riemannian Optimization Perspective of the Gauss-Newton Method for Feedforward Neural Networks","date":"2024-12-18","arxiv_id":"2412.14031","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperboloid-gplvm-for-discovering-continuous","title":"Hyperboloid GPLVM for Discovering Continuous Hierarchies via Nonparametric Estimation","date":"2024-10-22","arxiv_id":"2410.16698","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-regularization-for-constrained","title":"Structured Regularization for Constrained Optimization on the SPD Manifold","date":"2024-10-12","arxiv_id":"2410.09660","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-optimization-for-non-convex","title":"Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees","date":"2024-10-08","arxiv_id":"2410.06376","repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-mixture-model-q-functions-for","title":"Gaussian-Mixture-Model Q-Functions for Reinforcement Learning by Riemannian Optimization","date":"2024-09-06","arxiv_id":"2409.04374","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-coordinate-descent-algorithms-on","title":"Riemannian coordinate descent algorithms on matrix manifolds","date":"2024-06-04","arxiv_id":"2406.02225","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-and-complexity-guarantee-for","title":"Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms","date":"2024-05-05","arxiv_id":"2405.03073","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-quantum-process-tomography-via","title":"Fast Quantum Process Tomography via Riemannian Gradient Descent","date":"2024-04-29","arxiv_id":"2404.18840","repositories_listed":0,"syntology":null},{"url":null,"slug":"worst-case-riemannian-optimization-with","title":"Worst-Case Riemannian Optimization with Uncertain Target Steering Vector for Slow-Time Transmit Sequence of Cognitive Radar","date":"2024-04-16","arxiv_id":"2404.10388","repositories_listed":0,"syntology":null},{"url":null,"slug":"design-of-artificial-interference-signals-for","title":"Design of Artificial Interference Signals for Covert Communication Aided by Multiple Friendly Nodes","date":"2024-04-14","arxiv_id":"2404.09131","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-differentially-private-low-rank","title":"Near-Optimal differentially private low-rank trace regression with guaranteed private initialization","date":"2024-03-24","arxiv_id":"2403.15999","repositories_listed":0,"syntology":null},{"url":null,"slug":"streamlining-in-the-riemannian-realm","title":"Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction","date":"2024-03-11","arxiv_id":"2403.06677","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-and-complexity-of-block","title":"Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization","date":"2023-12-16","arxiv_id":"2312.10330","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-self-attention-mechanism-for-spd","title":"Riemannian Self-Attention Mechanism for SPD Networks","date":"2023-11-28","arxiv_id":"2311.16738","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-optimization-methods","title":"Riemannian stochastic optimization methods avoid strict saddle points","date":"2023-11-04","arxiv_id":"2311.02374","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-fisher-rao-geometry-of-ces-distributions","title":"The Fisher-Rao geometry of CES distributions","date":"2023-10-02","arxiv_id":"2310.01032","repositories_listed":0,"syntology":null},{"url":null,"slug":"symplectic-structure-aware-hamiltonian-graph","title":"Symplectic Structure-Aware Hamiltonian (Graph) Embeddings","date":"2023-09-09","arxiv_id":"2309.04885","repositories_listed":0,"syntology":null},{"url":null,"slug":"multichannel-active-noise-control-with","title":"Multichannel Active Noise Control with Exterior Radiation Suppression Based on Riemannian Optimization","date":"2023-06-15","arxiv_id":"2306.08855","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-low-rank-model-compression-for","title":"Riemannian Low-Rank Model Compression for Federated Learning with Over-the-Air Aggregation","date":"2023-06-04","arxiv_id":"2306.02433","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-gradient-flows-for-optimizing","title":"Wasserstein Gradient Flows for Optimizing Gaussian Mixture Policies","date":"2023-05-17","arxiv_id":"2305.10411","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-low-rank-tensor-learning","title":"Structured Low-Rank Tensor Learning","date":"2023-05-13","arxiv_id":"2305.07967","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-riemannian-newton-type-optimization-by","title":"Faster Riemannian Newton-type Optimization by Subsampling and Cubic Regularization","date":"2023-02-22","arxiv_id":"2302.11076","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-approximation-for","title":"Riemannian Stochastic Approximation for Minimizing Tame Nonsmooth Objective Functions","date":"2023-02-01","arxiv_id":"2302.00709","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-optimization-for-variance","title":"Riemannian Optimization for Variance Estimation in Linear Mixed Models","date":"2022-12-18","arxiv_id":"2212.09081","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-riemannian-optimization-handling","title":"Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties","date":"2022-11-26","arxiv_id":"2211.14645","repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-free-riemannian-optimization","title":"Manifold Free Riemannian Optimization","date":"2022-09-07","arxiv_id":"2209.03269","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-variance-reduced-stochastic-gradient","title":"A Variance-Reduced Stochastic Gradient Tracking Algorithm for Decentralized Optimization with Orthogonality Constraints","date":"2022-08-29","arxiv_id":"2208.13643","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-a-class-of-geodesically-convex","title":"On a class of geodesically convex optimization problems solved via Euclidean MM methods","date":"2022-06-22","arxiv_id":"2206.11426","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-cur-decompositions-for-robust","title":"Riemannian CUR Decompositions for Robust Principal Component Analysis","date":"2022-06-17","arxiv_id":"2206.09042","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-dynamics-of-riemannian-robbins-monro","title":"Riemannian stochastic approximation algorithms","date":"2022-06-14","arxiv_id":"2206.06795","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-riemannian","title":"Differentially private Riemannian optimization","date":"2022-05-19","arxiv_id":"2205.09494","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-hamiltonian-methods-for-min-max","title":"Riemannian Hamiltonian methods for min-max optimization on manifolds","date":"2022-04-25","arxiv_id":"2204.11418","repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-optimization-methods-for-hybrid","title":"Manifold Optimization Methods for Hybrid beamforming in mmWave Dual-Function Radar-Communication System","date":"2021-11-30","arxiv_id":"2111.15102","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-riemannian-accelerated-proximal","title":"Understanding Riemannian Acceleration via a Proximal Extragradient Framework","date":"2021-11-04","arxiv_id":"2111.02763","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-geometric-connections-of-embedded-and","title":"On Geometric Connections of Embedded and Quotient Geometries in Riemannian Fixed-rank Matrix Optimization","date":"2021-10-23","arxiv_id":"2110.12121","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-train-completion-local-recovery","title":"Tensor train completion: local recovery guarantees via Riemannian optimization","date":"2021-10-08","arxiv_id":"2110.03975","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-riemannian-approach-for-constrained","title":"On Riemannian Approach for Constrained Optimization Model in Extreme Classification Problems","date":"2021-09-30","arxiv_id":"2109.15021","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-tensor-train-format-tensor","title":"Provable Tensor-Train Format Tensor Completion by Riemannian Optimization","date":"2021-08-27","arxiv_id":"2108.12163","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-randomized-methods-for-orthogonality","title":"Faster Randomized Methods for Orthogonality Constrained Problems","date":"2021-06-22","arxiv_id":"2106.12060","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-differentiation-for-riemannian","title":"Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds","date":"2021-03-27","arxiv_id":"2103.14974","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-robust-wasserstein-barycenter","title":"Projection Robust Wasserstein Barycenters","date":"2021-02-05","arxiv_id":"2102.03390","repositories_listed":0,"syntology":null}],"syntology_records":11,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":11,"papers_where_code_ran_first_page":"/task/riemannian-optimization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/riemannian-optimization/papers/2","json":"/task/riemannian-optimization/papers/2.json","rows":53},{"order":"ran","page":1,"of":1,"url":"/task/riemannian-optimization/papers/ran/1","json":"/task/riemannian-optimization/papers/ran/1.json","rows":11}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"c1a3ae7870006086fac01b91d3762024d434aaf36f9d4b2e4a525d7eca6c2d30","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}