Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC

Journal Article · · Numerical Linear Algebra with Applications
DOI:https://doi.org/10.1002/nla.2443· OSTI ID:1864617
 [1];  [2];  [1];  [2]
  1. Theoretical Division Los Alamos National Laboratory Los Alamos New Mexico USA
  2. Computer, Computational and Statistical Sciences (CCS) Division Los Alamos National Laboratory Los Alamos New Mexico USA
Abstract

There is an emerging interest for tensor factorization applications in big‐data analytics and machine learning. To speed up the factorization of extra‐large datasets, organized in multidimensional arrays (also known as tensors), easy to compute compression‐based tensor representations, such as, Tucker and tensor train formats, are used to approximate the initial large‐tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, often additional constraints need to be imposed, which lead us to canonical decomposition with linear constraints (CANDELINC), a canonical polyadic decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a preprocessing step, which lead to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank of a tensor to its Tucker core and comparing the real valued to nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real‐world examples.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE; USDOE Laboratory Directed Research and Development (LDRD) Program; USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
89233218CNA000001
OSTI ID:
1864617
Alternate ID(s):
OSTI ID: 2007354
OSTI ID: 1996065
Report Number(s):
LA-UR--21-26100; e2443
Journal Information:
Numerical Linear Algebra with Applications, Journal Name: Numerical Linear Algebra with Applications Journal Issue: 6 Vol. 29; ISSN 1070-5325
Publisher:
Wiley Blackwell (John Wiley & Sons)Copyright Statement
Country of Publication:
United Kingdom
Language:
English

References (24)

Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-Way Data Analysis and Blind Source Separation book September 2009
Modeling multi-way data with linearly dependent loadings journal July 2009
Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers
  • Alexandrov, Boian S.; Stanev, Valentin G.; Vesselinov, Velimir V.
  • Statistical Analysis and Data Mining: The ASA Data Science Journal, Vol. 12, Issue 4 https://doi.org/10.1002/sam.11407
journal February 2019
The Expression of a Tensor or a Polyadic as a Sum of Products journal April 1927
Tensor Spaces and Numerical Tensor Calculus book February 2012
Some mathematical notes on three-mode factor analysis journal September 1966
Candelinc: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters journal March 1980
Tensor rank is NP-complete book January 1989
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics journal January 1977
Nonnegative ranks, decompositions, and factorizations of nonnegative matrices journal September 1993
Improving the speed of multiway algorithms journal August 1998
A comparison of algorithms for fitting the PARAFAC model journal April 2006
Learning the parts of objects by non-negative matrix factorization journal October 1999
Tensors : A brief introduction journal May 2014
Statistical Inference, Learning and Models in Big Data journal June 2016
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem journal January 2008
Tensor Decompositions and Applications journal August 2009
Tensor-Train Decomposition journal January 2011
On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix journal January 2013
Semialgebraic Geometry of Nonnegative Tensor Rank journal January 2016
A Practical Randomized CP Tensor Decomposition journal January 2018
Compressed Sensing PARALIND Decomposition-Based Coherent Angle Estimation for Uniform Rectangular Array journal June 2019
Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives journal January 2016
A Very Brief Introduction to Nonnegative Tensors from the Geometric Viewpoint journal October 2018