Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: A Tight Bound of Hard Thresholding
FA ] 2 N ov 2 00 3 An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
Transformed Schatten-1 Iterative Thresholding Algorithms for Low Rank Matrix Completion
Matrix sparsification via the Khintchine inequality
TR 0707 A Fixed-Point Continuation Method for ` 1-Regularized Minimization with Applications to Compressed Sensing
Iteratively re-weighted least squares minimization for sparse recovery
Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery
Practical Signal Recovery from Random Projections
A survey of thresholding techniques
Global Optimality of Local Search for Low Rank Matrix Recovery
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Complexity Theoretic Lower Bounds for Sparse Principal Component Detection
Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Tensor theta norms and low rank recovery
Optimized Projections for Compressed Sensing
Phase retrieval via linear programming: Fundamental limits and algorithmic improvements
PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
An approximate L0 norm minimization algorithm for compressed sensing
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling
On model selection consistency of lasso
Multi-focus image fusion with a deep convolutional neural network
A Case of Neonatal Marfan Syndrome: A Management Conundrum and the Role of a Multidisciplinary Team
Statistical compression-based models for text classification
Training Invariant Support Vector Machines using Selective Sampling