LGCVROMLJan 19, 2020

Gradient Surgery for Multi-Task Learning

arXiv:2001.06782v41863 citations
AI Analysis

This addresses optimization challenges in multi-task learning for AI systems, offering a model-agnostic solution to enhance data efficiency, though it is incremental as it builds on existing multi-task architectures.

The paper tackles the problem of detrimental gradient interference in multi-task learning, which hinders efficiency gains, by proposing gradient surgery to project conflicting gradients, resulting in substantial improvements in efficiency and performance on challenging supervised and reinforcement learning tasks.

While deep learning and deep reinforcement learning (RL) systems have demonstrated impressive results in domains such as image classification, game playing, and robotic control, data efficiency remains a major challenge. Multi-task learning has emerged as a promising approach for sharing structure across multiple tasks to enable more efficient learning. However, the multi-task setting presents a number of optimization challenges, making it difficult to realize large efficiency gains compared to learning tasks independently. The reasons why multi-task learning is so challenging compared to single-task learning are not fully understood. In this work, we identify a set of three conditions of the multi-task optimization landscape that cause detrimental gradient interference, and develop a simple yet general approach for avoiding such interference between task gradients. We propose a form of gradient surgery that projects a task's gradient onto the normal plane of the gradient of any other task that has a conflicting gradient. On a series of challenging multi-task supervised and multi-task RL problems, this approach leads to substantial gains in efficiency and performance. Further, it is model-agnostic and can be combined with previously-proposed multi-task architectures for enhanced performance.

Code Implementations18 repos

Data from Papers with Code (CC-BY-SA-4.0)

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes