arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.01495cs.LG
收藏

基于Meta-对比学习的任务自适应神经网络搜索

Task-Adaptive Neural Network Search with Meta-Contrastive Learning

KAIST(韩国科学技术院);AITRICS;Samsung(三星)

Wonyong Jeong, Hayeon Lee, Gun Park, Eunyoung Hyung, Jinheon Baek, Sung Ju Hwang

摘要:

大多数传统的神经结构搜索(NAS)方法的局限性在于,它们只生成结构,而不搜索最佳参数。虽然一些NAS方法通过利用在大规模数据集(如ImageNet)上训练的超网来处理这个问题,但如果目标任务与超网训练的数据集高度不相似,则它们可能是次优的。为了解决这些限制,我们引入了一个新的问题\emph{Neural Network Search}(NNS),其目标是为新的数据集和约束搜索最优的预训练网络(例如参数的数量),来自模型动物园。然后,我们提出了一个新的框架来解决这个问题,即\emph{Task-Adaptive Neural Network Search}(TANS)。给定一个由在不同数据集上预训练的网络组成的模型动物园,我们使用一种新的摊销元学习框架来学习具有对比损失的跨模态潜在空间,以最大化数据集与其上的高性能网络之间的相似性,并最小化不相关的网络-网络对之间的相似性。我们验证了我们的方法的有效性和效率在十个现实世界的数据集,对现有的NAS/AutoML基线。结果表明,我们的方法可以立即检索出性能优于基线模型的网络,并且训练步骤明显减少,从而达到目标性能,从而最大限度地降低了获得任务最优网络的总成本。我们的代码和模型动物园可以在https://github.com/wyjeong/TANS上找到。

英文摘要:

Most conventional Neural Architecture Search (NAS) approaches are limited in that they only generate architectures without searching for the optimal parameters. While some NAS methods handle this issue by utilizing a supernet trained on a large-scale dataset such as ImageNet, they may be suboptimal if the target tasks are highly dissimilar from the dataset the supernet is trained on. To address such limitations, we introduce a novel problem of \emph{Neural Network Search} (NNS), whose goal is to search for the optimal pretrained network for a novel dataset and constraints (e.g. number of parameters), from a model zoo. Then, we propose a novel framework to tackle the problem, namely \emph{Task-Adaptive Neural Network Search} (TANS). Given a model-zoo that consists of network pretrained on diverse datasets, we use a novel amortized meta-learning framework to learn a cross-modal latent space with contrastive loss, to maximize the similarity between a dataset and a high-performing network on it, and minimize the similarity between irrelevant dataset-network pairs. We validate the effectiveness and efficiency of our method on ten real-world datasets, against existing NAS/AutoML baselines. The results show that our method instantly retrieves networks that outperform models obtained with the baselines with significantly fewer training steps to reach the target performance, thus minimizing the total cost of obtaining a task-optimal network. Our code and the model-zoo are available at https://github.com/wyjeong/TANS.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑