Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: CUR Algorithm for Partially Observed Matrices
The Power of Convex Relaxation: Near-Optimal Matrix Completion
On Higher-order Singular Value Decomposition from Incomplete Data
Matrix Completion on Graphs
NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion
Matrix Completion Under Monotonic Single Index Models
Low Complexity Damped Gauss-Newton Algorithms for CANDECOMP/PARAFAC
A nonconvex optimization framework for low rank matrix estimation
Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization
Approximate Inverse Techniques for Block-Partitioned Matrices
Accelerated inexact soft-impute for fast large-scale matrix completion
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
Fast Curvature Matrix-Vector Products for Second-Order Gradient Descent
Low rank matrix recovery from rank one measurements
Joint Matrices Decompositions and Blind Source Separation: A survey of methods, identification, and applications
Adaptive Sampling and Fast Low-Rank Matrix Approximation
a randomized algorithm for the decomposition of matrices ✩ .
An SVD-free Pareto curve approach to rank minimization
Analysis of Nuclear Norm Regularization for Full-rank Matrix Completion
A Supernodal Approach to Sparse Partial Pivoting
Solving Resource Allocation/Scheduling Problems with Constraint Integer Programming
Machine-Learning Research -- Four Current Directions
Links between perceptrons, MLPs and SVMs
matrix computations ( 3 . ed . ) .
A new preference scale mcdm method based on interval-valued intuitionistic fuzzy sets and the analytic hierarchy process