DeepAI AI Chat
Log In Sign Up

Learning the Sparse and Low Rank PARAFAC Decomposition via the Elastic Net

by   Songting Shi, et al.
Harvard University
Peking University

In this article, we derive a Bayesian model to learning the sparse and low rank PARAFAC decomposition for the observed tensor with missing values via the elastic net, with property to find the true rank and sparse factor matrix which is robust to the noise. We formulate efficient block coordinate descent algorithm and admax stochastic block coordinate descent algorithm to solve it, which can be used to solve the large scale problem. To choose the appropriate rank and sparsity in PARAFAC decomposition, we will give a solution path by gradually increasing the regularization to increase the sparsity and decrease the rank. When we find the sparse structure of the factor matrix, we can fixed the sparse structure, using a small to regularization to decreasing the recovery error, and one can choose the proper decomposition from the solution path with sufficient sparse factor matrix with low recovery error. We test the power of our algorithm on the simulation data and real data, which show it is powerful.


page 27

page 29

page 33

page 34


Tensor vs Matrix Methods: Robust Tensor Decomposition under Block Sparse Perturbations

Robust tensor CP decomposition involves decomposing a tensor into low ra...

Sparse Nonnegative CANDECOMP/PARAFAC Decomposition in Block Coordinate Descent Framework: A Comparison Study

Nonnegative CANDECOMP/PARAFAC (NCP) decomposition is an important tool t...

Low-Rank Matrix Recovery from Noisy via an MDL Framework-based Atomic Norm

The recovery of the underlying low-rank structure of clean data corrupte...

Rank-One Measurements of Low-Rank PSD Matrices Have Small Feasible Sets

We study the role of the constraint set in determining the solution to l...

Fast and Robust Fixed-Rank Matrix Recovery

We address the problem of efficient sparse fixed-rank (S-FR) matrix deco...

Pursuit of Low-Rank Models of Time-Varying Matrices Robust to Sparse and Measurement Noise

In tracking of time-varying low-rank models of time-varying matrices, we...