Pith. sign in

REVIEW 23 cited by

Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing

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 2107.13586 v1 pith:QVMUDD26 submitted 2021-07-28 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords languagemodellearningexistingmodelsprompt-basedfinalinput
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper surveys and organizes research works in a new paradigm in natural language processing, which we dub "prompt-based learning". Unlike traditional supervised learning, which trains a model to take in an input x and predict an output y as P(y|x), prompt-based learning is based on language models that model the probability of text directly. To use these models to perform prediction tasks, the original input x is modified using a template into a textual string prompt x' that has some unfilled slots, and then the language model is used to probabilistically fill the unfilled information to obtain a final string x, from which the final output y can be derived. This framework is powerful and attractive for a number of reasons: it allows the language model to be pre-trained on massive amounts of raw text, and by defining a new prompting function the model is able to perform few-shot or even zero-shot learning, adapting to new scenarios with few or no labeled data. In this paper we introduce the basics of this promising paradigm, describe a unified set of mathematical notations that can cover a wide variety of existing work, and organize existing work along several dimensions, e.g.the choice of pre-trained models, prompts, and tuning strategies. To make the field more accessible to interested beginners, we not only make a systematic review of existing works and a highly structured typology of prompt-based concepts, but also release other resources, e.g., a website http://pretrain.nlpedia.ai/ including constantly-updated survey, and paperlist.

Discussion (0). Sign in to comment.

Forward citations

Cited by 23 Pith papers

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

  1. Chain-of-Thought Prompting Elicits Reasoning in Large Language Models

    cs.CL 2022-01 accept novelty 9.0 of 10

    Chain-of-thought prompting, by including intermediate reasoning steps in few-shot examples, elicits strong reasoning abilities in large language models on arithmetic, commonsense, and symbolic tasks.

  2. PAL: Program-aided Language Models

    cs.CL 2022-11 conditional novelty 8.0 of 10

    PAL improves few-shot reasoning accuracy by having LLMs generate executable programs rather than text-based chains of thought, outperforming much larger models on math and logic benchmarks.

  3. Structure Before Collapse: Transient semantic geometry in next-token prediction

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    Semantic geometry emerges transiently early in next-token prediction training before collapsing to Neural Collapse symmetry in synthetic settings with latent semantic factors.

  4. Self-Harness: Harnesses That Improve Themselves

    cs.CL 2026-06 unverdicted novelty 7.0 of 10

    Self-Harness lets LLM agents autonomously refine their interaction harnesses through weakness mining, proposal generation, and validation, raising held-out pass rates on Terminal-Bench-2.0 from 40.5% to 61.9%, 23.8% t...

  5. Graph Topology Information Enhanced Heterogeneous Graph Representation Learning

    cs.LG 2026-04 unverdicted novelty 7.0 of 10

    ToGRL learns high-quality graph structures from raw heterogeneous graphs via a two-stage topology extraction process and prompt tuning, outperforming prior methods on five datasets.

  6. SkVM: Revisiting Language VM for Skills across Heterogenous LLMs and Harnesses

    cs.SE 2026-04 unverdicted novelty 7.0 of 10

    SkVM uses capability profiling and compiler-style techniques to make skills portable across LLMs and harnesses, raising task completion rates while cutting token use by up to 40% and delivering up to 3.2x speedup.

  7. LLM4Log: A Systematic Review of Large Language Model-based Log Analysis

    cs.SE 2026-03 accept novelty 7.0 of 10

    LLM4Log is a systematic review of 145 papers on LLM-based log analysis that delivers a unified taxonomy, design patterns, and open challenges for reliable adoption in AIOps.

  8. OPT: Open Pre-trained Transformer Language Models

    cs.CL 2022-05 unverdicted novelty 7.0 of 10

    OPT releases open decoder-only transformers up to 175B parameters that match GPT-3 performance at one-seventh the carbon cost, along with code and training logs.

  9. Cross-Task Generalization via Natural Language Crowdsourcing Instructions

    cs.CL 2021-04 conditional novelty 7.0 of 10

    Presents the NATURAL INSTRUCTIONS meta-dataset and shows generative pre-trained language models achieve 19% better generalization to unseen tasks when using task instructions.

  10. LLM-as-a-Coach: Experiential Learning for Non-Verifiable Tasks

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Training a language model by distilling a coach's written experiential knowledge beats training on a scalar rubric score for open-ended tasks, with better out-of-distribution transfer.

  11. CRAFT: Cost-aware Refinement And Front-aware Tuning of Prompts

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    CRAFT is a Pareto-front prompt optimizer that allocates scarce LLM validation calls to candidates near the current front using accuracy- and cost-oriented generators plus NSGA-II retention.

  12. Latent Diffusion Pretraining for Crystal Property Prediction

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    CrysLDNet combines VAE and latent diffusion pretraining on unlabeled crystals to improve graph encoder performance on property prediction by about 4-5% on JARVIS and MP datasets.

  13. PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts

    cs.CL 2026-05 unverdicted novelty 6.0 of 10

    PEML co-optimizes continuous prompts and low-rank adaptations to deliver up to 6.67% average accuracy gains over existing multi-task PEFT methods on GLUE, SuperGLUE, and other benchmarks.

  14. Memory in the LLM Era: Modular Architectures and Strategies in a Unified Framework

    cs.CL 2026-04 unverdicted novelty 6.0 of 10

    A unified framework for LLM agent memory is benchmarked, with a new hybrid method outperforming state-of-the-art on standard tasks.

  15. Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning

    cs.LG 2025-08 conditional novelty 6.0 of 10

    TAAM achieves replay-free, pre-training-free continual graph learning by routing each task to a small node-attentive modulator inserted into a frozen GNN.

  16. Towards an AI co-scientist

    cs.AI 2025-02 unverdicted novelty 6.0 of 10

    A multi-agent AI system generates novel biomedical hypotheses that show promising experimental validation in drug repurposing for leukemia, new targets for liver fibrosis, and a bacterial gene transfer mechanism.

  17. Towards Expert-Level Medical Question Answering with Large Language Models

    cs.CL 2023-05 unverdicted novelty 6.0 of 10

    Med-PaLM 2 achieves 86.5% accuracy on MedQA and approaches or exceeds prior state-of-the-art on other medical QA benchmarks while receiving higher physician preference ratings than human answers on consumer questions.

  18. Contextualized Early Detection of Online Firestorms: A Sequential LLM-Based Approach

    cs.AI 2026-07 conditional novelty 5.0 of 10

    An LLM judging sliding windows of Reddit threads can flag escalating firestorm threads early (recall 0.98 at a mean 8.56 comments) and classify complete threads retrospectively with 0.915 accuracy.

  19. STELLAR-E: a Synthetic, Tailored, End-to-end LLM Application Rigorous Evaluator

    cs.AI 2026-04 unverdicted novelty 5.0 of 10

    STELLAR-E modifies the TGRT Self-Instruct framework to produce tailored synthetic LLM evaluation datasets that score an average 5.7% higher on LLM-as-a-judge metrics than existing language-specific benchmarks.

  20. Sentiment Classification of Gaza War Headlines: A Comparative Analysis of Large Language Models and Arabic Fine-Tuned BERT Models

    cs.CL 2026-03 unverdicted novelty 5.0 of 10

    LLMs classify Gaza War headlines as strongly negative while fine-tuned Arabic BERT models favor neutral labels, producing measurable non-random divergences in sentiment distributions.

  21. PaLM 2 Technical Report

    cs.CL 2023-05 unverdicted novelty 5.0 of 10

    PaLM 2 reports state-of-the-art results on language, reasoning, and multilingual tasks with improved efficiency over PaLM.

  22. The Maskability Index: Predicting Task-Objective Alignment in Pretrained Language Models

    cs.CL 2026-07 conditional novelty 4.0 of 10

    A five-example DepthRank gap between masked and prefix templates sorts ATOMIC2020 relations into groups that match which prompt style generates better tails.

  23. LLM4Log: A Systematic Review of Large Language Model-based Log Analysis

    cs.SE 2026-03 unverdicted novelty 4.0 of 10

    Systematic review of 145 papers on LLM-based log analysis, providing a unified taxonomy, common design patterns, evaluation practices, and challenges for deployment under drift and limited labels.

Pith tools