Pith. sign in

REVIEW 3 cited by

Revisiting Fine-tuning for Few-shot Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.00216 v2 pith:DOSRWWKC submitted 2019-10-01 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords learningaccuracyfew-shotalgorithmsexamplesfine-tuningmethodnovel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Few-shot learning is the process of learning novel classes using only a few examples and it remains a challenging task in machine learning. Many sophisticated few-shot learning algorithms have been proposed based on the notion that networks can easily overfit to novel examples if they are simply fine-tuned using only a few examples. In this study, we show that in the commonly used low-resolution mini-ImageNet dataset, the fine-tuning method achieves higher accuracy than common few-shot learning algorithms in the 1-shot task and nearly the same accuracy as that of the state-of-the-art algorithm in the 5-shot task. We then evaluate our method with more practical tasks, namely the high-resolution single-domain and cross-domain tasks. With both tasks, we show that our method achieves higher accuracy than common few-shot learning algorithms. We further analyze the experimental results and show that: 1) the retraining process can be stabilized by employing a low learning rate, 2) using adaptive gradient optimizers during fine-tuning can increase test accuracy, and 3) test accuracy can be improved by updating the entire network when a large domain-shift exists between base and novel classes.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Beyond Class Tokens: LLM-guided Dominant Property Mining for Few-shot Classification

    cs.CV 2025-07 conditional novelty 6.0 of 10

    BCT-CLIP improves few-shot CLIP classification by aligning learned patch-aware property tokens with LLM-selected dominant property descriptions and combining them with class-token caches.

  2. KptLLM++: Towards Generic Keypoint Comprehension with Large Language Model

    cs.CV 2025-07 conditional novelty 4.0 of 10

    KptLLM++ unifies keypoint semantic understanding, visual-prompt detection, and text-prompt detection in a single multimodal LLM, reporting SOTA accuracy on COCO, AP-10K, Human-Art, and other benchmarks.

  3. Few-Shot Generalized Category Discovery With Retrieval-Guided Decision Boundary Enhancement

    cs.CV 2025-06 conditional novelty 4.0 of 10

    FSGCD introduces the few-shot generalized category discovery setting and a retrieval-guided decision boundary enhancement framework that reportedly outperforms prior GCD models on six benchmarks.

Pith tools