Skip to main navigation Skip to search Skip to main content

L1 LASSO and its Bayesian Inference

Junbin Gao, Michael Antolovich, Paul Hing Kwan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A new iterative procedure for solving regression problems with the so-called LASSO penalty is proposed by using generative Bayesian modeling and inference. The algorithm produces the anticipated parsimonious or sparse regression models that generalize well on unseen data. The proposed algorithm is quite robust and there is no need to specify any model hyperparameters. A comparison with state-of-the-art methods for constructing sparse regression models such as the relevance vector machine (RVM) and the local regularization assisted orthogonal least squares regression (LROLS) is given.
Original languageEnglish
Title of host publicationAI 2008: advances in artificial intelligence : 21st Australasian Joint Conference on Artificial Intelligence, Auckland, New Zealand, December 1-5, 2008
EditorsW. Wobcke, M. Zhang
Place of PublicationBerlin, Germany
PublisherSpringer
Pages318-324
Edition1
ISBN (Print)978-3-540-89377-6
Publication statusPublished - 2008
EventAI 2008: 21st Australasian Joint Conference on Artificial Intelligence - Auckland, New Zealand
Duration: 1 Dec 20085 Dec 2008

Publication series

NameLecture notes in artificial intelligence
Number5360

Conference

ConferenceAI 2008: 21st Australasian Joint Conference on Artificial Intelligence
CityAuckland, New Zealand
Period1/12/085/12/08

Keywords

  • Pattern Recognition and Data Mining

Fingerprint

Dive into the research topics of 'L1 LASSO and its Bayesian Inference'. Together they form a unique fingerprint.

Cite this