Skip to content

HELIX: Placement Heuristics Evolution via LLM-Instructed Code Exploration

· 0 citations · 41 references

TL;DR

Helix is presented, the first framework for LLM-driven algorithmic evolution of placement algorithms within a production C++ (RTL-to-GDS) flow and achieves 7 × larger fitness gains against a comparable-budget LLM single-shot baseline.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

FrugalEvo: Towards Cost-Aware LLM-Guided Program Evolution

LLM-guided evolutionary methods, such as AlphaEvolve, have emerged as powerful approaches for challenging computational optimization problems, such as circle packing. However, prior work typically optimizes performance gain over a fixed number of iterations. We argue that practical optimization should maximize gain per...

Hui Chen, Xuan Qi, J. Zhao et al. · 1 citation
#natural language process... Open access Oct 2026

SEDIMA: Cross-Run Hierarchical Insight Memory for Evolutionary Search Agents

SEDIMA is introduced, a persistent hierarchical insight memory for evolutionary search agents that distills raw traces into natural-language insights, clusters them by semantic similarity using attention-weighted centroids, and retrieves relevant guidance to condition future mutations, accumulating transferable knowled...

Amirhossein Abaskohi, Mahdi Mostajabdaveh, Zi-Rui Zhou · 0 citations
#artificial intelligence Preprint Sep 2026

PlaceReasoner-Beta: Reasoning-Driven Macro Placement and Benchmarking

This work presents PlaceReasoner-Beta, a verifier-guided multi-agent framework that reformulates macro placement as a closed-loop reasoning problem rather than black-box optimization, demonstrating that reasoning over spatial structure under physical-design feedback can improve end-to-end layout quality beyond proxy-ob...

Qiufeng Li, Cheng-Xuan Wang, Rong-Qian Chen et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Direct Optimization of Generators for Search in Automated Theorem Proving

This work extends Compute-Aligned Training to this setting through an abstraction of policy-guided search, deriving tractable, trace-supported losses and introduces a search-agnostic uniform-allocation (UA) loss that accounts for the budget without specifying the specific search.

Adam Ousherovitch, A. Tewari · 0 citations

Component-Aware Feedback for Self-Evolving Programs

LLM-guided evolutionary search can discover complex programs, but existing methods mostly only save candidate programs and fitness scores while discarding which component edits produced which fitness metric changes. Existing methods force the mutator LLM to infer the effect of prior edits from cluttered histories, maki...

Ethan Lin, Jinming Nian, Yi Fang · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.