Variable sparsity non-negative matrix and tensor factorization algorithms and their applications in cancer genomics
Abstract
The field of oncology has experienced significant advancements in novel therapies and molecular diagnostics to personalize initial cancer treatments. However, cancer's propensity for evolution and resistance to therapies remains a formidable challenge due to its dynamic nature. Cancer's complex and adaptive behavior surpasses the capabilities of simple models, complicating our comprehension at every level, from basic sciences to clinical practices, highlighting the urgent need for innovative approaches to improve the modeling and classification of cancer. In this context, matrix factorization algorithms have been used to generate transcriptional signatures that summarize the most salient patterns of behaviors in cancer datasets. For example, the standard non-negative matrix factorization algorithm (NMF) generates a dimensionality-reduced representation that encodes a significant amount of data relationships as a mixture of positive components and provides a working summary of the input data. The resulting NMF factor matrices, W and H, display some degree of sparseness; however, this sparseness is often a byproduct rather than an explicit objective of the NMF algorithm, and the user has limited control over the degree of sparseness of the representation and the corresponding balance between local versus global structures in the NMF results. Some sparse versions of NMF have been introduced but still do not allow a fine-grained control on the sparsity constraints. We present here a novel variable-sparsity Non-negative Matrix Factorization algorithm (vsNMF), where instead of imposing sparsity as a regularization constraint on the NMF objective function, sparsity is explicitly enforced by a projective step performed for each column of W and row of H after a standard NMF update. In this way, the algorithm takes as input the input matrix, plus two one-dimensional vectors, that specify the sparsity functions that will be imposed on the NMF solution. The more explicit control of sparsity, and the corresponding balance between local vs. global structure, at the level of individual components, allows the generation of NMF solutions that can be tuned to operate anywhere between a generative, parts-based encoding of overlapping features, and a partitional, soft-clustering model. This allows greater flexibility to represent biological subtypes, patterns of pathway activation or deregulation, and higher biological interpretability. These learned low-dimensionality representations can also be used to integrate and merge datasets, or to define groups of similar cancer samples representing putative cellular or tumor states. Adjustable/tunable NMF representations of biological data can greatly help advance our fundamental understanding of cancer biology, provide more interpretable computational models of cancer, and better functional cancer taxonomies and precision oncology paradigms. We apply the same approach to tensors and introduce a variable-sparsity Non-Negative Tensor Factorization algorithm (vsNTF) that can take an input tensor and sparsity functions for each of the tensor dimensions.
Related
- New insights into outer membrane vesicles in Gram-negative bacteria from biogenesis to applications
- ssJSD: A Fusion of Sparsity and Spatial Information for HiC Single-Cell Clustering
- SpaReg: sparsity-based 3D reconstruction of tissue microenvironments at native resolution across morphological and spatial molecular modalities
- Assistive algorithms influence neural representations in motor brain-computer interfaces
- AutoNovo: Agentic Program Search Discovers Transferable Nucleic Acid Design Algorithms
BibTeX
@misc{pham2026variable,
title = {{Variable sparsity non-negative matrix and tensor factorization algorithms and their applications in cancer genomics}},
author = {Timothy Pham and Jiaqian Zhong and Joseph Hwang and Ronit Agarwala and Kun Zhang and Prashant Mali and William Kim and Pablo Tamayo},
howpublished = {bioRxiv},
year = {2026},
month = oct,
doi = {10.64898/2026.10.19.760022},
url = {https://www.biorxiv.org/content/10.64898/2026.10.19.760022v1},
note = {CC BY-NC-ND},
}
RIS
TY - UNPB
TI - Variable sparsity non-negative matrix and tensor factorization algorithms and their applications in cancer genomics
AU - Timothy Pham
AU - Jiaqian Zhong
AU - Joseph Hwang
AU - Ronit Agarwala
AU - Kun Zhang
AU - Prashant Mali
AU - William Kim
AU - Pablo Tamayo
PY - 2026
DA - 2026/10/19
PB - bioRxiv
DO - 10.64898/2026.10.19.760022
UR - https://www.biorxiv.org/content/10.64898/2026.10.19.760022v1
AB - The field of oncology has experienced significant advancements in novel therapies and molecular diagnostics to personalize initial cancer treatments. However, cancer's propensity for evolution and resistance to therapies remains a formidable challenge due to its dynamic nature. Cancer's complex and adaptive behavior surpasses the capabilities of simple models, complicating our comprehension at every level, from basic sciences to clinical practices, highlighting the urgent need for innovative approaches to improve the modeling and classification of cancer. In this context, matrix factorization algorithms have been used to generate transcriptional signatures that summarize the most salient patterns of behaviors in cancer datasets. For example, the standard non-negative matrix factorization algorithm (NMF) generates a dimensionality-reduced representation that encodes a significant amount of data relationships as a mixture of positive components and provides a working summary of the input data. The resulting NMF factor matrices, W and H, display some degree of sparseness; however, this sparseness is often a byproduct rather than an explicit objective of the NMF algorithm, and the user has limited control over the degree of sparseness of the representation and the corresponding balance between local versus global structures in the NMF results. Some sparse versions of NMF have been introduced but still do not allow a fine-grained control on the sparsity constraints. We present here a novel variable-sparsity Non-negative Matrix Factorization algorithm (vsNMF), where instead of imposing sparsity as a regularization constraint on the NMF objective function, sparsity is explicitly enforced by a projective step performed for each column of W and row of H after a standard NMF update. In this way, the algorithm takes as input the input matrix, plus two one-dimensional vectors, that specify the sparsity functions that will be imposed on the NMF solution. The more explicit control of sparsity, and the corresponding balance between local vs. global structure, at the level of individual components, allows the generation of NMF solutions that can be tuned to operate anywhere between a generative, parts-based encoding of overlapping features, and a partitional, soft-clustering model. This allows greater flexibility to represent biological subtypes, patterns of pathway activation or deregulation, and higher biological interpretability. These learned low-dimensionality representations can also be used to integrate and merge datasets, or to define groups of similar cancer samples representing putative cellular or tumor states. Adjustable/tunable NMF representations of biological data can greatly help advance our fundamental understanding of cancer biology, provide more interpretable computational models of cancer, and better functional cancer taxonomies and precision oncology paradigms. We apply the same approach to tensors and introduce a variable-sparsity Non-Negative Tensor Factorization algorithm (vsNTF) that can take an input tensor and sparsity functions for each of the tensor dimensions.
SN - 2692-8205
ER -