PERFORMANCE ESTIMATION FOR TENSOR CP DECOMPOSITION WITH STRUCTURED FACTORS

被引:0
|
作者
Boizard, Maxime [1 ,2 ]
Boyer, Remy [1 ]
Favier, Gerard [3 ]
Cohen, Jeremy E. [4 ]
Comon, Pierre [4 ]
机构
[1] Univ Paris Sud, CNRS, CentraleSupelec, L2S, Paris, France
[2] ENS Cachan, SATIE, Cachan, France
[3] Univ Nice Sophia Antipolis, CNRS, I3S, Nice, France
[4] Univ Grenoble Alpes, CNRS, GIPSA Lab, Grenoble, France
关键词
Multilinear Algebra; Tensor Decomposition; Performance Analysis; Cramer-Rao bound; Structured matrix; WIRELESS COMMUNICATION-SYSTEMS; PARAFAC; MODEL;
D O I
暂无
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
The Canonical Polyadic tensor decomposition (CPD), also known as Candecomp/Parafac, is very useful in numerous scientific disciplines. Structured CPDs, i.e. with Toeplitz, circulant, or Hankel factor matrices, are often encountered in signal processing applications. As subsequently pointed out, specialized algorithms were recently proposed for estimating the deterministic parameters of structured CP decompositions. A closed-form expression of the Cramer-Rao bound (CRB) is derived, related to the problem of estimating CPD parameters, when the observed tensor is corrupted with an additive circular i.i.d. Gaussian noise. This CRB is provided for arbitrary tensor rank and sizes. Finally, the proposed CRB expression is used to asses the statistical efficiency of the existing algorithms by means of simulation results in the cases of third-order tensors having three circulant factors on one hand, and an Hankel factor on the other hand.
引用
收藏
页码:3482 / 3486
页数:5
相关论文
共 50 条
  • [1] Tensor CP Decomposition With Structured Factor Matrices: Algorithms and Performance
    Goulart, Jose Henrique de M.
    Boizard, Maxime
    Boyer, Remy
    Favier, Gerard
    Comon, Pierre
    IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2016, 10 (04) : 757 - 769
  • [2] Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary Learning
    Rambhatla, Sirisha
    Li, Xingguo
    Haupt, Jarvis
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [3] Randomized CP tensor decomposition
    Erichson, N. Benjamin
    Manohar, Krithika
    Brunton, Steven L.
    Kutz, J. Nathan
    MACHINE LEARNING-SCIENCE AND TECHNOLOGY, 2020, 1 (02):
  • [4] A PRACTICAL RANDOMIZED CP TENSOR DECOMPOSITION
    Battaglino, Casey
    Ballard, Grey
    Kolda, Tamara G.
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2018, 39 (02) : 876 - 901
  • [5] Tensor Completion via the CP Decomposition
    Sanogo, Fatoumata
    Navasca, Carmeliza
    2018 CONFERENCE RECORD OF 52ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2018, : 845 - 849
  • [6] Tensor estimation with structured priors
    Luneau C.
    MacRis N.
    IEEE Journal on Selected Areas in Information Theory, 2020, 1 (03): : 705 - 722
  • [7] Comparison of CP and Tucker Tensor Decomposition Algorithms
    Hale, Elizabeth
    Prater-Bennette, Ashley
    BIG DATA III: LEARNING, ANALYTICS, AND APPLICATIONS, 2021, 11730
  • [8] Nonnegative Tensor CP Decomposition of Hyperspectral Data
    Veganzones, Miguel A.
    Cohen, Jeremy E.
    Farias, Rodrigo Cabral
    Chanussot, Jocelyn
    Comon, Pierre
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2016, 54 (05): : 2577 - 2588
  • [9] On Nonnegative CP Tensor Decomposition Robustness to Noise
    Haddock, Jamie
    Kassab, Lara
    Kryshchenko, Alona
    Needell, Deanna
    2020 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2020,
  • [10] Structured Tensor Decomposition-Based Channel Estimation for Wideband Millimeter Wave MIMO
    Lin, Yuxing
    Jin, Shi
    Matthaiou, Michail
    You, Xiaohu
    CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2019, : 421 - 426