Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations
- Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Northwestern Univ., Evanston, IL (United States)
Tensor factorizations with nonnegativity constraints have found application in analysing data from cyber traffic, social networks, and other areas. We consider application data best described as being generated by a Poisson process (e.g. count data), which leads to sparse tensors that can be modelled by sparse factor matrices. In this paper, we investigate efficient techniques for computing an appropriate canonical polyadic tensor factorization based on the Kullback–Leibler divergence function. We propose novel subproblem solvers within the standard alternating block variable approach. Our new methods exploit structure and reformulate the optimization problem as small independent subproblems. We employ bound-constrained Newton and quasi-Newton methods. Finally, we compare our algorithms against other codes, demonstrating superior speed for high accuracy results and the ability to quickly find sparse solutions.
- Research Organization:
- Sandia National Lab. (SNL-CA), Livermore, CA (United States)
- Sponsoring Organization:
- Work for Others (WFO)
- Grant/Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1182987
- Report Number(s):
- SAND-2014-16243J; 533741
- Journal Information:
- Optimization Methods and Software, Vol. 30, Issue 5; ISSN 1055-6788
- Publisher:
- Taylor & FrancisCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization
|
journal | March 2018 |
PASTA: a parallel sparse tensor algorithm benchmark suite
|
journal | August 2019 |
Tensors for Data Mining and Data Fusion: Models, Applications, and Scalable Algorithms
|
journal | January 2017 |
A Tensor CP Decomposition Method for Clustering Heterogeneous Information Networks via Stochastic Gradient Descent Algorithms
|
journal | January 2017 |
Similar Records
Parameter Sensitivity Analysis of the SparTen High Performance Sparse Tensor Decomposition Software (Extended Analysis)
Generalized Canonical Polyadic Tensor Decomposition