A unified framework for non-negative matrix and tensor factorisations with a smoothed Wasserstein loss
Not on the map. Why?
Abstract (arXiv)
Non-negative matrix and tensor factorisations are a classical tool for finding low-dimensional representations of high-dimensional datasets. In applications such as imaging, datasets can be regarded as distributions supported on a space with metric structure. In such a setting, a loss function based on the Wasserstein distance of optimal transportation theory is a natural choice since it incorporates the underlying geometry of the data. We introduce a general mathematical framework for computing non-negative factorisations of both matrices and tensors with respect to an optimal transport loss. We derive an efficient computational method for its solution using a convex dual formulation, and demonstrate the applicability of this approach with several numerical illustrations with both matrix and tensor-valued data.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 10 of its 27 references that are in the map. First posted on arXiv 4 Apr 2021.
Builds on
10 of 27 references.
References · 10
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2015Learning with a Wasserstein Losscited by 196
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 139
- 2016TensorLy: Tensor Learning in Pythoncited by 104
- 2017Wasserstein Dictionary Learning: Optimal Transport-based unsupervised non-linear dictionary learningcited by 35
- 2015A Smoothed Dual Approach for Variational Wasserstein Problemscited by 29
- 2018Semi-dual Regularized Optimal Transportcited by 26
- 2020SWIFT: Scalable Wasserstein Factorization for Sparse Nonnegative Tensorscited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.