持续学习-Towards reusable network components by learning compatible representations-arxiv2020

在这里插入图片描述

Abstract

This paper proposed to make a first step towards compatible and hence reusable network components. Split a network into two components: a feature extractor and a target task head. 最终验证在三个应用上,unsupervised domain adaptation, transferring classifiers across feature extractors with different architectures, and increasing the computational efficiency of transfer learning.(对应的三个任务为domain adaptation, classifier transferability and efficient transfer learning)

Introduction

We believe that a general way to achieve network reusability is to build a large library of compatible components which are specialized for different tasks;
We make a first step in this direction by devising a training procedure to make the feature representations learnt on different tasks become compatible, without any post-hoc fine-tuning;
The compatibility of components saves the designer the effort to make them work together in a new combination, so they are free to focus on designing ever more complex models.
We say two networks are compatible if we can recombine the feature extractor of one network with the task head of the other while still producing good predictions, directly without any fine-tuning after recombination;

Method

Sec.3 introduce three ways to alter the training procedure of neural networks to encourage compatibility. Compatibility的定义和讨论:
在这里插入图片描述

Conclusion

We have demonstrated that we can train networks to produce compatible features, without compromising accuracy on the original tasks.
Key points: 提了一个新步骤,学习一堆兼容性强的网络组件;针对每个任务只需要组合这些组件;如何定义compatible,全文围绕compatibility来写(方法布局和实验部分布局);

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值