paper-with-me

홈 › Papers

Statistical Performance of Convex Tensor Decomposition

2011-12-01 · NeurIPS 2011 12 · Ryota Tomioka, Taiji Suzuki, Kohei Hayashi, Hisashi Kashima

We analyze the statistical performance of a recently proposed convex tensor decomposition algorithm. Conventionally tensor decomposition has been formulated as non-convex optimization problems, which hindered the analysis of their performance. We show under some conditions that the mean squared error of the convex method scales linearly with the quantity we call the normalized rank of the true tensor. The current analysis naturally extends the analysis of convex low-rank matrix estimation to tensors. Furthermore, we show through numerical experiments that our theory can precisely predict the scaling behaviour in practice.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Tensor Decomposition

Similar Papers 제목 키워드 기반

On Tensor Train Rank Minimization : Statistical Efficiency and Scalable Algorithm

2017-12-01 · NeurIPS 2017 12 · Masaaki Imaizumi, Takanori Maehara, Kohei Hayashi

Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: …

On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm

2017-08-01 · Masaaki Imaizumi, Takanori Maehara, Kohei Hayashi

Tensor train (TT) decomposition provides a space-efficient representation for higher-order tensors. Despite its advantage, we face two crucial limitations when we apply the TT decomposition to machine learning problems: …

Robust Tensor Decomposition with Gross Corruption

2014-12-01 · NeurIPS 2014 12 · Quanquan Gu, Huan Gui, Jiawei Han

In this paper, we study the statistical performance of robust tensor decomposition with gross corruption. The observations are noisy realization of the superposition of a low-rank tensor $\mathcal{W}^*$ and an entrywise …

Tensor Decomposition

Low-Rank Approximation and Completion of Positive Tensors

2014-12-01 · Anil Aswani

Unlike the matrix case, computing low-rank approximations of tensors is NP-hard and numerically ill-posed in general. Even the best rank-1 approximation of a tensor is NP-hard. In this paper, we use convex optimization t…

Tensor Decomposition

Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements

2021-04-29 · Tian Tong, Cong Ma, Ashley Prater-Bennette, Erin Tripp 외

Tensors, which provide a powerful and flexible model for representing multi-attribute data and multi-way interactions, play an indispensable role in modern data science across various fields in science and engineering. A…

Attribute