Legendre Tensor Decomposition

02/13/2018
by   Mahito Sugiyama, et al.
0

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and always minimizes the KL divergence from an input tensor. We empirically show that Legendre decomposition can more accurately reconstruct tensors than nonnegative CP and Tucker decompositions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2021

Characterization of Decomposition of Matrix Multiplication Tensors

In this paper, the canonical polyadic (CP) decomposition of tensors that...
research
10/27/2021

Nonnegative Tucker Decomposition with Beta-divergence for Music Structure Analysis of audio signals

Nonnegative Tucker Decomposition (NTD), a tensor decomposition model, ha...
research
01/12/2018

A unifying Perron-Frobenius theorem for nonnegative tensors via multi-homogeneous maps

Inspired by the definition of symmetric decomposition, we introduce the ...
research
11/03/2022

Bayesian methods of vector autoregressions with tensor decompositions

Vector autoregressions (VARs) are popular in analyzing economic time ser...
research
10/27/2022

Computing the extremal nonnegative solutions of the M-tensor equation with a nonnegative right side vector

We consider the tensor equation whose coefficient tensor is a nonsingula...
research
07/25/2023

Strivec: Sparse Tri-Vector Radiance Fields

We propose Strivec, a novel neural representation that models a 3D scene...
research
05/22/2021

Tensor products of coherent configurations

A Cartesian decomposition of a coherent configuration X is defined as a ...

Please sign up or login with your details

Forgot password? Click here to reset