MMODELYST
Papers/Open-Ended Task Discovery via Bayesian Optimization
PAP

Open-Ended Task Discovery via Bayesian Optimization

May 8, 2026

arXiv
Abstract

When applying Bayesian optimization (BO) to scientific workflow, a major yet often overlooked source of uncertainty is the task itself -- namely, what to optimize and how to evaluate it -- which can evolve as evidence accumulates. We introduce Generate-Select-Refine (GSR), a open-ended BO framework that alternates between task generation and task optimization. Starting from a user-provided seed task, GSR generates new tasks in a coarse-to-fine manner while a task-acquisition function schedules optimization. Asymptotically, it concentrates evaluations on the best task, incurring only logarithmic regret overhead relative to single-task BO. We apply GSR to new product development, chemical synthesis scaling, algorithm analysis, and patent repurposing, where it outperforms existing LLM-based optimizers.

Select text to highlight · click a highlight to remove · saved in this browser only
Authors
Masaki Adachi, Yuta Suzuki, Juliusz Ziomek
Your notes (browser-local)
saved
arXiv:2605.07572