Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learning
Clemens Rosenbaum, Tim Klinger, Matthew Riemer

TL;DR
This paper introduces routing networks, a novel multi-task learning approach that dynamically selects neural network functions per input, improving accuracy and efficiency over existing methods.
Contribution
The paper proposes a self-organizing routing network with reinforcement learning for adaptive function selection in multi-task learning, reducing training time and task interference.
Findings
Significant accuracy improvements over baselines.
Nearly constant per-task training cost.
85% reduction in training time on CIFAR-100.
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)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and ELM · Adversarial Robustness in Machine Learning
