About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

Learning the solution sparsity of an ill-posed linear inverse problem with the Variational Garrote

From

Technical University of Denmark1

Department of Applied Mathematics and Computer Science, Technical University of Denmark2

Cognitive Systems, Department of Applied Mathematics and Computer Science, Technical University of Denmark3

The Variational Garrote is a promising new approach for sparse solutions of ill-posed linear inverse problems (Kappen and Gomez, 2012). We reformulate the prior of the Variational Garrote to follow a simple Binomial law and assign a Beta hyper-prior on the parameter. With the new prior the Variational Garrote, we show, has a wide range of parameter values for which it at the same time provides low test error and high retrieval of the true feature locations.

Furthermore, the new form of the prior and associated hyper-prior leads to a simple update rule in a Bayesian variational inference scheme for its hyperparameter. As a second contribution we provide evidence that the new procedure can improve on cross-validation of the parameters and we find that the new formulation of the prior outperforms the original formulation when both are cross-validated to determine hyperparameters.

Language: English
Publisher: IEEE
Year: 2013
Pages: 1-6
Proceedings: 2013 IEEE International Workshop on Machine Learning for Signal Processing
Series: Machine Learning for Signal Processing
ISBN: 1479911798 , 1479911801 , 9781479911790 and 9781479911806
ISSN: 21610363 and 15512541
Types: Conference paper
DOI: 10.1109/MLSP.2013.6661919
ORCIDs: Hansen, Sofie Therese and Hansen, Lars Kai

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis