OPT-BENCH: Evaluating the Iterative Self-Optimization of LLM Agents in Large-Scale Search Spaces
May 12, 2026 Β· View on GitHub
[πPaper] [πProject Page] [π€Hugging Face]
π£ What's New
- [2026.5.8] We updated OPT-BENCH by adding frontier models and a human expert baseline. Check it out at π arXiv: OPT-BENCH!
- [2026.4.6] The OPT-BENCH has been accepted at ACL 2026! See you in San Diego! πππ
- [2025.6.11] We have released data in OliverLeeXZ/OPT-Bench. πππ
- [2025.6.10] We have released code in OliverLeeXZ/OPT-Bench. πππ
- [2025.6.10] Our OPT-BENCH Paper is released! Check it at πArxiv: OPT-BENCH ! Our Dataset will be open-sourced soon! πππ
π Highlights
OPT-BENCH evaluates Iterative Self-Optimization through two complementary reasoning paradigms:
-
Continuous Parametric Optimization for machine learning tasks (Top)
-
Discrete Combinatorial Reasoning for NP-hard problems (Bottom)
In both settings, the agent uses environmental feedback to refine its reasoning trajectory, debug intermediate solutions, and progressively bridge the gap between initial hypotheses and optimal solutions through intrinsic reasoning.
- We present OPT-BENCH, a benchmark comprising 20 machine learning tasks and 10 NP problems, specifically designed to assess large language modelsβ (LLMs) ability to solve problems with large search spaces. It evaluates whether models can improve solutions over time by learning from past feedback.
- We introduce OPT-Agent, an end-to-end automated evaluation framework that enables LLMs to learn from historical feedback when solving practical, real-world optimization problems, thereby advancing their cognitive capabilities in iterative reasoning and improvement.
- We perform extensive experiments on 9 state-of-the-art LLMs from 6 different model families. Our analysis provides insights that can help guide future research on enhancing LLMsβ optimization capabilities
π Dataset Statistics
π OPT-BENCH Leaderboard
Performance of existing MLLMs on OPT-BENCH. We use four metrics to evaluate LLM performance on ML and NP tasks in OPT-BENCH, including Win Count, Buggy Rate, Rank, and Improvement Rate, which assess optimization capability, model robustness, ranking, and optimization performance across different experimental settings.
Setup
Make sure you have Python>=3.10 installed and run:
pip install -r requirements.txt
Inference Example
API Model
export API_KEY="Your api key"
export BASE_URL="Your api URL"
Open-sourced Model
We recommend that deploy model using lmdeploy.
export export API_KEY=EMPTY
export BASE_URL="Your model URL"
For ML task
cd OPT-BENCH
python run_exp.py --data_dir OPTAgent/example_tasks/spaceship-titanic --steps 1 --base_model gpt-4o-2024-08-06
For NP task
python run_exp.py --data_dir OPTAgent/example_tasks/hamiltonian-cycle --task_field NP --steps <your steps default is 10> --base_model <your model default is 4o>
For task scale up
https://huggingface.co/datasets/OPT-Bench/OPT-Bench
For NP task
Take OPTAgent/example_tasks/hamiltonian-cycle as the example.
- Add your date in
OPTAgent/example_tasksdir. - Prepare your own task.
task description in ## Description section, metric in ## Metric, submission format in ## Submission Format. - Prepare
question.json. Your question should in"question"formatted as dict. - prepare
validation.py. The rule-based validation py script for your task.
Run the run_exp.py for validation.
For ML task
Take OPTAgent/example_tasks/spaceship-titanic as the example.
- Add your date in
OPTAgent/example_tasksdir. - Prepare your own task.
task description in ## Description section, metric in ## Metric, dataset description in ## Dataset Description, submission format in ## Submission Format. - You should prepare
init.py in ## Code TemplateforOPTAgent-refine, which is optional forOPTAgent-draft.
ποΈ Citation
If you find this work helpful, please consider to starπ this repo. Thanks for your support!
@misc{li2025optbenchevaluatingllmagent,
title={OPT-BENCH: Evaluating LLM Agent on Large-Scale Search Spaces Optimization Problems},
author={Xiaozhe Li and Jixuan Chen and Xinyu Fang and Shengyuan Ding and Haodong Duan and Qingwen Liu and Kai Chen},
year={2025},
eprint={2506.10764},
archivePrefix={arXiv},
primaryClass={cs.AI},
url={https://arxiv.org/abs/2506.10764},
}