Search NASA⌕ Search

SEARCH · Search NASA

Results for “Non-negative tensor factorization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

8 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

General-Purpose Unsupervised Cyber Anomaly Detection via Non-Negative Tensor Factorization

Distinguishing malicious anomalous activities from unusual but benign activities is a fundamental challenge for cyber defenders. Prior studies have shown that statistical user behavior analysis yields accurate detections by learning behavior profiles from observed user activity. These unsupervised models are able to generalize to unseen types of attacks by detecting deviations from normal behavior, without knowledge of specific attack signatures. However, approaches proposed to date based on probabilistic matrix factorization are limited by the information conveyed in a two-dimensional space. Non-negative tensor factorization, on the other hand, is a powerful unsupervised machine learning method that naturally models multi-dimensional data, capturing complex and multi-faceted details of behavior profiles. Herein, our new unsupervised statistical anomaly detection methodology matches or surpasses state-of-the-art supervised learning baselines across several challenging and diverse cyber application areas, including detection of compromised user credentials, botnets, spam e-mails, and fraudulent credit card transactions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Unsupervised machine learning based on non-negative tensor factorization for analyzing reactive-mixing

Analysis of reactive-diffusion simulations representing complex mixing processes requires a large number of independent model runs. For each high-fidelity model simulation, the model inputs are varied and the predicted mixing behavior is represented by temporal and spatial changes in species concentration. It is then required to discern how the model inputs (such as diffusivity, dispersion, anisotropy, and velocity field properties) impact the mixing process. This task is challenging and typically involves interpretation of large model outputs representing temporal and spatial changes of species concentration within the model domain. Yet, the task can be automated and substantially simplified by applying Machine Learning (ML) methods. Here, we present an application of an unsupervised ML method (called NTF k ) using Non-negative Tensor Factorization (NTF) coupled with a custom clustering procedure based on k-means to reveal the temporal and spatial features in product concentrations. An attractive and unique aspect of the proposed ML method is that it ensures the extracted features are non-negative, which is important to obtain a meaningful deconstruction of the mixing processes. The ML methodology is applied to a large set of high-resolution finite-element model simulations representing anisotropic reaction-diffusion processes in perturbed vortex-based velocity fields. The applied finite-element method ensures that spatial and temporal species concentration are always non-negative, even in the case of high anisotropic contrasts. The simulated reaction is a fast irreversible bimolecular reaction A+B→C , where species A and B react to form species C. The reactive-diffusion model input parameters that control mixing include properties of the velocity field (such as vortex structures), anisotropic dispersion, and molecular diffusion. We demonstrate the applicability of the ML feature extraction method to produce a meaningful deconstruction of model outputs to discriminate between different physical processes impacting the reactants, their mixing, and the spatial distribution of the product C. The introduced ML analysis allowed us to identify additive temporal and spatial features that characterize mixing behavior. The application of the proposed NTF k approach is not limited to reactive-mixing. NTFk can be readily applied to any observed or simulated datasets that can be represented as tensors (multi-dimensional arrays) and have separable latent signatures or features.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Tensor factorization for elucidating mechanisms of piezoresponse relaxation via dynamic Piezoresponse Force Spectroscopy

Spatially resolved time and voltage-dependent polarization dynamics in PbTiO 3 thin films is explored using dynamic piezoresponse force microscopy (D-PFM) in conjunction with interferometric displacement sensing. This approach gives rise to 4D data sets containing information on bias-dependent relaxation dynamics at each spatial location without long-range electrostatic artifacts. To interpret these data sets in the absence of defined physical models, we employ a non-negative tensor factorization method which clearly presents the data as a product of simple behaviors allowing for direct physics interpretation. Correspondingly, we perform phase-field modeling finding the existence of ‘hard’ and ‘soft’ domain wall edges. This approach can be extended to other multidimensional spectroscopies for which even exploratory data analysis leads to unsatisfactory results due to many components in the decomposition.

36 MATERIALS SCIENCE↗
DOE OSTI2025

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

We establish parameter inference for the Poisson canonical polyadic (PCP) tensor model through a latent-variable formulation. Our approach exploits the observation that any random PCP tensor can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the “complete” loglikelihood, is comprised of multiple rank one PCP loglikelihoods. Using this methodology, we first derive maximum likelihood estimators for the PCP model and demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that tensor rank plays in identifiability and indeterminacy. For the special case of rank one PCP models, we demonstrate that these results are greatly simplified.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Determination of latent dimensionality in international trade flow

Currently, high-dimensional data is ubiquitous in data science, which necessitates the development of techniques to decompose and interpret such multidimensional (aka tensor) datasets. Finding a low dimensional representation of the data, that is, its inherent structure, is one of the approaches that can serve to understand the dynamics of low dimensional latent features hidden in the data. Moreover, decomposition methods with non-negative constraints are shown to extract more insightful factors. Nonnegative RESCAL is one such technique, particularly well suited to analyze self-relational data, such as dynamic networks found in international trade flows. Particularly, non-negative RESCAL computes a low dimensional tensor representation by finding the latent space containing multiple modalities. Furthermore, estimating the dimensionality of this latent space is crucial for extracting meaningful latent features. Here, to determine the dimensionality of the latent space with non-negative RESCAL, we propose a latent dimension determination method which is based on clustering of the solutions of multiple realizations of non-negative RESCAL decompositions. We demonstrate the performance of our model selection method on synthetic data. We then apply our method to decompose a network of international trade flows data from International Monetary Fund and shows that with a correct latent dimension determination, the resulting features are able to capture relevant empirical facts from economic literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗
DOE OSTI2023

Distributed out-of-memory NMF on CPU/GPU architectures

We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density 10 -6 .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Exploration of Electrochemical Reactions at Organic–Inorganic Halide Perovskite Interfaces via Machine Learning in In Situ Time-of-Flight Secondary Ion Mass Spectrometry

The instability of hybrid organic–inorganic perovskite (HOIP) devices is one of the significant challenges preventing commercialization. Exploring these phenomena is severely limited by the complexity of the intrinsic electrochemistry of HOIPs, the presence of multiple volatile and mobile ionic species, and the possible role of environmentally induced reactions at surfaces and triple-phase junctions. Here, in situ studies of the electrochemistry of methylammonium lead bromide perovskite with the Au electrode interface are reported via light- and voltage-dependent time-of-flight secondary ion mass spectrometry (ToF-SIMS) imaging of lateral perovskite heterostructures. While ToF-SIMS allows for the visualization of the chemical composition along the surface and its evolution with light and electrical bias, the interpretation of the multidimensional data obtained is often limited due to strong correlations between chemical signatures and the need to track multiple peaks at once. Here, a machine learning workflow combining the Hough transform and non-negative matrix factorization and no-negative tensor decomposition is developed to avoid this limitation and extract salient features of associated chemical changes and to separate the light- and voltage-dependent dynamics. Finally, combining these in situ characterizations and the machine learning workflow provides comprehensive information on the chemical nature of moving species, ion accumulation, and interfacial electrochemical reactions in HOIP devices.

36 MATERIALS SCIENCE↗