atlas

Research map / Large language models / Agents, code and math

AutoBencher: Towards Declarative Benchmark Construction

ICLR 2025 · Large language models › Agents, code and math · approach: LLM-guided program synthesis · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes AutoBencher, a declarative framework that casts benchmark construction as optimization over dataset descriptions, using an evaluator LM (GPT-4 Turbo) with privileged information and adaptive search to find salient, difficult, novel capability datasets and unsafe-prompt safety datasets.

Problem

Existing human-constructed benchmarks are costly to build and often fail to reveal novel model weaknesses or difficult failure modes; automatic benchmark construction for LM capability and safety evaluation is underexplored.

Approach

Declare benchmark desiderata (salience, difficulty, separability, novelty for capabilities; harmfulness and attack success rate for safety) as quantitative surrogate metrics, then search over LM-proposed dataset descriptions with adaptive search (conditioning on past description-accuracy trajectories), generating QA pairs using privileged information (Wikipedia retrieval, Python libraries, transla

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use AutoBencher instead of human-constructed benchmarksCapability benchmarks · History, Economy, Science, Multilingual, Mathnovelty: reducing the rank correlation by 27%Helped
Use AutoBencher instead of human-constructed benchmarksCapability benchmarks · History, Economy, Science, Multilingual, Mathdifficulty: 22% greater difficultyHelped
Use AutoBencher instead of existing safety datasetsSafety benchmarks · Safetyattack success rate: 0.28 -> 0.38Helped
Use AutoBencher instead of direct GCG adversarial attacksSafety benchmarks · Safetyattack success rate: 0.38 -> 0.45Hurt
remove adaptive search (ablation)AutoBencher · Historydifficulty: 0.440 -> 0.257Hurt
remove adaptive search (ablation)AutoBencher · Historynovelty: 0.39 ± 0.10 -> 0.24 ± 0.07Hurt
remove privileged information (ablation)AutoBencher · Economydifficulty: 0.321 -> 0.0Hurt
set evaluator temperature to 1 (ablation)AutoBencher · Capability benchmarksnovelty: 0.43 -> 0.38 ± 0.05No clear effect
set evaluator temperature to 1 (ablation)AutoBencher · Safetyattack success rate: 0.387 -> 0.356Hurt
use Claude-3.5-sonnet as evaluator LM instead of GPT-4-turbo (ablation)AutoBencher · Capability benchmarksnovelty: 0.43 -> 0.43No clear effect
use LLaMA 3.1-405B as evaluator LM instead of GPT-4-turbo (ablation)AutoBencher · Safetyattack success rate: 0.387 -> 0.389No clear effect

Surprising findings

Limitations

Experimental setup

Datasets: MMLU Mathematics Dataset XOR QA Wikipedia articles XSTest HarmBench

Benchmarks: MMLU Mathematics Dataset XOR QA XSTest HarmBench

Metrics: novelty (1 - rank correlation) difficulty (1 - max accuracy) separability (mean absolute deviation) attack success rate correctness error rate salience Likert score

Baselines: HumanBench (MMLU subjects) XSTest HarmBench HarmBench GCG-T AutoBench-AS (no adaptive search)

Builds on: MMLU HarmBench XSTest LM-Examiner

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy