arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.07659cs.LGcs.AIq-fin.ST
收藏

连续程序搜索

Continuous Program Search

New York NY USA(纽约纽约州)

Matthew Siper, Muhammad Umair Nasir, Ahmed Khalifa, Lisa Soros, Jay Azhang, Julian Togelius

AI总结:

本文提出通过几何编译突变提升连续程序搜索效率,实现更高效和可靠的策略发现。

摘要:

遗传编程能够产生可解释的程序,但微小的语法变异可能导致较大的、不可预测的行为变化,从而降低局部性和样本效率。我们将此问题视为一个操作符设计问题:学习一个连续的程序空间,其中潜在距离具有行为意义,然后设计突变操作符,以利用这种结构而不改变进化优化器。我们通过跟踪受控潜在扰动下的动作级差异来衡量局部性,识别出行为局部连续变化的经验信任区域。使用一个包含四个语义组件(多空/空入场和出场)的紧凑交易策略DSL,我们学习了一个匹配的块因子化嵌入,并将各向同性高斯突变在整个潜在空间上与几何编译突变进行比较,后者限制更新到语义上配对的入场-出场子空间,并使用在记录的突变结果上训练的流基模型提出方向。在五种资产上,使用相同的(μ+λ)进化策略和固定评估预算下,学习的突变操作符通过数量级更少的评估发现强大的策略,并实现了最高的中位数外样本夏普比率。尽管各向同性突变偶尔能获得更高的峰值表现,几何编译突变却能更快、更可靠地推进,证明了语义上对齐的突变可以显著提高搜索效率,而无需修改底层的进化算法。

英文摘要:

Genetic Programming yields interpretable programs, but small syntactic mutations can induce large, unpredictable behavioral shifts, degrading locality and sample efficiency. We frame this as an operator-design problem: learn a continuous program space where latent distance has behavioral meaning, then design mutation operators that exploit this structure without changing the evolutionary optimizer. We make locality measurable by tracking action-level divergence under controlled latent perturbations, identifying an empirical trust region for behavior-local continuous variation. Using a compact trading-strategy DSL with four semantic components (long/short entry and exit), we learn a matching block-factorized embedding and compare isotropic Gaussian mutation over the full latent space to geometry-compiled mutation that restricts updates to semantically paired entry--exit subspaces and proposes directions using a learned flow-based model trained on logged mutation outcomes. Under identical $(μ+λ)$ evolution strategies and fixed evaluation budgets across five assets, the learned mutation operator discovers strong strategies using an order of magnitude fewer evaluations and achieves the highest median out-of-sample Sharpe ratio. Although isotropic mutation occasionally attains higher peak performance, geometry-compiled mutation yields faster, more reliable progress, demonstrating that semantically aligned mutation can substantially improve search efficiency without modifying the underlying evolutionary algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑