Return
A theoretical framework for supervised learning from regions
DOI:10.1016/j.neucom.2012.06.065.png)
Abstract
En 中文
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. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Supervised learning
Kernel machines
Propositional rules
Variational calculus
Infinite-dimensional optimization
Representer theorems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W

