Pith. sign in

REVIEW 2 cited by

Self-supervised Knowledge Distillation 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 2006.09785 v2 pith:ERFNYD3K submitted 2020-06-17 cs.CV

classification cs.CV
keywords learningdistillationembeddingfeaturefew-shotself-supervisedstageentropy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Real-world contains an overwhelmingly large number of object classes, learning all of which at once is infeasible. Few shot learning is a promising learning paradigm due to its ability to learn out of order distributions quickly with only a few samples. Recent works [7, 41] show that simply learning a good feature embedding can outperform more sophisticated meta-learning and metric learning algorithms for few-shot learning. In this paper, we propose a simple approach to improve the representation capacity of deep neural networks for few-shot learning tasks. We follow a two-stage learning process: First, we train a neural network to maximize the entropy of the feature embedding, thus creating an optimal output manifold using a self-supervised auxiliary loss. In the second stage, we minimize the entropy on feature embedding by bringing self-supervised twins together, while constraining the manifold with student-teacher distillation. Our experiments show that, even in the first stage, self-supervision can outperform current state-of-the-art methods, with further gains achieved by our second stage distillation process. Our codes are available at: https://github.com/brjathu/SKD.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Revisiting Pool-based Prompt Learning for Few-shot Class-incremental Learning

    cs.CV 2025-07 conditional novelty 6.0 of 10

    LGSP-Prompt replaces token-dimension prompt pools with local and global spatial prompts, reporting state-of-the-art accuracy on CUB-200, FGVCAircraft, and iNF200 FSCIL benchmarks.

  2. ANROT-HELANet: Adverserially and Naturally Robust Attention-Based Aggregation Network via The Hellinger Distance for Few-Shot Classification

    cs.CV 2025-09 reject novelty 3.0 of 10

    ANROT-HELANet combines Hellinger aggregation, attention, and FGSM/Gaussian robust training for few-shot classification, but its ELBO derivation is invalid and its performance claims are overstated.

Pith tools