Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery

被引:0
作者
Haselby, Cullen A. [1 ,2 ]
Iwen, Mark A. [1 ,2 ]
Needell, Deanna [3 ]
Perlmutter, Michael [3 ]
Rebrova, Elizaveta [4 ]
机构
[1] Michigan State Univ, Dept Math, E Lansing, MI USA
[2] Michigan State Univ, Dept Computat Math Sci & Engn CMSE, E Lansing, MI USA
[3] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90095 USA
[4] Princeton Univ, Dept Operat Res & Financial Engn, Princeton, NJ USA
关键词
Tensor-structured data; Dimension reduction; Modewise measurements; JOHNSON-LINDENSTRAUSS; RANDOM PROJECTIONS; SIGNAL RECOVERY; ALGORITHM; PURSUIT;
D O I
10.1016/j.acha.2023.04.007
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Recovery of sparse vectors and low-rank matrices from a small number of linear measurements is well-known to be possible under various model assumptions on the measurements. The key requirement on the measurement matrices is typically the restricted isometry property, that is, approximate orthonormality when acting on the subspace to be recovered. Among the most widely used random matrix measurement models are (a) independent subgaussian models and (b) randomized Fourier-based models, allowing for the efficient computation of the measurements. For the now ubiquitous tensor data, direct application of the known recovery algorithms to the vectorized or matricized tensor is memory-heavy because of the huge measurement matrices to be constructed and stored. In this paper, we propose modewise measurement schemes based on subgaussian and randomized Fourier measurements. These modewise operators act on the pairs or other small subsets of the tensor modes separately. They require significantly less memory than the measurements working on the vectorized tensor, provably satisfy the tensor restricted isometry property and experimentally can recover the tensor data from fewer measurements and do not require impractical storage.& COPY; 2023 Elsevier Inc. All rights reserved.
引用
收藏
页码:161 / 192
页数:32
相关论文
共 42 条
  • [1] Database-friendly random projections: Johnson-Lindenstrauss with binary coins
    Achlioptas, D
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (04) : 671 - 687
  • [2] Ahle TD, 2020, PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), P141
  • [3] Bamberger S, 2021, Arxiv, DOI arXiv:2106.13349
  • [4] Random Projections of Smooth Manifolds
    Baraniuk, Richard G.
    Wakin, Michael B.
    [J]. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (01) : 51 - 77
  • [5] The multiconfiguration time-dependent Hartree (MCTDH) method:: a highly efficient algorithm for propagating wavepackets
    Beck, MH
    Jäckle, A
    Worth, GA
    Meyer, HD
    [J]. PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2000, 324 (01): : 1 - 105
  • [6] Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
    Bengua, Johann A.
    Phien, Ho N.
    Hoang Duong Tuan
    Do, Minh N.
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (05) : 2466 - 2479
  • [7] CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
    Blanchard, Jeffrey D.
    Tanner, Jared
    Wei, Ke
    [J]. INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2015, 4 (04) : 289 - 327
  • [8] Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance
    Blumensath, Thomas
    Davies, Mike E.
    [J]. IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2010, 4 (02) : 298 - 309
  • [9] Iterative hard thresholding for compressed sensing
    Blumensath, Thomas
    Davies, Mike E.
    [J]. APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) : 265 - 274
  • [10] Stable signal recovery from incomplete and inaccurate measurements
    Candes, Emmanuel J.
    Romberg, Justin K.
    Tao, Terence
    [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (08) : 1207 - 1223