arXiv Computation and Language By Fengyuan Liu, Yuchen Fu, Yuqi Wang, Fengyuan Liu, Mukai Li, Qi Liu

X-Alpha: An AI Quant Researcher with Memory-Driven Self-Evolution

Read the original on arXiv Computation and Language →

X-Alpha is an AI Quant Researcher that uses persistent research memory and continuous hypothesis-to-code discovery to overcome key bottlenecks in automated alpha mining. It converts financial reports into actionable research paths via Report-to-Memory Abstraction, directs exploration with memory-driven routing, and refines hypotheses through executable factors and empirical validation. Experiments on five equity indices, especially CSI300, show that X-Alpha improves factor quality, signal diversity, and consistently outperforms baselines across markets and horizons.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Sep 25

AlphaDiverse: Post-Training Local Quantitative Research Agents for Diverse Exploration in Alpha Factor Mining

AlphaDiverse is a framework that enhances large language model–based multi‑agent systems for alpha factor mining by addressing cost, availability, and confidentiality constraints. It generates diverse research paths through varied environments and post‑training local agents, then fine‑tunes these agents with supervised learning and optimizes them jointly using a GRPO method that balances predictive quality and diversity. The approach limits research feedback to inner‑period data and evaluates a frozen model on outer‑period data to avoid test‑set tuning, demonstrating competitive prediction and broader exploration across four Chinese stock universes.

By Qingzhuo Wang, Zikun Wei, Zhihua Wei, Wen Shen
arXiv AI
Oct 26

AlphaMemo: Structured Search-Process Memory for Self-Evolving Alpha Mining Agents

AlphaMemo is a self‑evolving alpha‑mining agent that uses Structured Search‑Process Memory to improve factor discovery. Instead of storing only final factors or full search trajectories, it records reusable evidence about which edit motifs succeed or fail in specific parent‑factor contexts, extracted from Abstract Syntax Tree differences. The system incorporates confidence‑gated residual memory, a search‑ledger prior, and asymmetric veto control to suppress high‑confidence failure patterns, leading to better out‑of‑sample performance and fixed‑budget discovery efficiency on CSI 500 and S&P 500 datasets.

By Hang Yu, Zifan Zheng, Chun Gan, Jeff Z. Pan, Tongliang Liu, Zhiyong Wang, Fengxiang He