Convex Learning of Multiple Tasks and their Structure

By Carlo Ciliberto, Youssef Mroueh, Tomaso A. Poggio, Lorenzo Rosasco. 2015

70 citations recorded by the source corpus.

Reducing the amount of human supervision is a key problem in machine learning and a natural approach is that of exploiting the relations (structure) among different tasks. This is the idea at the core of multi-task learning. In this context a fundamental question is how to incorporate the tasks structure in the learning problem. We tackle this question by studying a general computational framework that allows to encode apriori knowledge of the tasks structure in the form of a convex penalty; in this setting a variety of previously proposed methods can be recovered as special cases, including linear and non-linear approaches. Within this framework, we show that tasks and their structure can be efficiently learned considering a convex optimization problem that can be approached by means of block coordinate methods such as alternating minimization and for which we prove convergence to the global minimum.

Subfields: Artificial Intelligence, Computational Mechanics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Qiang Yang
  2. Mingsheng Long
  3. Jianmin Wang
  4. Zhangjie Cao
  5. Yu Zhang
  6. Bernt Schiele
  7. Philip S. Yu
  8. Kate Saenko

In Computational Mechanics

  1. Qiang Yang
  2. Yu Zhang
  3. Bernt Schiele
  4. Matthias Hein
  5. Maksim Lapin
  6. Philip S. Yu
  7. Pratik Jawanpuria
  8. Jianmin Wang

Citations in the corpus