arXiv Machine Learning By Pratik Jawanpuria, Ankish Chandresh, Bamdev Mishra

Riemannian Optimization for Hadamard Products of Low-Rank Matrices

Read the original on arXiv Machine Learning →

arXiv:2606. 01216v1 Announce Type: new Abstract: The elementwise Hadamard product of two low-rank matrices provides a parameter-efficient model for data with multiplicative structure, but its modeling is challenging due to the presence of additional symmetries under coupled row/column scalings between the two factors.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv AI
Jul 22

Riemannian Deep Learning:Modules, Networks, and Geometries

arXiv:2607. 19305v1 Announce Type: cross Abstract: Deep neural networks on manifold-valued representations have attracted growing interest, but many basic components remain tied to specific manifolds, rely on Euclidean approximations, or require costly and numerically fragile geometric operations.

By Chen Ziheng
arXiv AI
Jul 24

Riemannian Deep Learning: Modules, Networks, and Geometries

arXiv:2607. 19305v2 Announce Type: replace-cross Abstract: Deep neural networks on manifold-valued representations have attracted growing interest, but many basic components remain tied to specific manifolds, rely on Euclidean approximations, or require costly and numerically fragile geometric operations.

By Chen Ziheng
arXiv Machine Learning
Jun 11

A Riemannian Approach to Low-Rank Optimal Transport

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 Machine Learning
Jul 2

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates

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