Numerical characterization of support recovery in sparse regression with correlated design

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Nearly unbiased variable selection under minimax concave penalty
Best subset selection via a modern optimization lens
Correlated variables in regression: clustering and sparse estimation
Support recovery without incoherence: a case for nonconvex regularization
Pathwise coordinate optimization for sparse learning: algorithm and theory
Sparse regression: scalable algorithms and empirical performance
Calibration and empirical Bayes variable selection
Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework
Sparse Signal Processing With Linear and Nonlinear Observations: A Unified Shannon-Theoretic Approach
Can the strengths of AIC and BIC be shared? A conflict between model indentification and regression estimation
Model Selection and the Principle of Minimum Description Length
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Compressed Sensing With Prior Information: Information-Theoretic Limits and Practical Decoders
Sparsity and Smoothness Via the Fused Lasso
Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
A polynomial algorithm for best-subset selection problem
Nearly Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery
Information Theoretic Bounds for Compressed Sensing
Regularization and Variable Selection Via the Elastic Net
Tuning parameter selectors for the smoothly clipped absolute deviation method
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima

This page was built for publication: Numerical characterization of support recovery in sparse regression with correlated design