{"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/papers/2","list_of":"/task/riemannian-optimization","task":"Riemannian optimization","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,153],"of":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"},"first_page":"/task/riemannian-optimization","prev":"/task/riemannian-optimization","next":null,"papers":[{"url":null,"slug":"approximate-birkhoff-von-neumann","title":"Approximate Birkhoff-von-Neumann decomposition: a differentiable approach","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-global-convergence-for-low-rank-matrix","title":"Fast Global Convergence for Low-rank Matrix Recovery via Riemannian Gradient Descent with Random Initialization","date":"2020-12-31","arxiv_id":"2012.15467","repositories_listed":0,"syntology":null},{"url":null,"slug":"escape-saddle-points-faster-on-manifolds-via","title":"Escape saddle points faster on manifolds via perturbed Riemannian stochastic recursive gradient","date":"2020-10-23","arxiv_id":"2010.12191","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-low-rank-matrix-completion-via-an","title":"Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method","date":"2020-08-18","arxiv_id":"2008.07740","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-recursive-momentum","title":"Riemannian stochastic recursive momentum method for non-convex optimization","date":"2020-08-11","arxiv_id":"2008.04555","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-via-adversarially","title":"Representation Learning via Adversarially-Contrastive Optimal Transport","date":"2020-07-11","arxiv_id":"2007.05840","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduction-for-riemannian-non-convex","title":"Variance reduction for Riemannian non-convex optimization with batch size adaptation","date":"2020-07-03","arxiv_id":"2007.01494","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-robust-wasserstein-distance-and","title":"Projection Robust Wasserstein Distance and Riemannian Optimization","date":"2020-06-12","arxiv_id":"2006.07458","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-geometry-for-compound-gaussian","title":"Riemannian geometry for Compound Gaussian distributions: application to recursive change detection","date":"2020-05-20","arxiv_id":"2005.10087","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-proximal-gradient","title":"Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold","date":"2020-05-03","arxiv_id":"2005.01209","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroth-order-optimization-on-riemannian","title":"Stochastic Zeroth-order Riemannian Derivative Estimation and Optimization","date":"2020-03-25","arxiv_id":"2003.11238","repositories_listed":0,"syntology":null},{"url":null,"slug":"affinity-guided-geometric-semi-supervised","title":"Affinity guided Geometric Semi-Supervised Metric Learning","date":"2020-02-27","arxiv_id":"2002.12394","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-riemannian-optimization-on-the-1","title":"Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transform","date":"2020-02-04","arxiv_id":"2002.01113","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-distributed-pca-by","title":"Communication-Efficient Distributed PCA by Riemannian Optimization","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduction-and-quasi-newton-for","title":"Variance Reduction and Quasi-Newton for Particle-Based Variational Inference","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-weighted-submanifolds-with","title":"Learning Weighted Submanifolds with Variational Autoencoders and Riemannian Variational Autoencoders","date":"2019-11-19","arxiv_id":"1911.08147","repositories_listed":0,"syntology":null},{"url":null,"slug":"coupling-matrix-manifolds-and-their","title":"Coupling Matrix Manifolds and Their Applications in Optimal Transport","date":"2019-11-15","arxiv_id":"1911.06905","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperbolic-node-embedding-for-signed-networks","title":"Hyperbolic Node Embedding for Signed Networks","date":"2019-10-29","arxiv_id":"1910.13090","repositories_listed":0,"syntology":null},{"url":null,"slug":"gods-generalized-one-class-discriminative","title":"GODS: Generalized One-class Discriminative Subspaces for Anomaly Detection","date":"2019-08-16","arxiv_id":"1908.05884","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-optimization-on-the-simplex-of","title":"Riemannian optimization on the simplex of positive definite matrices","date":"2019-06-25","arxiv_id":"1906.10436","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-low-rank-tensor-recovery","title":"Optimal low rank tensor recovery","date":"2019-06-12","arxiv_id":"1906.05346","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixed-curvature-representations-in","title":"Learning Mixed-Curvature Representations in Product Spaces","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"block-coordinate-minimization-for-large-sdps","title":"Block-Coordinate Minimization for Large SDPs with Block-Diagonal Constraints","date":"2019-03-02","arxiv_id":"1903.00597","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-joint-dimensionality-reduction-and","title":"Riemannian joint dimensionality reduction and dictionary learning on symmetric positive definite manifold","date":"2019-02-11","arxiv_id":"1902.04186","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-riemannian-preconditioning-for","title":"Riemannian optimization with a preconditioning scheme on the generalized Stiefel manifold","date":"2019-02-05","arxiv_id":"1902.01635","repositories_listed":0,"syntology":null},{"url":null,"slug":"hamiltonian-monte-carlo-for-orthogonal","title":"Hamiltonian Monte-Carlo for Orthogonal Matrices","date":"2019-01-23","arxiv_id":"1901.08045","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-discriminative-video-representations-1","title":"Learning Discriminative Video Representations Using Adversarial Perturbations","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/learning-discriminative-video-representations","slug":"learning-discriminative-video-representations","title":"Contrastive Video Representation Learning via Adversarial Perturbations","date":"2018-07-24","arxiv_id":"1807.09380","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-riemannian-optimization-on-positive","title":"Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"geometry-aware-constrained-optimization","title":"Geometry Aware Constrained Optimization Techniques for Deep Learning","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-linear-temporal-subspace-representations","title":"Non-Linear Temporal Subspace Representations for Activity Recognition","date":"2018-03-27","arxiv_id":"1803.11064","repositories_listed":0,"syntology":null},{"url":null,"slug":"provably-robust-estimation-of-modulo-1","title":"Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping","date":"2018-03-09","arxiv_id":"1803.03669","repositories_listed":0,"syntology":null},{"url":null,"slug":"averaging-stochastic-gradient-descent-on","title":"Averaging Stochastic Gradient Descent on Riemannian Manifolds","date":"2018-02-26","arxiv_id":"1802.09128","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dual-framework-for-low-rank-tensor","title":"A dual framework for low-rank tensor completion","date":"2017-12-04","arxiv_id":"1712.01193","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-on-grassmannian-via","title":"Dimensionality Reduction on Grassmannian via Riemannian Optimization: A Generalized Perspective","date":"2017-11-17","arxiv_id":"1711.06382","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-discriminative-ab-divergences-for","title":"Learning Discriminative ab-Divergences for Positive Definite Matrices","date":"2017-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-discriminative-alpha-beta-divergence","title":"Learning Discriminative Alpha-Beta-divergence for Positive Definite Matrices (Extended Version)","date":"2017-08-05","arxiv_id":"1708.01741","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequence-summarization-using-order","title":"Sequence Summarization Using Order-constrained Kernelized Feature Subspaces","date":"2017-05-24","arxiv_id":"1705.08583","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-rank-pooling-for-activity","title":"Generalized Rank Pooling for Activity Recognition","date":"2017-04-07","arxiv_id":"1704.02112","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-manifold-approach-to-learning-mutually","title":"A Manifold Approach to Learning Mutually Orthogonal Subspaces","date":"2017-03-08","arxiv_id":"1703.02992","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-an-invariant-hilbert-space-for","title":"Learning an Invariant Hilbert Space for Domain Adaptation","date":"2016-11-25","arxiv_id":"1611.08350","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-tensor-completion-with-side","title":"Riemannian Tensor Completion with Side Information","date":"2016-11-12","arxiv_id":"1611.03993","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-tensor-completion-a-riemannian","title":"Low-rank tensor completion: a Riemannian manifold preconditioning approach","date":"2016-05-26","arxiv_id":"1605.08257","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-svrg-fast-stochastic-optimization","title":"Riemannian SVRG: Fast Stochastic Optimization on Riemannian Manifolds","date":"2016-05-23","arxiv_id":"1605.07147","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-manifold-optimization-for-gaussian","title":"Matrix Manifold Optimization for Gaussian Mixtures","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-dictionary-learning-and-sparse","title":"Riemannian Dictionary Learning and Sparse Coding for Positive Definite Matrices","date":"2015-07-10","arxiv_id":"1507.02772","repositories_listed":0,"syntology":null},{"url":null,"slug":"manifold-optimization-for-gaussian-mixture","title":"Manifold Optimization for Gaussian Mixture Models","date":"2015-06-25","arxiv_id":"1506.07677","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-preconditioning-for-tensor","title":"Riemannian preconditioning for tensor completion","date":"2015-06-06","arxiv_id":"1506.02159","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-results-for-projected-line-search","title":"Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality","date":"2014-02-21","arxiv_id":"1402.5284","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-optimisation-on-positive-definite","title":"Geometric optimisation on positive definite matrices for elliptically contoured distributions","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"manopt-a-matlab-toolbox-for-optimization-on","title":"Manopt, a Matlab toolbox for optimization on manifolds","date":"2013-08-23","arxiv_id":"1308.5200","repositories_listed":0,"syntology":null},{"url":null,"slug":"r3mc-a-riemannian-three-factor-algorithm-for","title":"R3MC: A Riemannian three-factor algorithm for low-rank matrix completion","date":"2013-06-11","arxiv_id":"1306.2672","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-gradient-descent-on-riemannian","title":"Stochastic gradient descent on Riemannian manifolds","date":"2011-11-22","arxiv_id":"1111.5280","repositories_listed":0,"syntology":null}],"record_sha256":"70021cf4d6b1a2445fb2c4878738ed5e13ebcf9f64e29f1e0e1b948cf59dc39e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}