A coding agent can earn a passing grade by fixing its code, or by deleting the test that exposes the bug. Detecting such reward hacking requires recognizing attempted shortcuts, including those that fail. We release 173,561 annotated multi-turn coding trajectories from Qwen3-8B and show that supervising shortcut behavi...
Hao Jiang, Xin Li, An-Nan Wang et al.· 0 citations
Multi-agent large language model (LLM) debate is often evaluated by whether final answers improve, but movement is not necessarily improvement: the same discussion can rescue an initially wrong majority or destroy an initially correct one. Standard final-accuracy evaluations conflate these opposing mechanisms. We intro...
Domain-Normalized MOPD is proposed, which keeps the routing and rescales each domain's feedback by its measured spread, and improves the average score over MOPD at every size, across three random seeds and under two answer-length limits, and recovers most of the lost mathematics gain.
Xin Li, Hao-Zhe Jiang, Xin-Ming Gao et al.· 1 citation
In-Context Signal Completion (ICSC) is presented, demonstrating that small language models fine-tuned with Group Relative Policy Optimization and physics-informed rewards can reconstruct RSSI across sequential extrapolation and spatial interpolation tasks.