From Production Traffic to Post-Training: Building a Self-Hosted LLM That Covers the Corporate Request Mix
cs.CL
Submitted: 2026-09-01
Updated: 2026-09-01
License: http://creativecommons.org/licenses/by/4.0/
The gist: Data-residency constraints force enterprises to self-host LLMs, but continuous adoption of newer models without decommissioning their predecessors expands the serving fleet, fragmenting a finite GPU
Terminology
Abstract
Data-residency constraints force enterprises to self-host LLMs, but continuous adoption of newer models without decommissioning their predecessors expands the serving fleet, fragmenting a finite GPU pool. We consolidate traffic from over 200 internal applications onto a single model by closing quality gaps identified through production error analysis along three axes: instruction following, function-calling, and internal task distribution. Quality is tracked by offline benchmarks stratified to production traffic and scored by deterministic verifiers or calibrated LLM judges. Rather than optimising all objectives jointly, which introduces cross-domain reward interference, we train a separate GRPO expert per axis and merge them via two-stage SLERP. Each expert's reward exposes a distinct failure mode, namely semantic collapse, over-calling, and verbosity hacking, each requiring a domain-specific fix. In non-reasoning mode the recipe surpasses a about 7 times larger by total parameters baseline on the in-house Arena with 69.6 to 65.8, instruction following with 0.85 to 0.83, and function-calling with 0.79 to 0.77, while lifting general dialogue benchmarks. The model absorbs 50% of platform traffic, 116M requests per month, at a fraction of the serving cost.
Sources
- Aya Expanse: Combining Research Breakthroughs for a New Multilingual Frontier
- DeepSeek-V3 Technical Report
- GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Models
- The Llama 3 Herd of Models
- BERTopic: Neural topic modeling with a class-based TF-IDF procedure
- Reinforcement Learning with Rubric Anchors
- MO-GRPO: Mitigating Reward Hacking of Group Relative Policy Optimization on Multi-Objective Problems
- Kimi K2.5: Visual Agentic Intelligence
- Vikhr: The Family of Open-Source Instruction-Tuned Large Language Models for Russian
- gpt-oss-120b & gpt-oss-20b Model Card
- Proximal Policy Optimization Algorithms
- DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
- Rethinking Rubric Generation for Improving LLM Judge and Reward Modeling for Open-ended Tasks
- Command A: An Enterprise-Ready Large Language Model
- BloombergGPT: A Large Language Model for Finance
- TOUCAN: Synthesizing 1.5M Tool-Agentic Data from Real-World MCP Environments
- Qwen3 Technical Report
- Group Sequence Policy Optimization
- Instruction-Following Evaluation for Large Language Models
- Fine-Tuning Language Models from Human Preferences
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