Scaling Near-Optimal SFT-RL Annotation Budget Allocation from Small to Large LLMs
cs.CL, cs.AI, cs.LG
Submitted: 2026-09-01
Updated: 2026-09-01
Code: https://github.com/google-research/google-research
Terminology
Sources
- Training Verifiers to Solve Math Word Problems
- Understanding Forgetting in LLM Supervised Fine-Tuning and Preference Learning -- A Convex Optimization Perspective
- The Llama 3 Herd of Models
- Camels in a Changing Climate: Enhancing LM Adaptation with Tulu 2
- MoDoMoDo: Multi-Domain Data Mixtures for Multimodal LLM Reinforcement Learning
- Scaling Laws for Neural Language Models
- Do Post-Training Algorithms Actually Differ? A Controlled Study Across Model Scales Uncovers Scale-Dependent Ranking Inversions
- Proximal Policy Optimization Algorithms
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- Qwen3 Technical Report
- Qwen2.5 Technical Report
- Instruction-Following Evaluation for Large Language Models
- ToReMi: Topic-Aware Data Reweighting for Dynamic Pre-Training Data Selection
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering