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

Stochastic Gradients for Large-Scale Tensor Decomposition

Journal Article · · SIAM Journal on Mathematics of Data Science
DOI:https://doi.org/10.1137/19m1266265· OSTI ID:1738932
 [1];  [2]
  1. Sandia National Lab. (SNL-CA), Livermore, CA (United States)
  2. Univ. of Michigan, Ann Arbor, MI (United States)

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of loss functions such as Bernoulli loss for binary data or Huber loss for robust estimation. Here, the stochastic gradient is formed from randomly sampled elements of the tensor and is efficient because it can be computed using the sparse matricized-tensor times Khatri--Rao product tensor kernel. For dense tensors, we simply use uniform sampling. For sparse tensors, we propose two types of stratified sampling that give precedence to sampling nonzeros. Numerical results demonstrate the advantages of the proposed approach and its scalability to large-scale problems.

Research Organization:
Sandia National Laboratories (SNL-CA), Livermore, CA (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1738932
Alternate ID(s):
OSTI ID: 1767900
Report Number(s):
SAND--2020-13780J; 692878
Journal Information:
SIAM Journal on Mathematics of Data Science, Journal Name: SIAM Journal on Mathematics of Data Science Journal Issue: 4 Vol. 2; ISSN 2577-0187
Publisher:
Society for Industrial and Applied Mathematics (SIAM)Copyright Statement
Country of Publication:
United States
Language:
English

References (26)

On the performance of gas sensor arrays in open sampling systems using Inhibitory Support Vector Machines journal August 2013
Correcting systematic effects in a large set of photometric light curves journal February 2005
A Practical Randomized CP Tensor Decomposition journal January 2018
A scalable optimization approach for fitting canonical tensor decompositions journal January 2011
Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition journal September 1970
Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm journal February 2015
Positive tensor factorization journal October 2001
Scalable tensor factorizations for incomplete data journal March 2011
Statistically weighted principal component analysis of rapid scanning wavelength kinetics experiments journal May 1977
Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations journal February 2015
Analysis of longitudinal metabolomics data journal April 2004
A Randomized Block Sampling Approach to Canonical Polyadic Decomposition of Large-Scale Tensors journal March 2016
Matrix Factorization Techniques for Recommender Systems journal August 2009
Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor journal June 2009
Fast Alternating LS Algorithms for High Order CANDECOMP/PARAFAC Tensor Factorizations journal October 2013
Subspace Learning and Imputation for Streaming Big Data Matrices and Tensors journal May 2015
Efficient MATLAB Computations with Sparse and Factored Tensors journal January 2008
Tensor Decompositions and Applications journal August 2009
A Limited Memory Algorithm for Bound Constrained Optimization journal September 1995
On Tensors, Sparsity, and Nonnegative Factorizations journal January 2012
A Scalable Generative Graph Model with Community Structure journal January 2014
A Practical Randomized CP Tensor Decomposition journal January 2018
Generalized Canonical Polyadic Tensor Decomposition journal January 2020
Software for Sparse Tensor Decomposition on Emerging Computing Architectures journal January 2019
Computational Advertising: Techniques for Targeting Relevant Ads journal January 2014
Generalized Low Rank Models journal January 2016

Cited By (1)


Similar Records

GentenMPI: Distributed Memory Sparse Tensor Decomposition
Technical Report · Sat Aug 01 00:00:00 EDT 2020 · OSTI ID:1656940

Streaming Generalized Canonical Polyadic Tensor Decompositions
Technical Report · Fri Oct 01 00:00:00 EDT 2021 · OSTI ID:1832304

Software for Sparse Tensor Decomposition on Emerging Computing Architectures
Journal Article · Thu Jun 20 00:00:00 EDT 2019 · SIAM Journal on Scientific Computing · OSTI ID:1542146