Upper Bound of Real Log Canonical Threshold of Tensor Decomposition and its Application to Bayesian Inference

03/10/2023
by   Naoki Yoshida, et al.
0

Tensor decomposition is now being used for data analysis, information compression, and knowledge recovery. However, the mathematical property of tensor decomposition is not yet fully clarified because it is one of singular learning machines. In this paper, we give the upper bound of its real log canonical threshold (RLCT) of the tensor decomposition by using an algebraic geometrical method and derive its Bayesian generalization error theoretically. We also give considerations about its mathematical property through numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2021

A recursive eigenspace computation for the Canonical Polyadic decomposition

The canonical polyadic decomposition (CPD) is a compact decomposition wh...
research
02/23/2022

Canonical Polyadic Decomposition via the generalized Schur decomposition

The canonical polyadic decomposition (CPD) is a fundamental tensor decom...
research
11/15/2022

Adaptive Embedding for Temporal Network

Temporal network has become ubiquitous with the rise of online social pl...
research
05/21/2022

Tensor Shape Search for Optimum Data Compression

Various tensor decomposition methods have been proposed for data compres...
research
12/31/2019

Bayesian Generalization Error of Poisson Mixture and Simplex Vandermonde Matrix Type Singularity

A Poisson mixture is one of the practically important models in computer...
research
06/22/2021

Lower and Upper Bounds on the VC-Dimension of Tensor Network Models

Tensor network methods have been a key ingredient of advances in condens...
research
03/14/2022

Asymptotic Behavior of Bayesian Generalization Error in Multinomial Mixtures

Multinomial mixtures are widely used in the information engineering fiel...

Please sign up or login with your details

Forgot password? Click here to reset