Article Dans Une Revue Proceedings (AAAI Artificial Intelligence and Interactive Digital Entertainment Conference) Année : 2025

EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis

Résumé

Many approaches to program synthesis perform a combinatorial search within a large space of programs to find one that satisfies a given specification. To tame the search space blowup, previous works introduced probabilistic and neural approaches to guide this combinatorial search by inducing heuristic cost functions. Best-first search algorithms ensure to search in the exact order induced by the cost function, significantly reducing the portion of the program space to be explored. We present a new best-first search algorithm called EcoSearch, which is the first constant-delay algorithm for pre-generation cost function: the amount of compute required between outputting two programs is constant, and in particular does not increase over time. This key property yields important speedups: we observe that EcoSearch outperforms its predecessors on two classic domains.

Fichier non déposé

Dates et versions

hal-04901266 , version 1 (20-01-2025)

Identifiants

Citer

Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde. EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis. Proceedings (AAAI Artificial Intelligence and Interactive Digital Entertainment Conference), In press, ⟨10.48550/arXiv.2412.17330⟩. ⟨hal-04901266⟩
83 Consultations
0 Téléchargements

Altmetric

Partager

  • More