cd /news/machine-learning/sft-matches-rl-if-you-mcmc-the-train… · home › topics › machine-learning › article
[ARTICLE · art-144062] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=· neutral

SFT matches RL if you MCMC the training data first

A paper submitted to arXiv on 1 October 2026 introduces a Markov chain Monte Carlo (MCMC) sampling algorithm that progressively transforms off-policy traces into more on-policy data for finetuning, allowing supervised finetuning (SFT) to rival reinforcement learning (RL) on new tasks. The authors report that across scientific skill acquisition, mathematical reasoning, and open-ended expertise, their sampling algorithm lets SFT generalize better and forget less than strong on-policy baselines, and that the resulting finetuned models learn beyond sharpening the base model distribution. The work presents sampling as a model-native operator that shapes data for learnability, positioned as a general-purpose primitive across the posttraining stack.

read2 min views2 publishedOct 2, 2026
SFT matches RL if you MCMC the training data first
Image: source
  [Submitted on 1 Oct 2026]


[View PDF](https://arxiv.org/pdf/2610.02140)

[HTML (experimental)](https://arxiv.org/html/2610.02140v1)

Abstract:Introducing new capabilities to frontier models has long been the goal of posttraining, which predominantly employs supervised finetuning (SFT) and reinforcement learning (RL) to this end. Conventional wisdom dictates that RL enables strong generalization on new tasks without losing existing capabilities, while SFT is prone to weak generalization and catastrophic forgetting. At the same time, SFT can learn from off-policy expert data, whereas RL must rely on a model's ability to find successful trajectories with repeated sampling. In our work, we seek to leverage the strength of on-policy learning while utilizing the privileged information contained in off-policy data. However, rather than modifying the learning objective to accommodate this data, we instead tailor the data distribution to better suit the learner. We introduce a Markov chain Monte Carlo (MCMC) sampling algorithm that progressively transforms off-policy traces to be more on-policy given a reference model for finetuning. Across tasks like scientific skill acquisition, mathematical reasoning, and open-ended expertise, our sampling algorithm enables SFT to rival prevailing posttraining techniques, often generalizing better and forgetting less than strong on-policy baselines. In addition, the resulting finetuned models exhibit strong distributional performance and are capable of learning beyond sharpening the base model distribution. At a higher level, our approach presents sampling as a model-native operator that shapes data for learnability, offering broader utility as a general-purpose primitive throughout the posttraining stack.

Current browse context:

cs.LG

References & Citations

...

Bibliographic Explorer

(What is the Explorer?) Connected Papers

(What is Connected Papers?) Litmaps

(What is Litmaps?) scite Smart Citations

(What are Smart Citations?) alphaXiv

(What is alphaXiv?) CatalyzeX Code Finder for Papers

(What is CatalyzeX?) DagsHub

(What is DagsHub?) Gotit.pub

(What is GotitPub?) Hugging Face

(What is Huggingface?) ScienceCast

(What is ScienceCast?) Influence Flower

(What are Influence Flowers?) CORE Recommender

(What is CORE?) IArxiv Recommender

(What is IArxiv?) arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

── more in #machine-learning 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/sft-matches-rl-if-yo…] indexed:0 read:2min 2026-10-02 · —