English

Open-Ended Task Discovery via Bayesian Optimization

Artificial Intelligence 2026-05-11 v1 Machine Learning

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.

Keywords

Cite

@article{arxiv.2605.07572,
  title  = {Open-Ended Task Discovery via Bayesian Optimization},
  author = {Masaki Adachi and Yuta Suzuki and Juliusz Ziomek},
  journal= {arXiv preprint arXiv:2605.07572},
  year   = {2026}
}

Comments

60 pages, 11 figures

R2 v1 2026-07-01T12:57:29.849Z