Multi-task learning holds the promise of less data, parameters, and time than training of separate models. We propose a method to automatically search over multi-task architectures while taking resource constraints into consideration. We propose a search space that compactly represents different parameter sharing strategies. This provides more effective coverage and sampling of the space of multi-task architectures. We also present a method for quick evaluation of different architectures by using feature distillation. Together these contributions allow us to quickly optimize for efficient multi-task models. We benchmark on Visual Decathlon, demonstrating that we can automatically search for and identify multi-task architectures that effectively make trade-offs between task resource requirements while achieving a high level of final performance.
Divide and Predict: An Architecture for Input Space Partitioning and Enhanced Accuracy
Biocomplexity Institute, University of Virginia(弗吉尼亚大学生物复杂性研究所);Department of Systems and Information Engineering, University of Virginia(弗吉尼亚大学系统与信息工程系);Department of Mathematics, University of Virginia(弗吉尼亚大学数学系)
Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution
College of Software, Jilin University(吉林大学软件学院);College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院);Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University(教育部符号计算与知识工程重点实验室,吉林大学);School of Computer Science, Zhuhai College of Science and Technology(珠海科技学院计算机科学学院);College of Computer Science and Technology, Dalian University of Technology(大连理工大学计算机科学与技术学院);Department of Mechanical Engineering, National University of Singapore(新加坡国立大学机械工程系)
Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications to Parallel Machine Learning and Multi-Label Image Segmentation