arXiv Computation and Language

Conditional Calibration Contracts under Coupled Load: A Branch-Aware Audit of Switched Inference

The paper investigates conditional calibration contracts for switched inference systems, proposing a branch‑aware audit framework called CA‑MHD that integrates load‑coupled distillation, closed‑loop replay, and a cost‑informed Schmitt router. Experiments across 40 cells reveal that the deployed wide branch consistently underperforms the original teacher in ordinal accuracy, while student‑only serving shows mixed improvements and routing exposes significant violation tails. Retrospective temporal recalibration narrows the ordinal gap in most cells, yet causal delayed‑label verification and incremental per‑mode benefits remain unproven.

arXiv AI
Oct 21

Building Telecom Language Models with RSOD: Domain Data, Specialist Post-Training, Memory-Conscious Distillation, and Networking Evaluation

The paper introduces RSOD, a framework for creating telecom‑specific language models that blend broad networking knowledge with specialized routing, broadband, and diagnostic capabilities. It generates over 212,000 synthetic training records from networking taxonomies, trains six frozen specialist LoRA teachers, and distills their behavior into a single deployable student adapter, Llama‑CalixCLM v1. The student achieves near‑teacher performance (within 0.05 micro‑score points) while maintaining a validated, auditable training‑to‑deployment path.

By Anil Srirangapatna Nagesh, Nitin Gupta, Anuj Taneja, Vivek Singh, Shane Eleniak, Theo Zhao, Moulidharan N, Shashank Keshetty
arXiv Machine Learning
Sep 14

SCOPE-OPSD: Fisher-Conditioned Privileged Subspaces for On-Policy Self-Distillation

SCOPE-OPSD introduces a Fisher‑conditioned privileged subspace for on‑policy self‑distillation (OPSD) that projects the teacher‑student residual onto a frozen rank‑64 factor derived from residual covariance and language‑model‑head Fisher sensitivity. The method adds no extra rollouts or inference modules and, across multiple Qwen3 model checkpoints and trajectory lengths, consistently matches or surpasses pure OPSD and a matched random baseline, achieving significant gains in most settings. A cross‑fitted diagnostic shows a 4.40‑fold increase in captured privileged‑gap compared to the random orientation.

By Yunmeng Chen (Chongqing Ant Consumer Finance Co., Ltd), Kunyu Wang (Alibaba Cloud Computing Co., Ltd), Peihan Li (Chongqing Ant Consumer Finance Co., Ltd), Yi Wang (Chongqing Ant Consumer Finance Co., Ltd), Shuyin Xia (Chongqing University of Posts and Telecommunications), Yi Liu (Chongqing Ant Consumer Finance Co., Ltd), Xinyong Cheng (Alibaba Cloud Computing Co., Ltd), Dehui Wang (Alibaba Cloud Computing Co., Ltd), Xiangyong Zhai (Alibaba Cloud Computing Co., Ltd), Yanxing Liu (Chongqing Ant Consumer Finance Co., Ltd), Song Liu (Chongqing Ant Consumer Finance Co., Ltd)
arXiv Machine Learning
Oct 8

Composing What Each Teacher Learned: Multi-Teacher On-Policy Distillation through Teacher-Relative Shifts

The paper introduces Δ‑MOPD, a multi‑teacher on‑policy distillation method that transfers each teacher’s logit shift relative to its base policy, re‑anchored at the student’s frozen initialization. Δ‑MOPD is evaluated in two settings: common‑domain composition, where multiple teachers score a single student rollout, and routed‑domain distillation, where prompts are assigned to specialist teachers. Across experiments, Δ‑MOPD outperforms traditional endpoint supervision, especially when teacher signals are combined at a state, achieving higher accuracy and reducing performance gaps in phased routing scenarios.

By Hejian Sang, Zhengze Zhou, Shayan Mohajer Hamidi, Xiaomin Li, Rohit Jain, Alborz Geramifard
arXiv AI
Aug 20

Beyond Teacher Likelihood: Group-Calibrated On-Policy Distillation for Long-Context Reasoning

The paper introduces Group‑Calibrated On‑Policy Distillation (GC‑OPD), a method that aligns token‑level teacher guidance with trajectory‑level verifier rewards for long‑context reasoning tasks. GC‑OPD normalizes rewards within rollout groups, uses the signed teacher‑verifier disagreement as a residual, and distributes this residual across tokens via Relative‑Advantage‑Based Credit Assignment (RACA). Experiments on five long‑context benchmarks show that GC‑OPD improves Qwen3‑4B and Qwen3‑8B checkpoints from 29.08/35.12 to 40.47/44.65, outperforming vanilla OPD and demonstrating the effectiveness of group‑relative residual calibration.

By Zhu Zhang, Jixun Wang, Xiaoang Xu, Xiaorong Wang, Zihan Zhou, Zhiyuan Wang, Shuo Wang, Chaojun Xiao, Yuezhi Zhou
arXiv AI
Oct 16

Learning When to Withdraw: Curriculum Coverage and Rule-Specific Failures in Fine-Tuned Language Agents

The paper investigates how fine‑tuned language agents can selectively withdraw actions when evidence changes or authority is revoked. Using a synthetic NAQD‑Env environment, the authors compare an original curriculum with an enriched one across multiple system‑prompt framings and evaluate four LoRA checkpoints of Qwen2.5‑3B‑Instruct against instruction‑tuned baselines. Results show that fine‑tuned checkpoints achieve higher decision agreement and withdrawal recall, reduce incorrect withdrawals, and narrow prohibited combinations, though they also omit valid event reports and exhibit mixed preservation of authorized actions.

By Mohamed Abouzahra
Hugging Face Trending Papers
Aug 19

Beyond Teacher Likelihood: Group-Calibrated On-Policy Distillation for Long-Context Reasoning

The paper introduces Group-Calibrated On-Policy Distillation (GC‑OPD), a method that aligns token‑level teacher guidance with task‑level verifier rewards for long‑context reasoning. GC‑OPD normalizes verifier and OPD scores within rollout groups, uses their difference as a signed disagreement residual, and redistributes this residual across tokens via Relative‑Advantage‑Based Credit Assignment (RACA). Experiments on five long‑context benchmarks show that GC‑OPD improves Qwen3‑4B and Qwen3‑8B checkpoints from 29.08/35.12 to 40.47/44.65, outperforming vanilla OPD and demonstrating the effectiveness of group‑relative residual calibration.

arXiv AI
Aug 24

UpgradeBench: A Decision-Centric Benchmark for Upgrading Fine-Tuned LLM Specialists

UpgradeBench is a decision‑centric longitudinal benchmark that evaluates how fine‑tuned language‑model specialists should be handled when new base‑model releases occur. It covers four consecutive Qwen releases, a continuation checkpoint, six tasks, two model sizes, and OLMo checkpoints with known training lineage, and examines whether retraining, adapter transfer, or other recovery strategies improve specialist performance. The benchmark reveals that upgrade gains vary by task and release interval, that direct adapter copying is sensitive to pretraining distance, and that teacher relabeling can recover specialists without new annotations. "whyItMatters":"The study provides actionable insights into the cost‑effective management of specialist models across model releases, showing how to balance retraining effort with performance gains."

By Ye Chen, Weining Zhang