pith. sign in

arxiv: 1703.07168 · v1 · pith:P4MFYSRWnew · submitted 2017-03-06 · 📊 stat.ML · q-bio.NC

On parameters transformations for emulating sparse priors using variational-Laplace inference

classification 📊 stat.ML q-bio.NC
keywords parametersmodelpriorssparsewhenconstraintsnumberregularization
0
0 comments X
read the original abstract

So-called sparse estimators arise in the context of model fitting, when one a priori assumes that only a few (unknown) model parameters deviate from zero. Sparsity constraints can be useful when the estimation problem is under-determined, i.e. when number of model parameters is much higher than the number of data points. Typically, such constraints are enforced by minimizing the L1 norm, which yields the so-called LASSO estimator. In this work, we propose a simple parameter transform that emulates sparse priors without sacrificing the simplicity and robustness of L2-norm regularization schemes. We show how L1 regularization can be obtained with a "sparsify" remapping of parameters under normal Bayesian priors, and we demonstrate the ensuing variational Laplace approach using Monte-Carlo simulations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.