MétaCan
Menu
Back to cohort
Record W4312526008 · doi:10.1109/cvpr52688.2022.00888

Few-shot Learning with Noisy Labels

2022· article· en· W4312526008 on OpenAlexaff
Kevin J Liang, Samrudhdhi B. Rangrej, Vladan Petrović, Tal Hassner

Bibliographic record

Venue2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · 2022
Typearticle
Languageen
FieldComputer Science
TopicDomain Adaptation and Few-Shot Learning
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceRobustness (evolution)Artificial intelligenceMachine learningTransformerSingle shotPattern recognition (psychology)Engineering

Abstract

fetched live from OpenAlex

Few-shot learning (FSL) methods typically assume clean support sets with accurately labeled samples when training on novel classes. This assumption can often be unrealistic: support sets, no matter how small, can still include mislabeled samples. Robustness to label noise is therefore essential for FSL methods to be practical, but this problem surprisingly remains largely unexplored. To address mislabeled samples in FSL settings, we make several technical contributions. (1) We offer simple, yet effective, feature aggregation methods, improving the prototypes used by ProtoNet, a popular FSL technique. (2) We describe a novel Transformer model for Noisy Few-Shot Learning (TraNFS). TraNFS leverages a transformer's attention mechanism to weigh mislabeled versus correct samples. (3) Finally, we extensively test these methods on noisy versions of MinilmageNet and TieredImageNet. Our results show that TraNFS is on-par with leading FSL methods on clean support sets, yet outperforms them, by far, in the presence of label noise.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.015
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.005
Open science0.0050.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0030.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.052
GPT teacher head0.267
Teacher spread0.216 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations46
Published2022
Admission routes1
Has abstractyes

Explore more

Same venue2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)Same topicDomain Adaptation and Few-Shot LearningFrench-language works237,207