The reviewed record of science sign in
Pith

arxiv: 2008.10292 · v2 · pith:6BLF423S · submitted 2020-08-24 · cs.CV

Automated Search for Resource-Efficient Branched Multi-Task Networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:6BLF423Srecord.jsonopen to challenge →

classification cs.CV
keywords neuralapproacharchitecturearchitecturesbranchingmulti-tasknetworksearch
0
0 comments X
read the original abstract

The multi-modal nature of many vision problems calls for neural network architectures that can perform multiple tasks concurrently. Typically, such architectures have been handcrafted in the literature. However, given the size and complexity of the problem, this manual architecture exploration likely exceeds human design abilities. In this paper, we propose a principled approach, rooted in differentiable neural architecture search, to automatically define branching (tree-like) structures in the encoding stage of a multi-task neural network. To allow flexibility within resource-constrained environments, we introduce a proxyless, resource-aware loss that dynamically controls the model size. Evaluations across a variety of dense prediction tasks show that our approach consistently finds high-performing branching structures within limited resource budgets.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.