← Keywords

sparse recovery

113 papers

Explore in graph

Co-occurring keywords

compressed sensing (198) compressive sensing (126) sample complexity (1158) convex optimization (1320) signal recovery (54) sparse optimization (246) support recovery (43) nonconvex optimization (316) signal reconstruction (43) high-dimensional regression (142)

Papers

A Nullspace Property for Subspace-Preserving Recovery ICML 2021
Group Delay Based Re-Weighted Sparse Recovery Algorithms for Robust and High-Resolution Source Separation in DOA Framework INTERSPEECH 2021
Iteratively Reweighted Least Squares for Basis Pursuit with Global Linear Convergence Rate NIPS 2021
Limits on Testing Structural Changes in Ising Models NIPS 2020
Nearly Non-Expansive Bounds for Mahalanobis Hard Thresholding COLT 2020
All-or-nothing statistical and computational phase transitions in sparse spiked matrix estimation NIPS 2020
Dual Iterative Hard Thresholding JMLR 2020
Reducing Adversarially Robust Learning to Non-Robust PAC Learning NIPS 2020
Tensor Completion Made Practical NIPS 2020
Comb Decoding towards Collision-Free WiFi NSDI 2020
APKeep: Realtime Verification for Real Networks NSDI 2020
Truncated Linear Regression in High Dimensions NIPS 2020
Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priors ICML 2020
On the Power of Compressed Sensing with Generative Models ICML 2020
Interaction Hard Thresholding: Consistent Sparse Quadratic Regression in Sub-quadratic Time and Space NIPS 2019
Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression NIPS 2019
Implicit Regularization for Optimal Sparse Recovery NIPS 2019
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing NIPS 2019
An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory JMLR 2019
Multi-class Heterogeneous Domain Adaptation JMLR 2019
A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution NIPS 2019
Theoretical Linear Convergence of Unfolded ISTA and Its Practical Weights and Thresholds NIPS 2018
Testing Sparsity over Known and Unknown Bases ICML 2018
Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity NIPS 2018
A convex program for bilinear inversion of sparse vectors NIPS 2018