LGCVMLFeb 27, 2020

Meta-Learned Confidence for Few-shot Learning

arXiv:2002.12017v224 citationsHas Code
AI Analysis

This work addresses a key bottleneck in few-shot learning for researchers and practitioners by improving transductive inference reliability, though it is incremental as it builds on existing metric-based methods.

The paper tackles the problem of unreliable model confidence in transductive few-shot learning by meta-learning an input-adaptive distance metric to assign optimal weights to unlabeled queries, resulting in state-of-the-art performance on four benchmark datasets and significant improvements in semi-supervised tasks.

Transductive inference is an effective means of tackling the data deficiency problem in few-shot learning settings. A popular transductive inference technique for few-shot metric-based approaches, is to update the prototype of each class with the mean of the most confident query examples, or confidence-weighted average of all the query samples. However, a caveat here is that the model confidence may be unreliable, which may lead to incorrect predictions. To tackle this issue, we propose to meta-learn the confidence for each query sample, to assign optimal weights to unlabeled queries such that they improve the model's transductive inference performance on unseen tasks. We achieve this by meta-learning an input-adaptive distance metric over a task distribution under various model and data perturbations, which will enforce consistency on the model predictions under diverse uncertainties for unseen tasks. Moreover, we additionally suggest a regularization which explicitly enforces the consistency on the predictions across the different dimensions of a high-dimensional embedding vector. We validate our few-shot learning model with meta-learned confidence on four benchmark datasets, on which it largely outperforms strong recent baselines and obtains new state-of-the-art results. Further application on semi-supervised few-shot learning tasks also yields significant performance improvements over the baselines. The source code of our algorithm is available at https://github.com/seongmin-kye/MCT.

Code Implementations1 repo
Foundations

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

Your Notes