PofoliaShared via Pofolia

IEEE Transactions on Neural Networks and Learning Systems· 2015Q1

Bayesian Robust Tensor Factorization for Incomplete Multiway Data

Qibin Zhao, Guoxu Zhou, Liqing Zhang, Andrzej Cichocki et al.

Short summary

A new Bayesian tensor factorization method robustly handles missing data and outliers by simultaneously inferring a low-rank tensor for global information and a sparse tensor for local outliers.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Proposes a Bayesian generative model for tensor factorization that simultaneously models a low-rank tensor (global info) and a sparse tensor (outliers).
  • Uses hierarchical priors and a Student-t distribution for modeling latent factors and sparse components.
  • Employs efficient variational inference for fully Bayesian learning, preventing overfitting and scaling linearly with data size.
  • Achieves automatic model selection (e.g., CP rank) and outlier adaptation without parameter tuning.

AI-generated from the title and abstract; the full text is not read.

Abstract

We propose a generative model for robust tensor factorization in the presence of both missing data and outliers. The objective is to explicitly infer the underlying low-CANDECOMP/PARAFAC (CP)-rank tensor capturing the global information and a sparse tensor capturing the local information (also considered as outliers), thus providing the robust predictive distribution over missing entries. The low-CP-rank tensor is modeled by multilinear interactions between multiple latent factors on which the column sparsity is enforced by a hierarchical prior, while the sparse tensor is modeled by a hierarchical view of Student-t distribution that associates an individual hyperparameter with each element independently. For model learning, we develop an efficient variational inference under a fully Bayesian treatment, which can effectively prevent the overfitting problem and scales linearly with data size. In contrast to existing related works, our method can perform model selection automatically and implicitly without the need of tuning parameters. More specifically, it can discover the groundtruth of CP rank and automatically adapt the sparsity inducing priors to various types of outliers. In addition, the tradeoff between the low-rank approximation and the sparse representation can be optimized in the sense of maximum model evidence. The extensive experiments and comparisons with many state-of-the-art algorithms on both synthetic and real-world data sets demonstrate the superiorities of our method from several perspectives.

The authors' abstract, as published at the source. IEEE Transactions on Neural Networks and Learning Systems, 2015 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Computational Mathematics

Computational MathematicsMathematics