{"title":"Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization","authors":"Rong Li, Bing Zheng","doi":"10.1007/s10092-024-00569-1","DOIUrl":null,"url":null,"abstract":"<p>This paper addresses the tensor completion problem, whose task is to estimate missing values with limited information. However, the crux of this problem is how to reasonably represent the low-rank structure embedded in the underlying data. In this work, we consider a new low-rank tensor completion model combined with the multi-directional partial tensor nuclear norm and the total variation (TV) regularization. Specifically, the partial sum of the tensor nuclear norm (PSTNN) is used to narrow the gap between the tensor tubal rank and its lower convex envelop [i.e. tensor nuclear norm (TNN)], and the TV regularization is adopted to maintain the smooth structure along the spatial dimension. In addition, the weighted sum of the tensor nuclear norm (WSTNN) is introduced to replace the traditional TNN to extend the PSTNN to the high-order tensor, which also can flexibly handle different correlations along different modes, resulting in an improved low <i>d</i>-tubal rank approximation. To tackle this new model, we develop the alternating directional method of multipliers (ADMM) algorithm tailored for the proposed optimization problem. Theoretical analysis of the ADMM is conducted to prove the Karush–Kuhn–Tucker (KKT) conditions. Numerical examples demonstrate the proposed method outperforms some state-of-the-art methods in qualitative and quantitative aspects.</p>","PeriodicalId":9522,"journal":{"name":"Calcolo","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Calcolo","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10092-024-00569-1","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper addresses the tensor completion problem, whose task is to estimate missing values with limited information. However, the crux of this problem is how to reasonably represent the low-rank structure embedded in the underlying data. In this work, we consider a new low-rank tensor completion model combined with the multi-directional partial tensor nuclear norm and the total variation (TV) regularization. Specifically, the partial sum of the tensor nuclear norm (PSTNN) is used to narrow the gap between the tensor tubal rank and its lower convex envelop [i.e. tensor nuclear norm (TNN)], and the TV regularization is adopted to maintain the smooth structure along the spatial dimension. In addition, the weighted sum of the tensor nuclear norm (WSTNN) is introduced to replace the traditional TNN to extend the PSTNN to the high-order tensor, which also can flexibly handle different correlations along different modes, resulting in an improved low d-tubal rank approximation. To tackle this new model, we develop the alternating directional method of multipliers (ADMM) algorithm tailored for the proposed optimization problem. Theoretical analysis of the ADMM is conducted to prove the Karush–Kuhn–Tucker (KKT) conditions. Numerical examples demonstrate the proposed method outperforms some state-of-the-art methods in qualitative and quantitative aspects.
期刊介绍:
Calcolo is a quarterly of the Italian National Research Council, under the direction of the Institute for Informatics and Telematics in Pisa. Calcolo publishes original contributions in English on Numerical Analysis and its Applications, and on the Theory of Computation.
The main focus of the journal is on Numerical Linear Algebra, Approximation Theory and its Applications, Numerical Solution of Differential and Integral Equations, Computational Complexity, Algorithmics, Mathematical Aspects of Computer Science, Optimization Theory.
Expository papers will also appear from time to time as an introduction to emerging topics in one of the above mentioned fields. There will be a "Report" section, with abstracts of PhD Theses, news and reports from conferences and book reviews. All submissions will be carefully refereed.