Threshold selection for group sparsity

Victor Solo*, Magnus Ulfarsson

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Citations (Scopus)

Abstract

The group Lasso is an extension of the Lasso or l1-penalised least squares procedure. It forces simultaneous zeroing of groups of variables and has already been applied to sparse component analysis and ill-conditioned inverse problems. In this paper we address the unresolved problem of threshold or penalty parameter selection.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings
Pages3754-3757
Number of pages4
DOIs
Publication statusPublished - 2010
Event2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Dallas, TX, United States
Duration: 14 Mar 201019 Mar 2010

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Conference

Conference2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010
Country/TerritoryUnited States
CityDallas, TX
Period14/03/1019/03/10

Other keywords

  • L denoising
  • Lasso
  • Sparse
  • Sure

Fingerprint

Dive into the research topics of 'Threshold selection for group sparsity'. Together they form a unique fingerprint.

Cite this