Agentic Algorithm Design: LLMs that Propose, Formalise, and Prove Runtime Bounds for Evolutionary Algorithms in Lean
This study suggests that machine-checked specifications in Lean can replace empirical evaluation in open-ended algorithm discovery and is the first example of an automated pipeline that designs efficient black-box optimisation algorithms with machine-checked runtime bounds in Lean.
P. Lehre
· 0 citations