Riemannian Multiplicative Update for Sparse Simplex constraint using oblique rotation manifold
Esposito, Flavia, Ang, Andersen
–arXiv.org Artificial Intelligence
We propose a new manifold optimization method to solve low-rank problems with sparse simplex constraints (variables are simultaneous nonnegativity, sparsity, and sum-to-1) that are beneficial in applications. The proposed approach exploits oblique rotation manifolds, rewrite the problem, and introduce a new Riemannian optimization method. Experiments on synthetic datasets compared to the standard Euclidean method show the effectiveness of the proposed method.
arXiv.org Artificial Intelligence
Mar-31-2025
- Country:
- Europe
- Italy (0.04)
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- Hampshire > Southampton (0.04)
- North America > United States
- New Jersey > Mercer County
- Princeton (0.04)
- Pennsylvania > Philadelphia County
- Philadelphia (0.04)
- New Jersey > Mercer County
- Europe
- Genre:
- Research Report (0.50)
- Technology: