Pith. sign in

REVIEW 3 cited by

Learning to Propagate Labels: Transductive Propagation Network 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 1805.10002 v5 pith:NWY7M4H4 submitted 2018-05-25 cs.LG cs.CVcs.NEstat.ML

classification cs.LGcs.CVcs.NEstat.ML
keywords learningfew-shotinstancesmeta-learningproblemtransductiveapproachesclassification
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The goal of few-shot learning is to learn a classifier that generalizes well even when trained with a limited number of training instances per class. The recently introduced meta-learning approaches tackle this problem by learning a generic classifier across a large number of multiclass classification tasks and generalizing the model to a new task. Yet, even with such meta-learning, the low-data problem in the novel classification task still remains. In this paper, we propose Transductive Propagation Network (TPN), a novel meta-learning framework for transductive inference that classifies the entire test set at once to alleviate the low-data problem. Specifically, we propose to learn to propagate labels from labeled instances to unlabeled test instances, by learning a graph construction module that exploits the manifold structure in the data. TPN jointly learns both the parameters of feature embedding and the graph construction in an end-to-end manner. We validate TPN on multiple benchmark datasets, on which it largely outperforms existing few-shot learning approaches and achieves the state-of-the-art results.

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. ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions

    cs.LG 2025-07 conditional novelty 6.0 of 10

    A reparameterized masked diffusion model with variational EM gives scalable structured node classification, matching or beating GNN, label propagation, and continuous diffusion baselines.

  2. Language-Aware Information Maximization for Transductive Few-Shot CLIP

    cs.CV 2025-08 conditional novelty 5.0 of 10

    LIMO, a transductive loss combining mutual information, zero-shot KL regularization, and LoRA, sets new state-of-the-art few-shot accuracy for CLIP on 11 datasets.

  3. ViT-ProtoNet for Few-Shot Image Classification: A Multi-Benchmark Evaluation

    cs.CV 2025-07 reject novelty 2.0 of 10

    ViT-ProtoNet, a Prototypical Network with a ViT-Small encoder, is reported to reach 95-97% 5-shot accuracy on three benchmarks and 81.88% on FC100, but the evaluation lacks critical baselines.

Pith tools