Post-training is (Massive) Supervised Learning

• URL: http://arxiv.org/abs/2606.07527v1
• Date: Mon, 20 Apr 2026 08:52:09 GMT
• Title: Post-training is (Massive) Supervised Learning
• Abstract summary: The prevailing paradigm for training LLMs has evolved to rely on a massive post-training phase consisting of SFT and RL.<n>We argue that this methodology effectively marks a reversion to the pre-train then fine-tune'' approach of the BERT era.
• Score: 35.992105178197185
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: The prevailing paradigm for training LLMs has evolved to rely on a massive post-training phase consisting of SFT and RL. In this position paper, we argue that this methodology effectively marks a reversion to the ``pre-train then fine-tune'' approach of the BERT era, explicitly tailoring models to the desired behaviors and specific benchmarks on which they are evaluated. We begin with a historical overview of LLMs, describing the different phases of the LLM evolution. We argue that the current landscape is remarkably similar to the early days of LLMs, where task performance heavily relied on fitting the models to in-distribution datasets. To empirically demonstrate this, we compare pre-trained models to randomly initialized ones, by fine-tuning both variants on modern reasoning datasets and evaluating them on competitive math and code benchmarks. We show that models post-trained from scratch yield highly non-trivial performance. Our findings suggest that current post-training methodologies function primarily as a distribution-fitting mechanism. We finish by positing that developing generally capable models and systems requires moving beyond extensive post-training for predefined behaviors, shifting instead toward training procedures where models ``learn how to learn''.

Related papers

• Data Attribution in Large Language Models via Bidirectional Gradient Optimization [35.61634772862795]
  Large Language Models (LLMs) are increasingly deployed across diverse applications.<n>understanding which training data most influenced a model's output remains a fundamental open problem.<n>We address this challenge by expanding upon the inverse formulation: How would training data be affected if the model had seen the generated output during training?<n>Our method perturbs the base model using bidirectional gradient optimization (gradient ascent and descent) on a generated text sample and measures the resulting change in loss across training samples.
  arXiv  Detail & Related papers  (2026-06-03T14:21:53Z)
• On Predicting the Post-training Potential of Pre-trained LLMs [60.07459271263409]
  We introduce a new task of predicting post-training potential - forecasting a base model's performance before post-training.<n>We propose RuDE, a unified framework that bypasses the generation gap of base models by leveraging response discrimination.<n>Experiments demonstrate a correlation greater than 90% with post-training performance.
  arXiv  Detail & Related papers  (2026-05-12T11:33:49Z)
• The Pre-Training Study of Expanded-SPLADE Models on Web Document Titles [0.08949202626090576]
  This paper studies effect of different pre-training datasets and pre-training options on the pre-trained models for retrieval fine-tuning.<n>Fine-tuned models of higher retrieval effectiveness at both unpruned and most strict pruned settings are mostly pre-trained on a general corpus.
  arXiv  Detail & Related papers  (2026-05-02T12:07:49Z)
• Estimating the Effects of Sample Training Orders for Large Language Models without Retraining [49.59675538160363]
  The order of training samples plays a crucial role in large language models (LLMs)<n>Traditional methods for investigating this effect generally require retraining the model with various sample orders.<n>We improve traditional methods by designing a retraining-free framework.
  arXiv  Detail & Related papers  (2025-05-28T07:07:02Z)
• How Post-Training Reshapes LLMs: A Mechanistic View on Knowledge, Truthfulness, Refusal, and Confidence [52.9442657690445]
  Post-training is essential for the success of large language models (LLMs)<n>We compare base and post-trained LLMs from four perspectives to better understand post-training effects.
  arXiv  Detail & Related papers  (2025-04-03T06:30:55Z)
• Efficient Model Selection for Time Series Forecasting via LLMs [52.31535714387368]
  We propose to leverage Large Language Models (LLMs) as a lightweight alternative for model selection.<n>Our method eliminates the need for explicit performance matrices by utilizing the inherent knowledge and reasoning capabilities of LLMs.
  arXiv  Detail & Related papers  (2025-04-02T20:33:27Z)
• Provable Meta-Learning with Low-Rank Adaptations [37.120226706944926]
  We introduce a framework for generic PEFT-based meta-learning to learn a model that can easily adapt to unseen tasks.<n>For linear models using LoRA, we show that standard retraining is provably suboptimal for finding an adaptable set of parameters.<n>We verify these theoretical insights through experiments on synthetic data as well as real-data vision and language tasks.
  arXiv  Detail & Related papers  (2024-10-29T17:24:18Z)
• Efficient Continual Pre-training by Mitigating the Stability Gap [68.49269649759005]
  We study the behavior of Large Language Models (LLMs) during continual pre-training. We propose three effective strategies to enhance LLM performance within a fixed compute budget. Our strategies improve the average medical task performance of the OpenLlama-3B model from 36.2% to 40.7% with only 40% of the original training budget.
  arXiv  Detail & Related papers  (2024-06-21T02:28:37Z)
• The Fine Line: Navigating Large Language Model Pretraining with Down-streaming Capability Analysis [27.310894780313618]
  This paper undertakes a comprehensive comparison of model capabilities at various pretraining intermediate checkpoints. We confirm that specific downstream metrics exhibit similar training dynamics across models of different sizes. In addition to our core findings, we've reproduced Amber and OpenLLaMA, releasing their intermediate checkpoints.
  arXiv  Detail & Related papers  (2024-04-01T16:00:01Z)
• FairSISA: Ensemble Post-Processing to Improve Fairness of Unlearning in LLMs [6.689848416609951]
  We study the interplay between unlearning and fairness for large language models (LLMs) We focus on a popular unlearning framework known as SISA, which creates an ensemble of models trained on disjoint shards. We propose post-processing bias mitigation techniques for ensemble models produced by SISA.
  arXiv  Detail & Related papers  (2023-12-12T16:44:47Z)
• Towards a Prediction of Machine Learning Training Time to Support Continuous Learning Systems Development [5.207307163958806]
  We present an empirical study of the Full. Time Complexity (FPTC) approach by Zheng et al. We study the formulations proposed for the Logistic Regression and Random Forest classifiers. We observe how, from the conducted study, the prediction of training time is strictly related to the context.
  arXiv  Detail & Related papers  (2023-09-20T11:35:03Z)
• RanPAC: Random Projections and Pre-trained Models for Continual Learning [59.07316955610658]
  Continual learning (CL) aims to learn different tasks (such as classification) in a non-stationary data stream without forgetting old ones. We propose a concise and effective approach for CL with pre-trained models.
  arXiv  Detail & Related papers  (2023-07-05T12:49:02Z)
• CLIPood: Generalizing CLIP to Out-of-Distributions [73.86353105017076]
  Contrastive language-image pre-training (CLIP) models have shown impressive zero-shot ability, but the further adaptation of CLIP on downstream tasks undesirably degrades OOD performances. We propose CLIPood, a fine-tuning method that can adapt CLIP models to OOD situations where both domain shifts and open classes may occur on unseen test data. Experiments on diverse datasets with different OOD scenarios show that CLIPood consistently outperforms existing generalization techniques.
  arXiv  Detail & Related papers  (2023-02-02T04:27:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.