Saved in:
| Main Authors: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.04622 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909252092690432 |
|---|---|
| author | Kenton, Zachary Siegel, Noah Y. Kramár, János Brown-Cohen, Jonah Albanie, Samuel Bulian, Jannis Agarwal, Rishabh Lindner, David Tang, Yunhao Goodman, Noah D. Shah, Rohin |
| author_facet | Kenton, Zachary Siegel, Noah Y. Kramár, János Brown-Cohen, Jonah Albanie, Samuel Bulian, Jannis Agarwal, Rishabh Lindner, David Tang, Yunhao Goodman, Noah D. Shah, Rohin |
| contents | Scalable oversight protocols aim to enable humans to accurately supervise superhuman AI. In this paper we study debate, where two AI's compete to convince a judge; consultancy, where a single AI tries to convince a judge that asks questions; and compare to a baseline of direct question-answering, where the judge just answers outright without the AI. We use large language models (LLMs) as both AI agents and as stand-ins for human judges, taking the judge models to be weaker than agent models. We benchmark on a diverse range of asymmetries between judges and agents, extending previous work on a single extractive QA task with information asymmetry, to also include mathematics, coding, logic and multimodal reasoning asymmetries. We find that debate outperforms consultancy across all tasks when the consultant is randomly assigned to argue for the correct/incorrect answer. Comparing debate to direct question answering, the results depend on the type of task: in extractive QA tasks with information asymmetry debate outperforms direct question answering, but in other tasks without information asymmetry the results are mixed. Previous work assigned debaters/consultants an answer to argue for. When we allow them to instead choose which answer to argue for, we find judges are less frequently convinced by the wrong answer in debate than in consultancy. Further, we find that stronger debater models increase judge accuracy, though more modestly than in previous studies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_04622 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On scalable oversight with weak LLMs judging strong LLMs Kenton, Zachary Siegel, Noah Y. Kramár, János Brown-Cohen, Jonah Albanie, Samuel Bulian, Jannis Agarwal, Rishabh Lindner, David Tang, Yunhao Goodman, Noah D. Shah, Rohin Machine Learning Scalable oversight protocols aim to enable humans to accurately supervise superhuman AI. In this paper we study debate, where two AI's compete to convince a judge; consultancy, where a single AI tries to convince a judge that asks questions; and compare to a baseline of direct question-answering, where the judge just answers outright without the AI. We use large language models (LLMs) as both AI agents and as stand-ins for human judges, taking the judge models to be weaker than agent models. We benchmark on a diverse range of asymmetries between judges and agents, extending previous work on a single extractive QA task with information asymmetry, to also include mathematics, coding, logic and multimodal reasoning asymmetries. We find that debate outperforms consultancy across all tasks when the consultant is randomly assigned to argue for the correct/incorrect answer. Comparing debate to direct question answering, the results depend on the type of task: in extractive QA tasks with information asymmetry debate outperforms direct question answering, but in other tasks without information asymmetry the results are mixed. Previous work assigned debaters/consultants an answer to argue for. When we allow them to instead choose which answer to argue for, we find judges are less frequently convinced by the wrong answer in debate than in consultancy. Further, we find that stronger debater models increase judge accuracy, though more modestly than in previous studies. |
| title | On scalable oversight with weak LLMs judging strong LLMs |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2407.04622 |