Scheduled sampling for one-shot learning via matching network

作者:

Highlights:

• A scheduled sampling strategy is introduced to adjust the training procedure of matching network, which accomplishes to learn the ability for one-shot prediction from easy to difficult.

• We propose a novel metric to measure the difficulty of training samples, which jointly considers the diversity and similarity among the labels’ semantic. Samples with high-difficulty values are more difficult to learn for the matching network.

• We conduct extensive experiments on datasets mini-Imagenet, Birds, and Flowers to illustrate the effectiveness and superiority of the proposed method. The experimental results demonstrate that our method consistently outperforms other competitors.

摘要

•A scheduled sampling strategy is introduced to adjust the training procedure of matching network, which accomplishes to learn the ability for one-shot prediction from easy to difficult.•We propose a novel metric to measure the difficulty of training samples, which jointly considers the diversity and similarity among the labels’ semantic. Samples with high-difficulty values are more difficult to learn for the matching network.•We conduct extensive experiments on datasets mini-Imagenet, Birds, and Flowers to illustrate the effectiveness and superiority of the proposed method. The experimental results demonstrate that our method consistently outperforms other competitors.

论文关键词:Scheduled sampling,Matching network,From easy to difficult,One-shot learning,Difficulty metric

论文评审过程:Received 9 November 2018, Revised 12 May 2019, Accepted 8 July 2019, Available online 15 July 2019, Version of Record 19 July 2019.

论文官网地址:https://doi.org/10.1016/j.patcog.2019.07.007