Dropping single-LLM-judge reward for two-agent debate recovers 45% of the accuracy gap lost to reward hacking in RLAIF, and holds through many RL steps where the baseline degrades. Tested on a Gemini 2.5 Flash policy against a weaker judge; capping the critic's words is what keeps the game from drifting into own judge-hacking.
A pre-registered study serving Qwen3-235B on one 8GB GPU finds decode is memory-bandwidth-bound (0.44 tok/s), not compute-bound. Auxiliary locality router losses cut cache misses up to 60% but every config blows past a 1% perplexity budget, confirming miss reduction is tightly coupled to quality. Training-free cache-aware rerouting stacks with trained locality for ~80% miss reduction at lower cost.
ClosureBench generates fresh graph-reasoning instances on demand with machine-verified ground truth, so it's contamination-resistant and can measure memorization directly. Across 26 task categories, frontier models degrade sharply from atomic to compositional queries, misreading the graph, then reasoning correctly over the wrong one, while a 4B model fine-tuned to emit programs hits near-frontier accuracy.
FinSkillBench tests whether LLM agents can handle real investment work, point-in-time data retrieval, correct computational inputs, specialized methods, auditable outputs, across 3 domains, 12 subtasks, 2,603 episodes. Curated skill packages lifted mean scores from 0.366 to 0.528 across 9 models, while self-generated skills barely helped despite higher compute. The benchmark, tools, and trajectories are released.