compressed sensing

Structured Matrix Recovery via the Generalized Dantzig Selector NeurIPS 2016 The Constrained Dantzig Selector with Enhanced Consistency JMLR 2016 A Nearly-Linear Time Framework for Graph-Structured Sparsity ICML 2015 Approximating Sparse PCA from Incomplete Data NeurIPS 2015 LASSO with Non-linear Measurements is Equivalent to One With Linear Measurements NeurIPS 2015 Robust PCA with compressed data NeurIPS 2015 Sparse Dynamic 3D Reconstruction From Unsynchronized Videos ICCV 2015 Super-Resolution Off the Grid NeurIPS 2015 Swept Approximate Message Passing for Sparse Estimation ICML 2015 Towards a Lower Sample Complexity for Robust One-bit Compressed Sensing ICML 2015 A Consistent Histogram Estimator for Exchangeable Graph Models ICML 2014 A Dual Algorithm for Olfactory Computation in the Locust Brain NeurIPS 2014 An Adaptive Accelerated Proximal Gradient Method and its Homotopy Continuation for Sparse Optimization ICML 2014 Average Case Analysis of High-Dimensional Block-Sparse Recovery and Regression for Arbitrary Designs AISTATS 2014 Compressed Counting Meets Compressed Sensing COLT 2014 Efficient Learning and Planning with Compressed Predictive States JMLR 2014 Efficient Structured Matrix Rank Minimization NeurIPS 2014 Estimation with Norm Regularization NeurIPS 2014 Generalized Dantzig Selector: Application to the k-support norm NeurIPS 2014 Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization ICML 2014 Heterogeneous Domain Adaptation for Multiple Classes AISTATS 2014 Predicting Useful Neighborhoods for Lazy Local Learning NeurIPS 2014 Adaptive Compressed Tomography Sensing CVPR 2013 Blind Calibration in Compressed Sensing using Message Passing Algorithms NeurIPS 2013 Compressed Hashing CVPR 2013