arXiv:2510. 21033v3 Announce Type: replace-cross Abstract: We develop a theory of iso-Riemannian optimization for problems constrained to learned data manifolds, a setting in which classical Riemannian optimization - and Riemannian gradient descent in particular - can be poorly suited.
By Willem Diepeveen, Melanie Weber
arXiv:2607. 09546v1 Announce Type: new Abstract: We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework.
By Beno\^it Loucheur, P. -A. Absil, Michel Journ\'ee
arXiv:2503. 24075v4 Announce Type: replace-cross Abstract: Low-rank optimization problems with sparse simplex constraints involve variables that must satisfy nonnegativity, sparsity, and sum-to-1 conditions, making their optimization particularly challenging due to the interplay between low-rank structures and constraints.
By Flavia Esposito, Andersen Ang
arXiv:2606. 12120v1 Announce Type: new Abstract: Low-rank optimal transport (OT) mitigates the quadratic scaling of classical solvers, yet existing approaches rely heavily on first-order mirror-descent updates that require careful hyperparameter tuning and ignore the optimization landscape's curvature.
By Pratik Jawanpuria, Bamdev Mishra
arXiv:2510. 09468v3 Announce Type: replace Abstract: Latent manifolds of autoencoders provide low-dimensional representations of data, which can be studied from a geometric perspective.
By Florine Hartwig, Josua Sassen, Juliane Braunsmann, Martin Rumpf, Benedikt Wirth
arXiv:2608. 02576v1 Announce Type: new Abstract: We consider optimization problems defined on product spaces of simplices.
By Shashwat Kumar, Arafat Rahman, Anuj Srivastava, P. -A. Absil