Support Recovery with Stochastic Gates: Theory and Application for Linear Models
arXiv:2110.15960
Abstract
Consider the problem of simultaneous estimation and support recovery of the coefficient vector in a linear data model with additive Gaussian noise. We study the problem of estimating the model coefficients based on a recently proposed non-convex regularizer, namely the stochastic gates (STG) [Yamada et al. 2020]. We suggest a new projection-based algorithm for solving the STG regularized minimization problem, and prove convergence and support recovery guarantees of the STG-estimator for a range of random and non-random design matrix setups. Our new algorithm has been shown to outperform the existing STG algorithm and other classical estimators for support recovery in various real and synthetic data analyses.
arXiv comment15 pages, 7 figures, extended the theoretical studies and numerical analyses to other probabilistic models (subgaussian, moment constraints etc.)
References in corpus (6)
- Categorical Reparameterization with Gumbel-Softmax
- The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables
- Sparse Signal Reconstruction via Iterative Support Detection
- Feature Selection using Stochastic Gates
- MMSE Approximation For Sparse Coding Algorithms Using Stochastic Resonance
- On the Distribution of Penalized Maximum Likelihood Estimators: The LASSO, SCAD, and Thresholding