UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Unveiling Groups of Related Tasks in Multi - Task Learning

Frecon, Jordan; Salzo, Saverio; Pontil, Massimiliano; (2021) Unveiling Groups of Related Tasks in Multi - Task Learning. In: 2020 25th International Conference on Pattern Recognition (ICPR). (pp. pp. 7134-7141). IEEE: Milan, Italy. Green open access

[thumbnail of Frecon_preprint_Unveiling_2020.pdf]
Preview
PDF
Frecon_preprint_Unveiling_2020.pdf - Accepted Version

Download (2MB) | Preview

Abstract

A common approach in multi-task learning is to encourage the tasks to share a low dimensional representation. This has led to the popular method of trace norm regularization, which has proved effective in many applications. In this paper, we extend this approach by allowing the tasks to partition into different groups, within which trace norm regularization is separately applied. We propose a continuous bilevel optimization framework to simultaneously identify groups of related tasks and learn a low dimensional representation within each group. Hinging on recent results on the derivative of generalized matrix functions, we devise a smooth approximation of the upper-level objective via a dual forward-backward algorithm with Bregman distances. This allows us to solve the bilevel problem by a gradient-based scheme. Numerical experiments on synthetic and benchmark datasets support the effectiveness of the proposed method.

Type: Proceedings paper
Title: Unveiling Groups of Related Tasks in Multi - Task Learning
Event: 25th International Conference on Pattern Recognition (ICPR)
Location: ELECTR NETWORK
Dates: 10 Jan 2021 - 15 Jan 2021
ISBN-13: 978-1-7281-8808-9
Open access status: An open access version is available from UCL Discovery
DOI: 10.1109/ICPR48806.2021.9413274
Publisher version: https://doi.org/10.1109/icpr48806.2021.9413274
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Benchmark testing, Approximation algorithms, Pattern recognition, Computational efficiency, Task analysis, Optimization, Standards
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/10214218
Downloads since deposit
4Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item