A Closed Form Solution to Best Rank-1 Tensor Approximation via KL divergence Minimization

03/04/2021
by   Kazu Ghalamkari, et al.
0

Tensor decomposition is a fundamentally challenging problem. Even the simplest case of tensor decomposition, the rank-1 approximation in terms of the Least Squares (LS) error, is known to be NP-hard. Here, we show that, if we consider the KL divergence instead of the LS error, we can analytically derive a closed form solution for the rank-1 tensor that minimizes the KL divergence from a given positive tensor. Our key insight is to treat a positive tensor as a probability distribution and formulate the process of rank-1 approximation as a projection onto the set of rank-1 tensors. This enables us to solve rank-1 approximation by convex optimization. We empirically demonstrate that our algorithm is an order of magnitude faster than the existing rank-1 approximation methods and gives better approximation of given tensors, which supports our theoretical finding.

READ FULL TEXT
research
09/25/2017

Best Rank-One Tensor Approximation and Parallel Update Algorithm for CPD

A novel algorithm is proposed for CANDECOMP/PARAFAC tensor decomposition...
research
09/30/2022

Many-Body Approximation for Tensors

We propose a nonnegative tensor decomposition with focusing on the relat...
research
11/21/2017

Kullback-Leibler Principal Component for Tensors is not NP-hard

We study the problem of nonnegative rank-one approximation of a nonnegat...
research
10/16/2022

Finding the smallest or largest element of a tensor from its low-rank factors

We consider the problem of finding the smallest or largest entry of a te...
research
09/05/2020

Towards Probabilistic Tensor Canonical Polyadic Decomposition 2.0: Automatic Tensor Rank Learning Using Generalized Hyperbolic Prior

Tensor rank learning for canonical polyadic decomposition (CPD) has long...
research
01/19/2016

A Closed-Form Solution to Tensor Voting: Theory and Applications

We prove a closed-form solution to tensor voting (CFTV): given a point s...
research
09/25/2017

Error Preserving Correction for CPD and Bounded-Norm CPD

In CANDECOMP/PARAFAC tensor decomposition, degeneracy often occurs in so...

Please sign up or login with your details

Forgot password? Click here to reset