Co-occurring keywords · papers mentioning both
Papers
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing
NeurIPS 2019
Support Localization and the Fisher Metric for off-the-grid Sparse Regularization
AISTATS 2019
Trimming the ℓ_1 Regularizer: Statistical Analysis, Optimization, and Applications to Deep Learning
ICML 2019
Combinatorial Penalties: Which structures are preserved by convex relaxations?
AISTATS 2018
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds
NeurIPS 2018
Generalized Pseudolikelihood Methods for Inverse Covariance Estimation
AISTATS 2017
On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit
ICML 2017
Partial Hard Thresholding: Towards A Principled Analysis of Support Recovery
NeurIPS 2017
Exact Recovery of Hard Thresholding Pursuit
NeurIPS 2016
L1-Regularized Least Squares for Support Recovery of High Dimensional Single Index Models with Gaussian Designs
JMLR 2016
Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices
AISTATS 2016
One Scan 1-Bit Compressed Sensing
AISTATS 2016
Sparse Support Recovery with Non-smooth Loss Functions
NeurIPS 2016
One-bit Compressed Sensing with the k-Support Norm
AISTATS 2015
Towards a Lower Sample Complexity for Robust One-bit Compressed Sensing
ICML 2015
A Unified Framework for Consistency of Regularized Loss Minimizers
ICML 2014
Information-Theoretic Characterization of Sparse Recovery
AISTATS 2014
Sparse PCA via Covariance Thresholding
NeurIPS 2014
Sparse PCA with Oracle Property
NeurIPS 2014
Block Regularized Lasso for Multivariate Multi-Response Linear Regression
AISTATS 2013
Noisy and Missing Data Regression: Distribution-Oblivious Support Recovery
ICML 2013
One-Bit Compressed Sensing: Provable Support and Vector Recovery
ICML 2013
Robust Sparse Regression under Adversarial Corruption
ICML 2013
Robust Lasso with missing and grossly corrupted observations
NeurIPS 2011
A Dirty Model for Multi-task Learning
NeurIPS 2010