LGMay 13, 2022

FastSTMF: Efficient tropical matrix factorization algorithm for sparse data

arXiv:2205.06619v12 citationsh-index: 12
Originality Incremental advance
AI Analysis

This work addresses efficiency issues in tropical matrix factorization for sparse data, such as gene expression analysis, but is incremental as it builds upon existing STMF methods.

The authors tackled the slow optimization process in tropical matrix factorization by proposing FastSTMF, a new algorithm that improves computational efficiency and accuracy, outperforming STMF in running time and showing better performance than NMF on some datasets without overfitting.

Matrix factorization, one of the most popular methods in machine learning, has recently benefited from introducing non-linearity in prediction tasks using tropical semiring. The non-linearity enables a better fit to extreme values and distributions, thus discovering high-variance patterns that differ from those found by standard linear algebra. However, the optimization process of various tropical matrix factorization methods is slow. In our work, we propose a new method FastSTMF based on Sparse Tropical Matrix Factorization (STMF), which introduces a novel strategy for updating factor matrices that results in efficient computational performance. We evaluated the efficiency of FastSTMF on synthetic and real gene expression data from the TCGA database, and the results show that FastSTMF outperforms STMF in both accuracy and running time. Compared to NMF, we show that FastSTMF performs better on some datasets and is not prone to overfitting as NMF. This work sets the basis for developing other matrix factorization techniques based on many other semirings using a new proposed optimization process.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes