In this paper, we focus on multitask learning and discuss the notion of learning from constraints, in which they limit the space of admissible real values of the task functions. We formulate learning as a variational problem and analyze convex constraints, with special attention to the case of linear bilateral and unilateral constraints. Interestingly, we show that the solution is not always an analytic function and that it cannot be expressed by the classic kernel expansion on the training examples. We provide exact and approximate solutions and report experimental evidence of the improvement with respect to classic kernel machines. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gori, M., & Melacci, S. (2010). Learning with convex constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6354 LNCS, pp. 315–320). https://doi.org/10.1007/978-3-642-15825-4_41
Mendeley helps you to discover research relevant for your work.