HIGH-ORDER TENSOR COMPLETION FOR DATA RECOVERY VIA SPARSE TENSOR-TRAIN OPTIMIZATION

被引:0
|
作者
Yuan, Longhao [1 ,2 ]
Zhao, Qibin [2 ,3 ]
Cao, Jianting [1 ,4 ]
机构
[1] Saitama Inst Technol, Grad Sch Engn, Fukaya, Japan
[2] Ctr Adv Intelligence Project AIP, RIKEN, Tensor Learning Unit, Tokyo, Japan
[3] Guangdong Univ Technol, Sch Automat, Guangzhou, Guangdong, Peoples R China
[4] Hangzhou Dianzi Univ, Sch Comp Sci & Technol, Hangzhou, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
incomplete data; tensor completion; tensor-train decomposition; tensorization; optimization;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
In this paper, we aim at the problem of tensor data completion. Tensor-train decomposition is adopted because of its powerful representation ability and linear scalability to tensor order. We propose an algorithm named Sparse Tensortrain Optimization (STTO) which considers incomplete data as sparse tensor and uses first-order optimization method to find the factors of tensor-train decomposition. Our algorithm is shown to perform well in simulation experiments at both low-order cases and high-order cases. We also employ a tensorization method to transform data to a higher-order form to enhance the performance of our algorithm. The results of image recovery experiments in various cases manifest that our method outperforms other completion algorithms. Especially when the missing rate is very high, e.g., 90% to 99%, our method is significantly better than the state-of-the-art methods.
引用
收藏
页码:1258 / 1262
页数:5
相关论文
共 50 条
  • [31] Tensor-Train Decomposition in the Presence of Interval-Valued Data
    Di Mauro, Francesco
    Candan, K. Selcuk
    Sapino, Maria Luisa
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (04) : 4267 - 4280
  • [32] An Optimal High-Order Tensor Method for Convex Optimization
    Jiang, Bo
    Wang, Haoyue
    Zhang, Shuzhong
    MATHEMATICS OF OPERATIONS RESEARCH, 2021, 46 (04) : 1390 - 1412
  • [33] An Optimal High-Order Tensor Method for Convex Optimization
    Jiang, Bo
    Wang, Haoyue
    Zhang, Shuzhong
    CONFERENCE ON LEARNING THEORY, VOL 99, 2019, 99
  • [34] Faster tensor train decomposition for sparse data
    Li, Lingjie
    Yu, Wenjian
    Batselier, Kim
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2022, 405
  • [35] Quaternion tensor train rank minimization with sparse regularization in a transformed domain for quaternion tensor completion
    Miao, Jifei
    Kou, Kit Ian
    Yang, Liqiao
    Cheng, Dong
    KNOWLEDGE-BASED SYSTEMS, 2024, 284
  • [36] Gradient-based optimization for regression in the functional tensor-train format
    Gorodetsky, Alex A.
    Jakeman, John D.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2018, 374 : 1219 - 1238
  • [37] Compact lossy compression of tensors via neural tensor-train decomposition
    Kwon, Taehyung
    Ko, Jihoon
    Jung, Jinhong
    Jang, Jun-Gi
    Shin, Kijung
    KNOWLEDGE AND INFORMATION SYSTEMS, 2025, 67 (02) : 1169 - 1211
  • [38] ROBUST HIGH-ORDER TENSOR RECOVERY VIA NONCONVEX LOW-RANK APPROXIMATION
    Qin, Wenjin
    Wang, Hailin
    Ma, Weijun
    Wang, Jianjun
    2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2022, : 3633 - 3637
  • [39] A robust low-rank tensor completion model with sparse noise for higher-order data recovery
    Wang, Min
    Chen, Zhuying
    Zhang, Shuyi
    IET IMAGE PROCESSING, 2024, 18 (12) : 3430 - 3446
  • [40] Compressing Speech Recognition Networks with MLP via Tensor-Train Decomposition
    He, Dan
    Zhong, Yubin
    2019 ASIA-PACIFIC SIGNAL AND INFORMATION PROCESSING ASSOCIATION ANNUAL SUMMIT AND CONFERENCE (APSIPA ASC), 2019, : 1215 - 1219