Jun 2026· arXiv.org· Vol abs/2606.26173· 0 citations· 39 references
Computer Science
TL;DR
AlgoEvolve is presented, an LLM-driven evolutionary framework that generates, evaluates, and iteratively improves executable trading strategies, and introduces a meta-evolutionary outer loop that evolves the prompts guiding program synthesis in the inner loop.
Abstract
Recent work shows that Large Language Models (LLMs) can act as semantic mutation operators for the evolutionary discovery of programs and proofs. Most current applications focus on static coding benchmarks. We extend this paradigm to algorithmic trading. This domain is uniquely challenging because it is noisy, non-stationary, and highly discontinuous. We present AlgoEvolve, an LLM-driven evolutionary framework that generates, evaluates, and iteratively improves executable trading strategies. These strategies are expressed as Python code and evaluated through a rigorous testing protocol. Across multiple experiments, the system exhibits emergent regime-adaptive strategy logic, including autonomous shifts in trading rules. We further introduce a meta-evolutionary outer loop that evolves the prompts guiding program synthesis in the inner loop. This outer loop discovers improved search heuristics. These heuristics balance exploration and exploitation while reducing zero-trade failures. They consistently outperform initial human-designed instructions. The results demonstrate that LLM-based semantic evolution provides a viable approach for continual program synthesis in complex environments.
EvoMem is introduced, a persistent memory architecture for LLM-based evolutionary program search that captures and reuses candidate mutation knowledge and provides evidence that persistent memory can reduce some redundant exploration and improve the reuse and adaptation of successful strategies in LLM-driven evolutiona...
Viktor Volkov, Valentin Khrulkov, Andrey V. Galichin et al.· 0 citations
Differential compiler testing requires automatically generated programs that are not only diverse and bug-revealing, but also semantically well-defined and reproducible. Rule-based generators provide strong validity guarantees but offer limited control over semantic variation, while large language models (LLMs) can syn...
Lang Hong Nguyet Anh, Ho Viet Duc Luong, Vu Van An· Annual Conference on Genetic...· 0 citations
PACE is proposed, which decouples local logic from complete programs by representing it as persistent units called Executable Algorithmic Primitives (EAPs), and maintains a dynamic set of EAPs to enable code-level transfer.
Zhuoliang Xie, Ruihao Zheng, Xiangzhao Xu et al.· 0 citations
Combinatorial problems appear in numerous industrial applications. A common approach is to formulate these problems as declarative constraint models that can subsequently be compiled to and solved by a range of back-end solvers. Recent work shows that Large Language Models (LLMs) can produce correct models from natural...
AlGOBENCH is introduced, a framework that automatically builds novel algorithmic problems from known competitive-programming problems through structured constraint-shifting transformations and error analysis shows that failures are mainly algorithmic rather than implementation-level, suggesting that ALGOBENCH evaluates...
This work proposes a hybrid framework that integrates Large Language Models into GP in two complementary roles: as a semantic mutation operator that proposes non-local program rewrites during evolution, and as a post-evolution repair that iteratively refines single failed programs after search terminates.
Woletemaryam Liyew, Dojun Oh, Seokki Lee et al.· Proceedings of the Genetic a...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.