Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: Provable Tensor Factorization with Missing Data
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery
Introduction to Tensor Decompositions and their Applications in Machine Learning
A Novel Sparsity Measure for Tensor Recovery
Tensor factorization using auxiliary information
ParCube: sparse parallelizable tensor decompositions
Reweighted Low-Rank Tensor Completion and its Applications in Video Recovery
Convex relaxations of structured matrix factorizations
Robust and sparse estimation of tensor decompositions
An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors
Tensor-Factor Analysis
Scalable Tensor Decompositions for Multi-aspect Data Mining
High Performance Parallel Algorithms for the Tucker Decomposition of Sparse Tensors
Knowledge Graph Completion via Complex Tensor Factorization
Boolean Matrix Factorization and Noisy Completion via Message Passing
Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent
Semi-supervised Tensor Factorization for Brain Network Analysis
A novel nonconvex approach to recover the low-tubal-rank tensor data: when t-SVD meets PSSV
Provable Inductive Matrix Completion
Privacy-preserving matrix factorization
Neural Tensor Factorization
?Hybrid Particle Swarm Optimization and Genetic Algorithm for Multi-UAV Formation Reconfiguration
Optimizing the Matrix Multiplication Using Strassen and Winograd Algorithms with Limited Recursions on Many-Core
Line search algorithms with guaranteed sufficient decrease
The Many Faces of Formative Assessment.
Chapter 2 System Dynamics