Supervised learning is investigated, when the data are represented not only by labeled points but also labeled regions of the input space. In the limit case, such regions degenerate to single points and the proposed approach changes back to the classical learning context. The adopted framework entails the minimization of a functional obtained by introducing a loss function that involves such regions. An additive regularization term is expressed via differential operators that model the smoothness properties of the desired input/output relationship. Representer theorems are given, proving that the optimization problem associated to learning from labeled regions has a unique solution, which takes on the form of a linear combination of kernel functions determined by the differential operators together with the regions themselves. As a relevant situation, the case of regions given by multi-dimensional intervals (i.e., "boxes") is investigated, which models prior knowledge expressed by logical propositions. © 2013 Elsevier B.V.

A Theoretical Framework for Supervised Learning from Regions

Gnecco G;
2014-01-01

Abstract

Supervised learning is investigated, when the data are represented not only by labeled points but also labeled regions of the input space. In the limit case, such regions degenerate to single points and the proposed approach changes back to the classical learning context. The adopted framework entails the minimization of a functional obtained by introducing a loss function that involves such regions. An additive regularization term is expressed via differential operators that model the smoothness properties of the desired input/output relationship. Representer theorems are given, proving that the optimization problem associated to learning from labeled regions has a unique solution, which takes on the form of a linear combination of kernel functions determined by the differential operators together with the regions themselves. As a relevant situation, the case of regions given by multi-dimensional intervals (i.e., "boxes") is investigated, which models prior knowledge expressed by logical propositions. © 2013 Elsevier B.V.
2014
Infinite-dimensional optimization; Kernel machines; Propositional rules; Representer theorems; Supervised learning; Variational calculus;
File in questo prodotto:
File Dimensione Formato  
NEC.pdf

non disponibili

Licenza: Non specificato
Dimensione 564.64 kB
Formato Adobe PDF
564.64 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Neurocomputing_Preprint_Gnecco.pdf

accesso aperto

Tipologia: Documento in Pre-print
Licenza: Creative commons
Dimensione 231.74 kB
Formato Adobe PDF
231.74 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11771/6580
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
social impact