arXiv AI By Jiawei Li, Zhiyang Xun, Lijie Chen, Jonah Brown-Cohen

How to Have a Sensitive Debate: An Instance-Optimal Protocol for AI Debate

Read the original on arXiv AI →

The paper introduces a new AI debate protocol that improves upon previous designs for problems with stable decompositions into subproblems. It guarantees correctness in a worst‑case sense, establishes honesty and correctness as a dominant‑strategy equilibrium for both debaters, and proves instance‑wise optimality through black‑box lower bounds. The authors connect stable problem decompositions to fractional block sensitivity from query complexity to achieve these results.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 23

Avoiding Obfuscation with Prover-Estimator Debate

arXiv:2506. 13609v2 Announce Type: replace Abstract: Training powerful AI systems to exhibit desired behaviors hinges on the ability to provide accurate human supervision on increasingly complex tasks.

By Jonah Brown-Cohen, Geoffrey Irving, Georgios Piliouras, Lijie Chen, Jiawei Li, Zhiyang Xun
arXiv AI
Aug 20

A Theory of Post-hoc Debate Judgement

The paper proposes a theory for judging post-hoc debates in AI, focusing on properties like reproducibility, robustness, groundedness, and explainability. It evaluates two debate‑judgement methods—LLM judges and formal computational argumentation semantics—finding similar accuracy but noting that argumentation semantics offers stronger formal guarantees. The study suggests that argumentation semantics is a preferable framework for principled debate judges in AI systems.

By Xiang Yin, Adam Dejl, Antonio Rago, Lihu Chen, Francesca Toni