arXiv AI

Benchmarks Don't Talk Back: Learning Through Self-Disagreement

arXiv AI
Jul 14

LLMs as a Jury: Cross-Model Consensus Can Outperform Process Reward Models for LLM Reasoning

arXiv:2607. 10139v1 Announce Type: cross Abstract: Selecting the correct answer from a pool of candidate reasoning chains is the engine of test-time scaling, yet the standard selectors each carry a cost: self-consistency inherits the errors of the single model it resamples, and trained reward models need labeled data and transfer poorly off-distribution.

By Ning Liu
arXiv AI
Jul 21

MADA-RL: Multi-Agent Debate-Aware Reinforcement Learning for Parameter-Efficient Reasoning in Compact Models

arXiv:2607. 18006v1 Announce Type: cross Abstract: Large language models achieve strong reasoning performance, but often at prohibitive training cost - a challenge that is especially acute for compact models ($\leq 4 \, \mathrm{B}$ parameters) trained under limited budgets.

By Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov, Zifeng Ding, Volker Tresp, Yunpu Ma
Hugging Face Trending Papers
Jul 20

MADA-RL: Multi-Agent Debate-Aware Reinforcement Learning for Parameter-Efficient Reasoning in Compact Models

Large language models achieve strong reasoning performance, but often at prohibitive training cost - a challenge that is especially acute for compact models ($\leq 4 \, \mathrm{B}$ parameters) trained under limited budgets. We introduce MADA-RL, a post-training framework that specializes compact models into generator and critic roles and trains them with a debate-aware learning signal, fine-tuning only a small subset of parameters via LoRA adapters.

arXiv Machine Learning
Sep 29

Reinforcement Learning of Communication in a Mesh of Small Language Models

The paper introduces TalkMesh, a decentralized network of small language model agents that learn to communicate effectively during inference. Each agent proposes an answer, scores it with a confidence head, and the most confident agent broadcasts a hint; lower‑confidence agents revise their proposals if a new suggestion scores higher. This gossip‑based consensus, trained via group relative policy optimization, enables a mesh of three agents to match the accuracy of majority voting over 32 samples, and scales to larger meshes to significantly boost performance on benchmarks like GSM8K and MATH-500.

By Mehmet Kerem Turkcan
arXiv Machine Learning
Oct 23

Consistency Is Not Validity: Self-Rewarded Moral Argumentation Makes Language Models Decisive but Pliable

The paper proposes a reinforcement learning approach that rewards language models for producing high‑quality moral arguments, under the hypothesis that better arguing leads to better judging. Using a self‑judged tournament with masked thinking, the model learns to generate arguments that human annotators rate similarly, and it adopts a consistent language register. Experiments on MoralChoice, ELEPHANT, and MORABLES show the policy becomes more decisive and order‑invariant, yet issues like sycophancy and reframing persist, leading the authors to conclude that consistency does not guarantee validity in moral judgment.

By Marius De Kuthy Meurers, Aaron Parisi, Bernd Bohnet
arXiv AI
Oct 28

Don't Pick a Winner: Knowledge Conflicts Need a Prior, Not a Rule

The paper introduces a retrieval‑augmented language model that resolves disagreements between retrieved context and the model’s own knowledge by incorporating a prior over the reliability of the context rather than a fixed rule. Experiments on the GRACE benchmark show that this prior‑based approach outperforms existing baselines by up to 26 points, achieving higher overall scores on both Qwen3.5‑35B‑A3B and Llama‑3.1‑8B. The method also demonstrates superior performance on the ClashEval benchmark, confirming the theoretical advantage of evidence‑based conflict resolution.

By Minh Pham Van, Cong Tran
arXiv Machine Learning
Oct 15

Inverse Reasoning Models for Efficient Post-Training and Verification from Answer-Only Data

The paper introduces a self‑distillation method that leverages answer‑only data to improve large language models (LLMs) after training. By training an inverse reasoning LLM to generate latent chain‑of‑thought traces conditioned on the answer, the authors can perform offline distillation that significantly boosts performance on hard prompts for tasks like Countdown and GSM8K. Additionally, the inverse model serves as an accurate verifier, enhancing best‑of‑n selection accuracy.

By Eric O. Korman
arXiv AI
Aug 20

Competence, Not Accuracy: A Diagnostic for Reference-Free Judge Gates in Skill Optimization

The paper introduces a diagnostic for reference‑free judge gates in text‑space skill optimization. It formalizes a judge as a latent solver, deriving a closed‑form bound on discriminability (ROC‑AUC) in terms of judge competence and answer‑space size, and shows that discriminability is confounded by item difficulty unless a within‑question estimator is used. A non‑intervening probe demonstrates that discriminability is at chance near the competence floor, rises above it, and that the diagnostic can predict gating errors in closed‑loop experiments.

By Chenle Chen, Yangbo Wei, Chao Yao, Shaoqiang Lu, Junhong Qian, Chen Wu, Lei He