mlsanityData to 14 Oct 2026

Open-Ended Task Discovery via Bayesian Optimization

arXiv 2605.07572 ↗First posted 8 May 2026cs.AI stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 16 of its 80 references that are in the map. First posted on arXiv 8 May 2026.

Builds on

16 of 80 references.

References · 16

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  3. 2023Gemini: A Family of Highly Capable Multimodal Modelscited by 872
  4. 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 867
  5. 2025Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agentscited by 356
  6. 2025ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolutioncited by 174
  7. 2014Freeze-Thaw Bayesian Optimizationcited by 90
  8. 2025CodeEvolve: an open source evolutionary coding agent for algorithmic discovery and optimizationcited by 44
  9. 2025How to Correctly Report LLM-as-a-Judge Evaluationscited by 30
  10. 2025In-Context Learning Is Provably Bayesian Inference: A Generalization Theory for Meta-Learningcited by 22
  11. 2025Accelerating Scientific Discovery with Autonomous Goal-evolving Agentscited by 19
  12. 2026Can LLMs Beat Classical Hyperparameter Optimization Algorithms? A Study on autoresearchcited by 15
4 more
  1. 2025Bayesian Optimization for Building Social-Influence-Free Consensuscited by 6
  2. 2026Verbalizing LLM's Higher-order Uncertainty via Imprecise Probabilitiescited by 5
  3. 2025Natural Evolutionary Search meets Probabilistic Numericscited by 2
  4. 2025Consequences of Kernel Regularity for Bandit Optimizationcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.