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

Naoki Yoshida, Sumio Watanabe
3/10/2023
cs.LGmath.STstat.ML

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{yoshida2023upper,
  title  = {Upper Bound of Real Log Canonical Threshold of Tensor Decomposition and its Application to Bayesian Inference},
  author = {Naoki Yoshida and Sumio Watanabe},
  year   = {2023},
  eprint = {2303.05731},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.05731v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.05731.svg)](https://codeofpaper.com/paper/2303.05731)

Discussion