Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization

IF 1.4 2区 数学 Q1 MATHEMATICS
Calcolo Pub Date : 2024-03-04 DOI:10.1007/s10092-024-00569-1
Rong Li, Bing Zheng
{"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.

Abstract Image

通过具有总变异正则化的多向部分张量核规范实现张量补全
本文探讨了张量补全问题,其任务是用有限的信息估计缺失值。然而,这个问题的关键在于如何合理地表示基础数据中蕴含的低秩结构。在这项工作中,我们考虑了一种新的低秩张量补全模型,并将其与多向部分张量核规范和总变异(TV)正则化相结合。具体来说,我们使用张量核规范部分和(PSTNN)来缩小张量管秩与其下凸包络[即张量核规范(TNN)]之间的差距,并采用 TV 正则化来保持空间维度上的平滑结构。此外,我们还引入了张量核规范加权和(WSTNN)来替代传统的 TNNN,将 PSTNN 扩展到高阶张量,它还能灵活处理不同模式下的不同相关性,从而改进了低 d-管阶近似。为了解决这个新模型,我们开发了针对所提优化问题的交替定向乘法(ADMM)算法。我们对 ADMM 算法进行了理论分析,证明了 Karush-Kuhn-Tucker (KKT) 条件。数值实例表明,所提出的方法在定性和定量方面都优于一些最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Calcolo
Calcolo 数学-数学
CiteScore
2.40
自引率
11.80%
发文量
36
审稿时长
>12 weeks
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信