Sharpening Tax in Post-Training
cs.AI, cs.LG
Submitted: 2026-10-01
Updated: 2026-10-01
Code: https://github.com/changdaeoh/sharpening-tax
Project page: https://changdaeoh.github.io/sharpening-tax
License: http://creativecommons.org/licenses/by/4.0/
The gist: An emerging hypothesis about reinforcement learning (RL) post-training of large language models (LLMs) is that it merely sharpens existing behaviors of a base model, improving single-shot accuracy at
Abstract
An emerging hypothesis about reinforcement learning (RL) post-training of large language models (LLMs) is that it merely sharpens existing behaviors of a base model, improving single-shot accuracy at the cost of solution coverage. Although this trade-off has been observed in math and coding tasks, it need not extend to agentic tasks, where multi-turn tool use and interaction may require capabilities newly acquired during post-training. Our surprising finding is that pre-trained LLMs, equipped with a light inference harness, can serve as capable agents. Despite far lower accuracy (pass@1), they often surpass their post-trained counterparts in solution coverage (pass@K) given a sufficient test-time budget. We further analyze the underlying mechanism and show that post-training pushes tasks toward two extremes, always solved or never solved, and thereby improves sampling efficiency and consistency at the cost of solution coverage. To measure this cost, we propose Sharpening Tax, a diagnostic metric that quantifies the loss in test-time scalability after post-training. Across 14 base/post-trained model pairs from four families and three agentic benchmarks (42 cases in total), the tax is prevalent in most settings, can be estimated from a few rollouts, and correlates well with other metrics. Finally, we present posterior-tempered group sampling (PTGS), a simple plug-and-play Bayesian sampler that adapts the sampling temperature per prompt to its estimated difficulty. Applied during RL training in two agentic environments, PTGS pays a smaller tax than the fixed-temperature baseline, solving more tasks under repeated sampling while also improving single-shot accuracy.
Sources
- Nemotron 3 Nano: Open, Efficient Mixture-of-Experts Hybrid Mamba-Transformer Model for Agentic Reasoning
- Large Language Monkeys: Scaling Inference Compute with Repeated Sampling
- ACEBench: Who Wins the Match Point in Tool Usage?
- Evaluating Large Language Models Trained on Code
- Weight Ensembling Improves Reasoning in Language Models
- Beyond Pass@k: Breadth-Depth Metrics for Reasoning Boundaries
- From Entropy to Epiplexity: Rethinking Information for Computationally Bounded Intelligence
- Differential Smoothing Mitigates Sharpening and Improves LLM Reasoning
- Gemma 4 Technical Report
- MiniLLM: On-Policy Distillation of Large Language Models
- DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
- On-Policy Delta Distillation
- Distilling the Knowledge in a Neural Network
- Why Larger Models Learn More: Effects of Capacity, Interference, and Rare-Task Retention
- When Does RL Help Medical VLMs? Disentangling Vision, SFT, and RL Gains
- Scaling Laws for Neural Language Models
- Efficient Prediction of Pass@k Scaling in Large Language Models
- The Interplay of Harness Design and Post-Training in LLM Agents
- LLM-as-a-Verifier: A General-Purpose Verification Framework
- Reinforcement Learning from Human Feedback
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems