LGCVMLMay 27, 2020

Looking back to lower-level information in few-shot learning

arXiv:2005.13638v2
AI Analysis

This work addresses the challenge of learning from limited data in few-shot classification, which is important for real-world applications, but it is incremental as it builds on existing graph-based meta-learning frameworks.

The paper tackles the problem of few-shot learning by proposing a method that uses lower-level feature embeddings from hidden neural network layers to improve classifier accuracy, achieving improved state-of-the-art performance on miniImageNet and tieredImageNet datasets.

Humans are capable of learning new concepts from small numbers of examples. In contrast, supervised deep learning models usually lack the ability to extract reliable predictive rules from limited data scenarios when attempting to classify new examples. This challenging scenario is commonly known as few-shot learning. Few-shot learning has garnered increased attention in recent years due to its significance for many real-world problems. Recently, new methods relying on meta-learning paradigms combined with graph-based structures, which model the relationship between examples, have shown promising results on a variety of few-shot classification tasks. However, existing work on few-shot learning is only focused on the feature embeddings produced by the last layer of the neural network. In this work, we propose the utilization of lower-level, supporting information, namely the feature embeddings of the hidden neural network layers, to improve classifier accuracy. Based on a graph-based meta-learning framework, we develop a method called Looking-Back, where such lower-level information is used to construct additional graphs for label propagation in limited data settings. Our experiments on two popular few-shot learning datasets, miniImageNet and tieredImageNet, show that our method can utilize the lower-level information in the network to improve state-of-the-art classification performance.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes