Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: The Power of Convex Relaxation: Near-Optimal Matrix Completion
Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization
Efficient matrix completion for seismic data reconstruction
Enhanced Low-Rank Matrix Approximation
Iteratively re-weighted least squares minimization for sparse recovery
Distributed Stochastic ADMM for Matrix Factorization
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization
Matrix Completion on Graphs
Efficient tensor completion: Low-rank tensor train
Fast Low-Rank Matrix Learning with Nonconvex Regularization
Regularizing Autoencoder-Based Matrix Completion Models via Manifold Learning
ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION PART II : CONVEX RELAXATION
Greedy Algorithms for Joint Sparse Recovery
Local Low-Rank Matrix Approximation
Nonnegative matrix approximation: algorithms and applications
Low-rank optimization with convex constraints
Recovering low-rank matrices from few coefficients in any basis
Sparse nonnegative matrix approximation : new formulations and algorithms
Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks
Subspace Methods for Joint Sparse Recovery
Expert Finding for Question Answering via Graph Regularized Matrix Completion
Overview of camera calibration for computer vision
A Neural Model for Language Identification in Code-Switched Tweets
Business and Social Networks in International Trade
Spectroscopic Characterization of Biofield Treated Metronidazole and Tinidazole
Decoding by linear programming