A gradual rank increasing process for matrix completion

DOI10.1007/s11075-017-0292-2zbMath1380.65075OpenAlexW2598965379MaRDI QIDQ1689449

Achiya Dax

Publication date: 12 January 2018

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-017-0292-2

zbMATH Keywords

numerical experimentscross-validationmissing dataalternating least squaresmatrix completion problemstraining setrank determinationerror assessmentgradual rank increasingimputingprobe set

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Matrix completion problems (15A83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How many principal components? Stopping rules for determining the number of non-trivial axes revisited
• Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data
• Iteration Methods for Nonlinear Problems
• A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor
• Orthogonalization Via Deflation: A Minimum Norm Approach for Low-Rank Approximations of a Matrix
• Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights
• Low-rank matrix completion using alternating minimization
• Relaxation Methods for Convex Problems