PORTO @ 
Archivio Istituzionale della Ricerca
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishLearning sparse models from data is an important task in all those frameworks where relevant information should be identified within a large dataset. This can be achieved by formulating and solving suitable sparsity promoting optimization problems. As to linear regression models, Lasso is the most popular convex approach, based on an L1-norm regularization. In contrast, in this paper, we analyse a concave regularized approach, and we prove that it relaxes the irrepresentable condition, which is sufficient and essentially necessary for Lasso to select the right significant parameters. In practice, this has the benefit of reducing the number of necessary measurements with respect to Lasso. Since the proposed problem is nonconvex, we also discuss different algorithms to solve it, and we illustrate the obtained enhancement via numerical experiments.
Sparse learning with concave regularization: relaxation of the irrepresentable condition / Cerone, V.; Fosson, S.; Regruto, D.; Salam, A.. - ELETTRONICO. - (2020), pp. 396-401. ((Intervento presentato al convegno 59th IEEE Conference on Decision and Control (CDC) tenutosi a Jeju Island (Republic of Korea) nel December 14-18, 2020 [10.1109/CDC42340.2020.9304508].
| Titolo: | Sparse learning with concave regularization: relaxation of the irrepresentable condition | |
| Autori: | ||
| Data di pubblicazione: | 2020 | |
| Abstract: | Learning sparse models from data is an important task in all those frameworks where relevant info...rmation should be identified within a large dataset. This can be achieved by formulating and solving suitable sparsity promoting optimization problems. As to linear regression models, Lasso is the most popular convex approach, based on an L1-norm regularization. In contrast, in this paper, we analyse a concave regularized approach, and we prove that it relaxes the irrepresentable condition, which is sufficient and essentially necessary for Lasso to select the right significant parameters. In practice, this has the benefit of reducing the number of necessary measurements with respect to Lasso. Since the proposed problem is nonconvex, we also discuss different algorithms to solve it, and we illustrate the obtained enhancement via numerical experiments. | |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
| File | Descrizione | Tipologia | Licenza | |
|---|---|---|---|---|
| CDC2020_v3.0.pdf | 2. Post-print / Author's Accepted Manuscript | PUBBLICO - Tutti i diritti riservati | Visibile a tuttiVisualizza/Apri | |
| 09304508.pdf | 2a Post-print versione editoriale / Version of Record | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2846133
Copyright © 2022