Approximate Rank-Detecting Factorization of Low-Rank Tensors

11/30/2012
by   Franz J Király, et al.
0

We present an algorithm, AROFAC2, which detects the (CP-)rank of a degree 3 tensor and calculates its factorization into rank-one components. We provide generative conditions for the algorithm to work and demonstrate on both synthetic and real world data that AROFAC2 is a potentially outperforming alternative to the gold standard PARAFAC over which it has the advantages that it can intrinsically detect the true rank, avoids spurious components, and is stable with respect to outliers and non-Gaussian noise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2017

A General Model for Robust Tensor Factorization with Unknown Noise

Because of the limitations of matrix factorization, such as losing spati...
research
05/19/2023

A Novel Tensor Factorization-Based Method with Robustness to Inaccurate Rank Estimation

This study aims to solve the over-reliance on the rank estimation strate...
research
09/17/2019

Nonnegative Canonical Polyadic Decomposition with Rank Deficient Factors

Recently, there is an emerging interest for applications of tensor facto...
research
10/09/2014

Bayesian Robust Tensor Factorization for Incomplete Multiway Data

We propose a generative model for robust tensor factorization in the pre...
research
05/21/2019

Time-varying Autoregression with Low Rank Tensors

We present a windowed technique to learn parsimonious time-varying autor...
research
03/18/2021

Generalized infinite factorization models

Factorization models express a statistical object of interest in terms o...
research
04/20/2023

Hotelling Deflation on Large Symmetric Spiked Tensors

This paper studies the deflation algorithm when applied to estimate a lo...

Please sign up or login with your details

Forgot password? Click here to reset