Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learning
Clemens Rosenbaum Affiliation: College of Information and Computer Sciences Affiliation: University of Massachusetts Amherst Affiliation: 140 Governors Dr., Amherst, MA 01003 Email: Tim Klinger、Matthew Riemer Affiliation: IBM Research AI Affiliation: 1101 Kitchawan Rd, Yorktown Heights, NY 10598 Email:
Abstract
Multi-task learning (MTL) with neural networks leverages commonalities in tasks to improve performance, but often suffers from task interference which reduces the benefits of transfer. To address this issue we introduce the routing network paradigm, a novel neural network and training algorithm. A routing network is a kind of self-organizing neural network consisting of two components: a router and a set of one or more function blocks. A function block may be any neural network – for example a fully-connected or a convolutional layer. Given an input the router makes a routing decision, choosing a function block to apply and passing the output back to the router recursively, terminating when a fixed recursion depth is reached. In this way the routing network dynamically composes different function blocks for each input. We employ a collaborative multi-agent reinforcement learning (MARL) approach to jointly train the router and function blocks. We evaluate our model against cross-stitch networks and shared-layer baselines on multi-task settings of the MNIST, mini-imagenet, and CIFAR-100 datasets. Our experiments demonstrate a significant improvement in accuracy, with sharper converge
原文 arXiv:1711.01239;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1711.01239v2