Pith. sign in

REVIEW 8 cited by

Learning from Few Examples: A Summary of Approaches to 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 2203.04291 v1 pith:GK373A67 submitted 2022-03-07 cs.LG cs.CV

classification cs.LGcs.CV
keywords learningdatafew-shotapproachesproblemsamplestimealgorithms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Few-Shot Learning refers to the problem of learning the underlying pattern in the data just from a few training samples. Requiring a large number of data samples, many deep learning solutions suffer from data hunger and extensively high computation time and resources. Furthermore, data is often not available due to not only the nature of the problem or privacy concerns but also the cost of data preparation. Data collection, preprocessing, and labeling are strenuous human tasks. Therefore, few-shot learning that could drastically reduce the turnaround time of building machine learning applications emerges as a low-cost solution. This survey paper comprises a representative list of recently proposed few-shot learning algorithms. Given the learning dynamics and characteristics, the approaches to few-shot learning problems are discussed in the perspectives of meta-learning, transfer learning, and hybrid approaches (i.e., different variations of the few-shot learning problem).

Discussion (0). Sign in to comment.

Forward citations

Cited by 8 Pith papers

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

  1. Test-Time Scaling via Error Localization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    TTEL uses feedback-induced token probability drops to localize the first error in a failed reasoning trace and branch a new generation from that prefix, improving pass@k per token on coding and math benchmarks.

  2. SGAgent: Suggestion-Guided LLM-Based Multi-Agent Framework for Repository-Level Software Repair

    cs.SE 2026-02 conditional novelty 6.0 of 10

    A three-agent locate-suggest-fix framework with a knowledge-graph toolkit resolves 154/300 SWE-Bench-Lite issues with Claude-3.5, outperforming same-model baselines by 5-10 points.

  3. Exploring Pre-training Across Domains for Few-Shot Surgical Skill Assessment

    cs.CV 2025-09 conditional novelty 6.0 of 10

    For few-shot surgical skill assessment, pre-training on small but domain-relevant surgery videos outperforms large-scale, less aligned datasets, and mixing procedure-specific data only helps when the external source i...

  4. Frame-Level Real-Time Assessment of Stroke Rehabilitation Exercises from Video-Level Labeled Data: Task-Specific vs. Foundation Models

    eess.IV 2025-06 conditional novelty 5.0 of 10

    Using gradient saliency and pretrained video/time-series models, frame-level stroke exercise quality can be learned from video-level labels, with the best configuration reaching 72% AUC versus 69% for a ground-truth-t...

  5. SAM$^{*}$: Task-Adaptive SAM with Physics-Guided Rewards

    cs.CV 2025-09 reject novelty 4.0 of 10

    Reward-guided hyperparameter search turns SAM into a task-specific microscope-particle segmenter, with validation limited to single images and no ground truth.

  6. Machine Learning Methods for Small Data and Upstream Bioprocessing Applications: A Comprehensive Review

    cs.LG 2025-06 accept novelty 4.0 of 10

    The paper's new contribution is a taxonomy that organizes small-data ML methods by ML lifecycle stage rather than by technique.

  7. Augmenting Large Language Models with Static Code Analysis for Automated Code Quality Improvements

    cs.SE 2025-06 conditional novelty 3.0 of 10

    Generating fixes with GPT-3.5 Turbo and GPT-4o, prompted with SonarQube findings and web-retrieved examples, removed most flagged bugs, vulnerabilities, and code smells from one codebase, with success judged solely by...

  8. Thinking Beyond Tokens: From Brain-Inspired Intelligence to Cognitive Foundations for Artificial General Intelligence and its Societal Impact

    cs.AI 2025-07 conditional novelty 2.0 of 10

    A broad survey arguing that AGI requires modular, memory-augmented, embodied architectures rather than scaled-up token prediction, with a brief proposal to decompose intelligence into five components.

Pith tools