PACE decouples reusable code components from host algorithms in LLM-based evolution, preserving them across generations, and reports stronger results than prior AAD methods on four tasks.
ACM Computing Surveys , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SE 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
PACE: Primitive-Aware Code Evolution for Automated Algorithm Design
PACE decouples reusable code components from host algorithms in LLM-based evolution, preserving them across generations, and reports stronger results than prior AAD methods on four tasks.