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.
Beyond Next Token Prediction: Patch-Level Training for Large Language Models
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
cs.IR 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Multi-Grained Patch Training for Efficient LLM-based Recommendation
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.