GoAnt is a quality‑diversity multi‑agent search framework designed for discovering alpha factors in market microstructure data. It employs non‑communicating Explorer, Exploiter, and Connector workers that share an adaptive Mental Map and a Queen dispatcher to allocate evaluation budgets efficiently. On real A‑share data from 2023‑2026, GoAnt achieves significantly higher quality‑weighted yields than baseline methods and maintains strong out‑of‑sample performance.
By Stella Zhao, Tommy Sha
arXiv:2606. 29194v1 Announce Type: new Abstract: Automated alpha mining holds the scoring function fixed and varies the search algorithm over it.
By Yuqi Li, Siyuan Liu, Bingjun Liu
Automated alpha mining has increasingly adopted large language model (LLM) agents for factor generation and iterative discovery. However, existing LLM-based systems often delegate both factor construction and search decisions to the agent itself, without an explicit exploration space or a principled mechanism for navigating that space.
arXiv:2607. 26642v1 Announce Type: new Abstract: Automated alpha mining has increasingly adopted large language model (LLM) agents for factor generation and iterative discovery.
By Jingyang Yi, Jian Yang, Yifei Jin, Yuqi Li, Jian Li
arXiv:2508. 00554v5 Announce Type: replace-cross Abstract: In financial trading, large language model (LLM)-based agents demonstrate significant potential, but their decisions can be sensitive to noisy and non-stationary market information.
By Li Zhao, Rui Sun, Zuoyou Jiang, Bo Yang, Yuxiao Bai, Mengting Chen, Jing Li, Zuo Bai
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:2608. 12841v1 Announce Type: cross Abstract: We study recursive self-improvement at the level of quantitative-investment research: whether an autonomous system can use evidence from earlier experiments to improve the hypotheses and candidates proposed in later iterations.
By Jiacheng Guo, Suozhi Huang, Yunlong Gao, Zihao Li, Jian Ge, Xu Kuang, Mengdi Wang
arXiv:2608.28632v1 Announce Type: new
Abstract: Large language model agents can discover alphas, yet current methods have three weaknesses. The search cannot adapt during the run, automation usually...
By Zongqian Li, Yaoyiran Li, Yaohui Guo, Ming Zhang, Nigel Collier, Eugene Ie
arXiv:2608.29675v1 Announce Type: cross
Abstract: Repository exploration is a distinct and costly stage of coding-agent pipelines: before generating a patch, an agent must identify which repository f...
By Mohammad Nour Al Awad, Sergey Ivanov
arXiv:2605.27787v2 Announce Type: replace-cross
Abstract: Multi-agent systems (MAS) have substantially advanced autonomous software engineering (SWE), but their growing inference energy demands raise...
By Seunghyuk Cho, Sunghyun Choi, Jaeseung Heo, Youngbin Choi, Saemi Moon, MoonJeong Park, Dongwoo Kim
The paper introduces Enrich‑Retrieve‑Rank, a scalable method for discovering capabilities in large agent ecosystems. It replaces in‑context routing with an offline enrichment step that converts sparse metadata into searchable profiles, followed by an online retrieve‑then‑rank pipeline that returns a ranked shortlist without invoking candidates. Experiments show that as the number of capabilities grows from 10 to 7,278, the new approach maintains higher top‑1 accuracy and reduces cost by 70× compared to full‑context baselines.
By Nazib Sorathiya, Daniel Zhang, Bardiya Akhbari
arXiv:2607. 24162v1 Announce Type: new Abstract: Optimizing agentic workflows, such as retrieval-augmented generation (RAG) pipelines, requires navigating a combinatorial space of discrete component choices under tight evaluation budgets.
By Yang Li, Hai Liu, Dian Shao, Yu Wang, Xiyu Chen, Sergey Volkov, Bozhi Wang, Ziyu Sun, Sihang Liu, Ye Luo, Xiaowei Zhang