paper-with-me

Papers

On The Synergy Between Nonconvex Extensions of The Tensor Nuclear Norm for Tensor Recovery

2020-09-08 · Kaito Hosono, Shunsuke Ono, Takamichi Miyata

Low-rank tensor recovery has attracted much attention among various tensor recovery approaches. A tensor rank has several definitions, unlike the matrix rank--e.g. the CP rank and the Tucker rank. Many low-rank tensor recovery methods are focused on the Tucker rank. Since the Tucker rank is nonconvex and discontinuous, many relaxations of the Tucker rank have been proposed, e.g., the tensor nuclear norm, weighted tensor nuclear norm, and weighted tensor Schatten-$p$ norm. In particular, the weighted tensor Schatten-p norm has two parameters, the weight and $p$, and the tensor nuclear norm and weighted tensor nuclear norm are special cases of these parameters. However, there has been no detailed discussion of whether the effects of the weighting and $p$ are synergistic. In this paper, we propose a novel low-rank tensor completion model using the weighted tensor Schatten-$p$ norm to reveal the relationships between the weight and $p$. To clarify whether complex methods such as the weighted tensor Schatten-$p$ norm are necessary, we compare them with a simple method using rank-constrained minimization. It was found that the simple methods did not outperform the complex methods unless the rank of the original tensor could be accurately known. If we can obtain the ideal weight, $p = 1$ is sufficient, although it is necessary to set $p<1$ when using the weights obtained from observations. These results are consistent with existing reports.

📄 PDF Abstract BibTeX arXiv:2009.03503

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

TuckER TuckER

Similar Papers 제목 키워드 기반

Low-Rank Tensor Learning by Generalized Nonconvex Regularization

2024-10-24 · Sijia Xia, Michael K. Ng, Xiongjun Zhang

In this paper, we study the problem of low-rank tensor learning, where only a few of training samples are observed and the underlying tensor has a low-rank structure. The existing methods are based on the sum of nuclear …

Binary Classification

Low-rank Tensor Learning with Nonconvex Overlapped Nuclear Norm Regularization

2022-05-06 · Quanming Yao, Yaqing Wang, Bo Han, James Kwok

Nonconvex regularization has been popularly used in low-rank matrix learning. However, extending it for low-rank tensor learning is still computationally expensive. To address this problem, we develop an efficient solver…

Tensor p-shrinkage nuclear norm for low-rank tensor completion

2019-07-09 · Chunsheng Liu, Hong Shan, Chunlei Chen

In this paper, a new definition of tensor p-shrinkage nuclear norm (p-TNN) is proposed based on tensor singular value decomposition (t-SVD). In particular, it can be proved that p-TNN is a better approximation of the ten…

Generalized Nonconvex Approach for Low-Tubal-Rank Tensor Recovery

2022-08-04 · IEEE Transactions on Neural Networks and Learning Systems 2022 8 · Hailin Wang, Feng Zhang, Jianjun Wang, TingWen Huang 외

The tensor-tensor product-induced tensor nuclear norm (t-TNN) (Lu et al., 2020) minimization for low-tubal-rank tensor recovery attracts broad attention recently. However, minimizing the t-TNN faces some drawbacks. For e…

Image InpaintingLow-Rank Matrix Completion

Low-Rank Tensor Completion Based on Fractional Regularization with Ky Fan p-k Norm

2026-06-17 · Shan Fan, Feng Zhang, Jianjun Wang, Xi-Le Zhao 외 arxiv

This paper addresses low-rank tensor completion (LRTC) by proposing a novel nonconvex surrogate, namely the ratio of the tensor nuclear norm to the tensor Ky Fan p-k norm (TNPK), to accurately approximate the tensor tuba…