A learning paradigm is proposed and investigated, in which the classical framework of learning from examples is enhanced by the introduction of hard pointwise constraints, i.e., constraints imposed on a finite set of examples that cannot be violated. Such constraints arise, e.g., when requiring coherent decisions of classifiers acting on different views of the same pattern. The classical examples of supervised learning, which can be violated at the cost of some penalization (quantified by the choice of a suitable loss function) play the role of soft pointwise constraints. Constrained variational calculus is exploited to derive a representer theorem that provides a description of the functional structure of the optimal solution to the proposed learning paradigm. It is shown that such an optimal solution can be represented in terms of a set of support constraints, which generalize the concept of support vectors and open the doors to a novel learning paradigm, called support constraint machines. The general theory is applied to derive the representation of the optimal solution to the problem of learning from hard linear pointwise constraints combined with soft pointwise constraints induced by supervised examples. In some cases, closed-form optimal solutions are obtained.
|Titolo:||Learning with mixed hard/soft pointwise constraints|
|Citazione:||Gnecco, G., Gori, M., Melacci, S., & Sanguineti, M. (2015). Learning with mixed hard/soft pointwise constraints. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 29(9), 2019-2032.|
|Appare nelle tipologie:||1.1 Articolo in rivista|