Pith. sign in

REVIEW 2 cited by

Beyond Next Token Prediction: Patch-Level Training for Large Language Models

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 2407.12665 v3 pith:Z3C3CJVV submitted 2024-07-17 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords trainingllmspatch-levelcostslanguagemodelmodelsdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The prohibitive training costs of Large Language Models (LLMs) have emerged as a significant bottleneck in the development of next-generation LLMs. In this paper, we show that it is possible to significantly reduce the training costs of LLMs without sacrificing their performance. Specifically, we introduce patch-level training for LLMs, in which multiple tokens are aggregated into a unit of higher information density, referred to as a `patch', to serve as the fundamental text unit for training LLMs. During patch-level training, we feed the language model shorter sequences of patches and train it to predict the next patch, thereby processing the majority of the training data at a significantly reduced cost. Following this, the model continues token-level training on the remaining training data to align with the inference mode. Experiments on a diverse range of models (370M-2.7B parameters) demonstrate that patch-level training can reduce the overall training costs to 0.5$\times$, without compromising the model performance compared to token-level training. Source code: https://github.com/shaochenze/PatchTrain.

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. Multi-Grained Patch Training for Efficient LLM-based Recommendation

    cs.IR 2025-01 conditional novelty 6.0 of 10

    A two-stage training method lets LLM recommenders read long interaction histories by representing older items as averaged embedding patches, improving accuracy and cutting input tokens.

  2. Next Patch Prediction for Autoregressive Visual Generation

    cs.CV 2024-12 conditional novelty 6.0 of 10

    Averaging neighboring image tokens into patches during training lets autoregressive image models train faster and generate higher-quality images, with inference unchanged.

Pith tools