Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval

DOI10.1007/S10472-019-09662-6MaRDI QIDQ2294578zbMATH OpenOpenAlexWikidataFDO

Authors Morteza Ashraphijuo, Xiaodong Wang

Publication date 11 February 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-019-09662-6

zbMATH Keywords

finite completabilitylow-rank data completionmanifoldmatrix completionunion of subspacesunique completability

Mathematics Subject Classification ID

Matrix completion problems (15A83) Estimation in multivariate analysis (62H12) Statistics on manifolds (62R30) Computational aspects of data analysis and big data (68T09)

Recommendations

• Fundamental conditions for low-CP-rank tensor completion
• Characterization of sampling patterns for low-tt-rank tensor retrieval
• Union of low-rank tensor spaces: clustering and completion
• Rank determination for low-rank data completion
• Typical and generic ranks in matrix completion

Cites work

• A Singular Value Thresholding Algorithm for Matrix Completion
• Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor
• Deterministic network coding by matrix completion
• Exact matrix completion via convex optimization
• Fundamental conditions for low-CP-rank tensor completion
• scientific article; zbMATH DE number 5161643 (Why is no real title available?)
• scientific article; zbMATH DE number 1827070 (Why is no real title available?)
• Learning with tensors: a framework based on convex optimization and spectral regularization
• Low-Rank Data Completion With Very Low Sampling Rate Using Newton's Method
• Low-rank tensor completion by Riemannian optimization
• Missing Data Recovery for High-Dimensional Signals With Nonlinear Low-Dimensional Structures
• Phase retrieval via matrix completion
• Rank determination for low-rank data completion
• Robust low-rank tensor recovery: models and algorithms
• Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

Cited in

(2)

• Characterization of sampling patterns for low-tt-rank tensor retrieval
• Union of low-rank tensor spaces: clustering and completion

Describes a project that uses

Uses Software

• PhaseLift

This page was built for publication: Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294578)