Training Language Models to Win Debates with Self-Play Improves Judge Accuracy

Samuel Arnesen, David Rein, Julian Michael
9/25/2024
cs.CLcs.AI

No official code found. Best implementation: samuelarnesen/nyu-debate-modeling (25 stars, MIT, last commit 2024-10-04).

Abstract

We test the robustness of debate as a method of scalable oversight by training models to debate with data generated via self-play. In a long-context reading comprehension task, we find that language model based evaluators answer questions more accurately when judging models optimized to win debates. By contrast, we find no such relationship for consultancy models trained to persuade a judge without an opposing debater present. In quantitative and qualitative comparisons between our debate models and novel consultancy baselines, we find evidence that debate training encourages stronger and more informative arguments, showing promise that it can help provide high-quality supervision for tasks that are difficult to directly evaluate.

View on arXivView PDF

Code Implementations(1)

MIT
255Shell, PythonSep 12, 20232 years agoMIT

Similar Papers

Cite this paper

@article{arnesen2024training,
  title  = {Training Language Models to Win Debates with Self-Play Improves Judge Accuracy},
  author = {Samuel Arnesen and David Rein and Julian Michael},
  year   = {2024},
  eprint = {2409.16636},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.16636v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.16636.svg)](https://codeofpaper.com/paper/2409.16636)

Discussion