The Algebraic Combinatorial Approach for Low-Rank Matrix Completion

zbMath1354.15019arXiv1211.4116MaRDI QIDQ5744807

Franz J. Király, Louis Theran, Ryota Tomioka

Publication date: 19 February 2016

Full work available at URL: https://arxiv.org/abs/1211.4116

zbMATH Keywords

algebraic geometrymatroid theorylow-rank matrix completionalgebraic combinatoricsmatrix reconstructionentry-wise completionprobability-one algorithms

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Matrix completion problems (15A83)

Related Items (21)

Efficient Identification of Butterfly Sparse Matrix Factorizations ⋮ Unique low rank completability of partially filled matrices ⋮ Unnamed Item ⋮ Completion of tree metrics and rank 2 matrices ⋮ The Geometry of Rank-One Tensor Completion ⋮ Algebraic compressed sensing ⋮ Frameworks with forced symmetry. I: Reflections and rotations ⋮ Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support ⋮ Worst-case versus average-case design for estimation from partial pairwise comparisons ⋮ Results on the algebraic matroid of the determinantal variety ⋮ Parameter Identifiability in Statistical Machine Learning: A Review ⋮ Functional data analysis by matrix completion ⋮ Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation ⋮ The algebraic matroid of the finite unit norm tight frame (funtf) variety ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning ⋮ Low-rank matrix completion using nuclear norm minimization and facial reduction ⋮ Unnamed Item ⋮ Algebraic Matroids in Action ⋮ GENERIC UNLABELED GLOBAL RIGIDITY ⋮ Typical and generic ranks in matrix completion ⋮ Algebraic systems biology: a case study for the Wnt pathway

This page was built for publication: The Algebraic Combinatorial Approach for Low-Rank Matrix Completion