Sparse Bayesian Lasso via a Variable-Coefficient $\ell_1$ Penalty
Nathan Wycoff, Ali Arab, Katharine M. Donato, Lisa O. Singh

TL;DR
This paper introduces a Sparse Bayesian Lasso with learnable penalty weights and hyperpriors, enhancing interpretability and reducing bias in sparse models, applicable to variational Bayesian methods and demonstrated on real-world displacement data.
Contribution
It develops a variable-coefficient $ ext{L}_1$ penalty with hyperpriors, integrating it into Variational Bayes for improved sparsity and uncertainty quantification.
Findings
Achieves low bias and uncertainty quantification in simulations.
Reduces computational cost by an order of magnitude.
Successfully applied to spatiotemporal displacement modeling.
Abstract
Modern statistical learning algorithms are capable of amazing flexibility, but struggle with interpretability. One possible solution is sparsity: making inference such that many of the parameters are estimated as being identically 0, which may be imposed through the use of nonsmooth penalties such as the penalty. However, the penalty introduces significant bias when high sparsity is desired. In this article, we retain the penalty, but define learnable penalty weights endowed with hyperpriors. We start the article by investigating the optimization problem this poses, developing a proximal operator associated with the norm. We then study the theoretical properties of this variable-coefficient penalty in the context of penalized likelihood. Next, we investigate application of this penalty to Variational Bayes, developing a model we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Gaussian Processes and Bayesian Inference · Domain Adaptation and Few-Shot Learning
