Pith. sign in

REVIEW 5 cited by

Pre-trained Models for Natural Language Processing: A Survey

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2003.08271 v4 pith:4ULCNCCL submitted 2020-03-18 cs.CL cs.LG

Xipeng Qiu , Tianxiang Sun , Yige Xu , Yunfan Shao , Ning Dai , Xuanjing Huang This is my paper · ORCID
classification cs.CLcs.LG
keywords ptmslanguagesurveymodelsnaturalpre-trainedprocessingresearch
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, the emergence of pre-trained models (PTMs) has brought natural language processing (NLP) to a new era. In this survey, we provide a comprehensive review of PTMs for NLP. We first briefly introduce language representation learning and its research progress. Then we systematically categorize existing PTMs based on a taxonomy with four perspectives. Next, we describe how to adapt the knowledge of PTMs to the downstream tasks. Finally, we outline some potential directions of PTMs for future research. This survey is purposed to be a hands-on guide for understanding, using, and developing PTMs for various NLP tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Densing Law of LLMs

    cs.AI 2024-12 reject novelty 6.0 of 10

    Maximum LLM capability per parameter, measured on five benchmarks, has grown exponentially, doubling about every three months.

  2. GraphTheft: Quantifying Privacy Risks in Graph Prompt Learning

    cs.CR 2024-11 conditional novelty 6.0 of 10

    An empirical study showing that graph prompt learning exposes node attributes and links to inference attacks, with prompt tuning adding little extra risk over frozen GNN baselines.

  3. Rethinking negative sampling in content-based news recommendation

    cs.IR 2024-11 conditional novelty 6.0 of 10

    A per-user news recommender with farthest-item negative sampling in embedding space matches the offline accuracy of larger models and enables on-device training.

  4. MiniCPM4: Ultra-Efficient LLMs on End Devices

    cs.CL 2025-06 conditional novelty 5.0 of 10

    MiniCPM4-8B reportedly matches Qwen3-8B on standard benchmarks while using about 22% of the training tokens, and achieves large long-context speedups on edge devices.

  5. Building a Family of Data Augmentation Models for Low-cost LLM Fine-tuning on the Cloud

    cs.CL 2024-12 conditional novelty 4.0 of 10

    A family of small data augmentation models for instruction expansion, refinement, and response generation can improve LLM fine-tuning at low cost.

Pith tools