CINECA IRIS Institutional Research Information System
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.
EnglishWe discuss how a large class of regularization methods, collectively known as spectral regularization and originally designed for solving ill- posed inverse problems, gives rise to regularized learning algorithms. All these algorithms are consistent kernel methods which can be easily implemented. The intuition behind their derivation is that the same principle allowing to numerically stabilize a matrix inversion problem is crucial to avoid over-fitting. The various methods have a common derivation, but different computational and theoretical properties. We describe examples of such algorithms, analyzing their classification performance on several datasets and discussing their applicability to real world problems.
Spectral Algorithms for Supervised Learning / LO GERFO, L.; Rosasco, Lorenzo; Odone, Francesca; DE VITO, Ernesto; Verri, Alessandro. - In: NEURAL COMPUTATION. - ISSN 0899-7667. - STAMPA. - 20(7)(2008), pp. 1873-1897.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | Spectral Algorithms for Supervised Learning |
| Autori: | |
| Data di pubblicazione: | 2008 |
| Rivista: | |
| Citazione: | Spectral Algorithms for Supervised Learning / LO GERFO, L.; Rosasco, Lorenzo; Odone, Francesca; DE VITO, Ernesto; Verri, Alessandro. - In: NEURAL COMPUTATION. - ISSN 0899-7667. - STAMPA. - 20(7)(2008), pp. 1873-1897. |
| Abstract: | We discuss how a large class of regularization methods, collectively known as spectral regularization and originally designed for solving ill- posed inverse problems, gives rise to regularized learning algorithms. All these algorithms are consistent kernel methods which can be easily implemented. The intuition behind their derivation is that the same principle allowing to numerically stabilize a matrix inversion problem is crucial to avoid over-fitting. The various methods have a common derivation, but different computational and theoretical properties. We describe examples of such algorithms, analyzing their classification performance on several datasets and discussing their applicability to real world problems. |
| Handle: | http://hdl.handle.net/11567/250388 |
| Appare nelle tipologie: | 01.01 - Articolo su rivista |
File in questo prodotto:
Copyright © 2021