Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
From MaRDI portal
Publication:5232122
Recommendations
- Fundamental conditions for low-CP-rank tensor completion
- Spectral algorithms for tensor completion
- Recovering low CP/Tucker ranked tensors, with applications in tensor completion
- Low-rank approximation and completion of positive tensors
- Tucker factorization with missing data with application to low-n-rank tensor completion
Cites work
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A Decomposition for Three-Way Arrays
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- A Practical Randomized CP Tensor Decomposition
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- A simpler approach to matrix completion
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Application of the three‐way decomposition for matrix compression
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Coupled Canonical Polyadic Decompositions and Multiple Shift Invariance in Array Processing
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_r,n,L_r,n,1)\) terms. I: Uniqueness
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_{r,n},L_{r,n},1)\) terms. II: Algorithms
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Exact matrix completion via convex optimization
- Fast monte-carlo algorithms for finding low-rank approximations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
- Graphs and matrices
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
- Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition—Part I: Model and Identifiability
- Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition—Part II: Algorithm and Multirate Sampling
- On Generic Identifiability of 3-Tensors of Small Rank
- On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
- On tensor completion via nuclear norm minimization
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. I: Basic results and uniqueness of one factor matrix
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Randomized interpolative decomposition of separated representations
- Rank and optimal computation of generic tensors
- Rank-one completions of partial matrices and completely rank-nonincreasing linear functionals
- Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Cited in
(5)- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_{r,n},L_{r,n},1)\) terms. II: Algorithms
- Fundamental conditions for low-CP-rank tensor completion
- Hyperspectral Super-resolution Accounting for Spectral Variability: Coupled Tensor LL1-Based Recovery and Blind Unmixing of the Unknown Super-resolution Image
- New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
- Incremental CP tensor decomposition by alternating minimization method
This page was built for publication: Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232122)
