Sign inGet started
Paper · arXiv

Learning to Solve and Optimize by Evolving Code

Combinatorial and optimization problems are fundamental to many industrial AI applications. Solving large-scale real-world instances of such problems typically requires careful problem formalization, specialized solvers, and expert-designed heuristics. Thus, experts need to specify not only what solutions are, but also how they are derived. By introducing the tool CHECKMATE, we show that algorithm generation via code evolution represents a paradigm shift by eliminating the need to formulate the how. CHECKMATE solely relies on the what. Specifically, a formal specification ensures solutions' correctness and enables systematic performance evaluation of the generated programs, while a natura...

AuthorsVeronika Semmelrock, Benedetta Strizzolo, Francesco Zuccato et al.
Primary categorycs.LG
Published29 May 2026
Last updated at source29 May 2026
cs.LGcs.AIcs.LO
Embed this entry
<iframe src="https://silytics.si/embed/item/ebe4ca2a-a0b5-40db-ab2e-1e87aeba0181" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.