Characterization of sampling patterns for low-tt-rank tensor retrieval
From MaRDI portal
Publication:2202522
DOI10.1007/s10472-020-09691-6zbMath1466.62455OpenAlexW3011519116MaRDI QIDQ2202522
Morteza Ashraphijuo, Xiaodong Wang
Publication date: 18 September 2020
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-020-09691-6
low-rank tensor completiondata completiontensor-train decompositionfinite completabilitytensor retrievalunique completability
Sampling theory, sample surveys (62D05) Multilinear algebra, tensor calculus (15A69) General topics in the theory of algorithms (68W01) Statistical aspects of big data and data science (62R07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor-Train Decomposition
- TT-cross approximation for multidimensional arrays
- The geometry of algorithms using hierarchical tensors
- Low-rank tensor completion by Riemannian optimization
- On uniqueness in CANDECOMP/PARAFAC
- Multiarray signal processing: tensor decomposition meets compressed sensing
- On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Low rank tensor recovery via iterative hard thresholding
- On manifolds of tensors of fixed TT-rank
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Exact matrix completion via convex optimization
- Orthogonal Tensor Decompositions
- Robust Low-Rank Tensor Recovery: Models and Algorithms
- Hierarchical Singular Value Decomposition of Tensors
- A Singular Value Thresholding Algorithm for Matrix Completion
- The density-matrix renormalization group
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- A Multilinear Singular Value Decomposition
- Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
- Low-Rank Data Completion With Very Low Sampling Rate Using Newton's Method
- Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Fundamental Conditions for Low-CP-Rank Tensor Completion
- Low-rank matrix completion using alternating minimization
- Phase Retrieval via Matrix Completion
