paper-with-me

홈 › Papers

Robust low-rank multilinear tensor approximation for a joint estimation of the multilinear rank and the loading matrices

2018-11-14 · Xu Han, Laurent Albera, Amar Kachenoura, Huazhong Shu, Lotfi Senhadji

In order to compute the best low-rank tensor approximation using the Multilinear Tensor Decomposition (MTD) model, it is essential to estimate the rank of the underlying multilinear tensor from the noisy observation tensor. In this paper, we propose a Robust MTD (R-MTD) method, which jointly estimates the multilinear rank and the loading matrices. Based on the low-rank property and an over-estimation of the core tensor, this joint estimation problem is solved by promoting (group) sparsity of the over-estimated core tensor. Group sparsity is promoted using mixed-norms. Then we establish a link between the mixed-norms and the nuclear norm, showing that mixed-norms are better candidates for a convex envelope of the rank. After several iterations of the Alternating Direction Method of Multipliers (ADMM), the Minimum Description Length (MDL) criterion computed from the eigenvalues of the unfolding matrices of the estimated core tensor is minimized in order to estimate the multilinear rank. The latter is then used to estimate more accurately the loading matrices. We further develop another R-MTD method, called R-OMTD, by imposing an orthonormality constraint on each loading matrix in order to decrease the computation complexity. A series of simulated noisy tensor and real-world data are used to show the effectiveness of the proposed methods compared with state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:1811.05863

Code (0)

등록된 구현이 없습니다.

Tasks

Tensor Decomposition

Similar Papers 제목 키워드 기반

A Random Matrix Approach to Low-Multilinear-Rank Tensor Approximation

2024-02-05 · Hugo Lebeau, Florent Chatelain, Romain Couillet

This work presents a comprehensive understanding of the estimation of a planted low-rank signal from a general spiked tensor model near the computational threshold. Relying on standard tools from the theory of large rand…

Mode-wise Tensor Decompositions: Multi-dimensional Generalizations of CUR Decompositions

2021-03-19 · HanQin Cai, Keaton Hamm, Longxiu Huang, Deanna Needell

Low rank tensor approximation is a fundamental tool in modern machine learning and data science. In this paper, we study the characterization, perturbation analysis, and an efficient sampling strategy for two primary ten…

Efficient Alternating Least Squares Algorithms for Low Multilinear Rank Approximation of Tensors

2020-04-06 · Chuanfu Xiao, Chao Yang, Min Li

The low multilinear rank approximation, also known as the truncated Tucker decomposition, has been extensively utilized in many applications that involve higher-order tensors. Popular methods for low multilinear rank app…

Tensor Denoising via Amplification and Stable Rank Methods

2023-01-10 · Jonathan Gryak, Kayvan Najarian, Harm Derksen

Tensors in the form of multilinear arrays are ubiquitous in data science applications. Captured real-world data, including video, hyperspectral images, and discretized physical systems, naturally occur as tensors and oft…

DenoisingTensor Decomposition

Multilinear Low-Rank Tensors on Graphs & Applications

2016-11-15 · Nauman Shahid, Francesco Grassi, Pierre Vandergheynst

We propose a new framework for the analysis of low-rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which ap…

EEGElectroencephalogram (EEG)