Tensor Methods for Nonlinear Matrix Completion

DOI10.1137/20M1323448zbMath1468.15011arXiv1804.10266OpenAlexW3129392366MaRDI QIDQ4999357

Greg Ongie, Laura Balzano, Daniel Pimentel-Alarcón, Rebecca Willett, Robert D. Nowak

Publication date: 6 July 2021

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionalgebraic varietiestensorssubspace clusteringunions of subspaces

Mathematics Subject Classification ID

Computational aspects of higher-dimensional varieties (14Q15) Configurations and arrangements of linear subspaces (14N20) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (3)

Nonintrusive Reduced-Order Models for Parametric Partial Differential Equations via Data-Driven Operator Inference ⋮ Two directional Laplacian pyramids with application to data imputation ⋮ Nonlinear matrix recovery using optimization on the Grassmann manifold

Uses Software

• Eigentaste

Cites Work

• Hilbert series of subspace arrangements
• Random consensus robust PCA
• Subspace arrangements, configurations of linear spaces and the quadrics containing them
• Generalized principal component analysis
• Exact matrix completion via convex optimization
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Une majoration de la fonction de Hilbert et ses conséquences pour l'interpolation algébrique
• Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Learning the Nonlinear Geometry of High-Dimensional Data: Models and Algorithms
• Annihilating Filter-Based Low-Rank Hankel Matrix Approach for Image Inpainting
• Missing Data Recovery for High-Dimensional Signals With Nonlinear Low-Dimensional Structures
• Oblivious Sketching of High-Degree Polynomial Kernels
• Filtrated Algebraic Subspace Clustering
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tensor Methods for Nonlinear Matrix Completion