Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Harnessing nonnegative matrix factorization for computational materials modeling

View through CrossRef
Interpretable representation learning is becoming an essential requirement for materials modeling and discovery, where accurate predictions alone are often insufficient for guiding scientific understanding or experimental design. Nonnegative Matrix Factorization (NMF) offers a natural framework for this purpose because many materials descriptors, including elemental compositions, spectral intensities, structural counts, and engineered feature groups, are nonnegative and can be meaningfully decomposed into additive latent factors. In this work, we develop and evaluate \texttt{nimd}, a computational framework for Nonnegative Interpretable Matrix Decomposition in materials informatics. The framework brings together standard NMF, Frobenius- and beta-divergence formulations, hierarchical and multilayer NMF, deep NMF, min-volume regularized deep NMF, and semi-supervised NMF variants within a unified workflow for prediction, comparison, and interpretation. Using a high-dimensional Heuslerene monolayer dataset as a representative materials discovery test case, we compare NMF-based representations with PCA across regression and classification tasks. The results show that NMF models can achieve predictive performance comparable to PCA while providing substantially more interpretable latent factors through nonnegative, parts-based decompositions. Deep and multilayer NMF further expose hierarchical structure in the descriptor space, while semi-supervised NMF provides a route for aligning latent representations with target properties. Beyond this demonstration, the framework is designed to support broader materials datasets where interpretability, factor stability, and chemically or physically meaningful feature attribution are central to model usefulness. These results establish NMF-based representation learning as a transparent and scientifically grounded alternative to conventional dimensionality reduction for materials modeling and discovery. The code and data are available through \href{https://github.com/thaksheel/nimd}{\texttt{https://github.com/thaksheel/nimd}}
Title: Harnessing nonnegative matrix factorization for computational materials modeling
Description:
Interpretable representation learning is becoming an essential requirement for materials modeling and discovery, where accurate predictions alone are often insufficient for guiding scientific understanding or experimental design.
Nonnegative Matrix Factorization (NMF) offers a natural framework for this purpose because many materials descriptors, including elemental compositions, spectral intensities, structural counts, and engineered feature groups, are nonnegative and can be meaningfully decomposed into additive latent factors.
In this work, we develop and evaluate \texttt{nimd}, a computational framework for Nonnegative Interpretable Matrix Decomposition in materials informatics.
The framework brings together standard NMF, Frobenius- and beta-divergence formulations, hierarchical and multilayer NMF, deep NMF, min-volume regularized deep NMF, and semi-supervised NMF variants within a unified workflow for prediction, comparison, and interpretation.
Using a high-dimensional Heuslerene monolayer dataset as a representative materials discovery test case, we compare NMF-based representations with PCA across regression and classification tasks.
The results show that NMF models can achieve predictive performance comparable to PCA while providing substantially more interpretable latent factors through nonnegative, parts-based decompositions.
Deep and multilayer NMF further expose hierarchical structure in the descriptor space, while semi-supervised NMF provides a route for aligning latent representations with target properties.
Beyond this demonstration, the framework is designed to support broader materials datasets where interpretability, factor stability, and chemically or physically meaningful feature attribution are central to model usefulness.
These results establish NMF-based representation learning as a transparent and scientifically grounded alternative to conventional dimensionality reduction for materials modeling and discovery.
The code and data are available through \href{https://github.
com/thaksheel/nimd}{\texttt{https://github.
com/thaksheel/nimd}}.

Related Results

Neighborhood Preserving Convex Nonnegative Matrix Factorization
Neighborhood Preserving Convex Nonnegative Matrix Factorization
The convex nonnegative matrix factorization (CNMF) is a variation of nonnegative matrix factorization (NMF) in which each cluster is expressed by a linear combination of the data p...
On Kreĭn's extension theory of nonnegative operators
On Kreĭn's extension theory of nonnegative operators
AbstractIn M. G. Kreĭn's extension theory of nonnegative operators a complete description is given of all nonnegative selfadjoint extensions of a densely defined nonnegative operat...
Factorization structures, cones, and polytopes
Factorization structures, cones, and polytopes
Abstract Factorization structures occur in toric differential and discrete geometry and can be viewed in multiple ways, e.g., as objects determining substantial classes of expli...
Denoising Auto-Encoder-Enhanced Deep Non-Negative Matrix Factorization Clustering Model
Denoising Auto-Encoder-Enhanced Deep Non-Negative Matrix Factorization Clustering Model
Non-negative matrix factorization directly decomposes data features into a base matrix and community matrix, which are easily affected by noise. Multi-view datasets have multiple f...
Data representation using robust nonnegative matrix factorization for edge computing
Data representation using robust nonnegative matrix factorization for edge computing
<abstract> <p>As a popular data representation technique, Nonnegative matrix factorization (NMF) has been widely applied in edge computing, information retrieval and...
Factorization Machines with libFM
Factorization Machines with libFM
Factorization approaches provide high accuracy in several important prediction problems, for example, recommender systems. However, applying factorization approaches to a new predi...
An Almost Optimal Algorithm for Computing Nonnegative Rank
An Almost Optimal Algorithm for Computing Nonnegative Rank
Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$. This is the first exact...

Back to Top