Low-rank nonnegative tensor approximation via alternating projections and sketching

被引:8
|
作者
Sultonov, Azamat [1 ]
Matveev, Sergey [1 ,2 ]
Budzinskiy, Stanislav [2 ]
机构
[1] Lomonosov Moscow State Univ, Fac Computat Math & Cybernet, Moscow, Russia
[2] Marchuk Inst Numer Math RAS, Moscow, Russia
来源
COMPUTATIONAL & APPLIED MATHEMATICS | 2023年 / 42卷 / 02期
基金
俄罗斯科学基金会;
关键词
low-rank approximation; nonnegative tensors; alternating projections; sketching; Tucker decomposition; Tensor train decomposition; RANDOMIZED ALGORITHMS; DECOMPOSITION; TRAIN; TUCKER; SVD;
D O I
10.1007/s40314-023-02211-2
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We show how to construct nonnegative low-rank approximations of nonnegative tensors in Tucker and tensor train formats. We use alternating projections between the nonnegative orthant and the set of low-rank tensors, using STHOSVD and TTSVD algorithms, respectively, and further accelerate the alternating projections using randomized sketching. The numerical experiments on both synthetic data and hyperspectral images show the decay of the negative elements and that the error of the resulting approximation is close to the initial error obtained with STHOSVD and TTSVD. The proposed method for the Tucker case is superior to the previous ones in terms of computational complexity and decay of negative elements. The tensor train case, to the best of our knowledge, has not been studied before.
引用
收藏
页数:20
相关论文
共 50 条
  • [31] A hybrid algorithm for low-rank approximation of nonnegative matrix factorization
    Wang, Peitao
    He, Zhaoshui
    Xie, Kan
    Gao, Junbin
    Antolovich, Michael
    Tan, Beihai
    NEUROCOMPUTING, 2019, 364 : 129 - 137
  • [32] Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors
    Dong, Wandi
    Yu, Gaohang
    Qi, Liqun
    Cai, Xiaohao
    JOURNAL OF SCIENTIFIC COMPUTING, 2023, 95 (02)
  • [33] A literature survey of low-rank tensor approximation techniques
    Grasedyck, Lars
    Kressner, Daniel
    Tobler, Christine
    Kressner, D. (daniel.kressner@epfl.ch), 1600, Wiley-VCH Verlag (36): : 53 - 78
  • [34] Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors
    Wandi Dong
    Gaohang Yu
    Liqun Qi
    Xiaohao Cai
    Journal of Scientific Computing, 2023, 95
  • [35] Clustering Ensemble Meets Low-rank Tensor Approximation
    Jia, Yuheng
    Liu, Hui
    Hou, Junhui
    Zhang, Qingfu
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 7970 - 7978
  • [36] Nonnegative Low-Rank Tensor Completion via Dual Formulation with Applications to Image and Video Completion
    Sinha, Tanmay Kumar
    Naram, Jayadev
    Kumar, Pawan
    2022 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV 2022), 2022, : 4069 - 4077
  • [37] Nonnegative low-rank tensor completion method for spatiotemporal traffic data
    Zhao, Yongmei
    Tuo, Mingfu
    Zhang, Hongmei
    Zhang, Han
    Wu, Jiangnan
    Gao, Fengyin
    MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 83 (22) : 61761 - 61776
  • [38] Noisy Tensor Completion via Low-Rank Tensor Ring
    Qiu, Yuning
    Zhou, Guoxu
    Zhao, Qibin
    Xie, Shengli
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (01) : 1127 - 1141
  • [39] Nonnegative low multi-rank third-order tensor approximation via transformation
    Song, Guang-Jing
    Hu, Yexun
    Xu, Cobi
    Ng, Michael K.
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2024, 31 (06)
  • [40] Decentralized sketching of low-rank matrices
    Srinivasa, Rakshith S.
    Lee, Kiryung
    Junge, Marius
    Romberg, Justin
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32