- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper proposes AlphaS², a semantic-symbolic co-evolution framework for automated alpha mining. The main idea is to go beyond reusing previously discovered factors by extracting reusable computational structures from them and incorporating these structures into subsequent search.
The framework combines three components. A semantic LLM agent generates and refines executable Python factors based on financial hypotheses and evaluation feedback. An operator-construction agent extracts reusable patterns from these factors and turns them into typed operators. A genetic programming (GP) miner then searches expressions using the expanded operator library. Selected GP factors are fed back to the LLM as parents or references for further evolution.
The method is evaluated on CSI500 and CSI1000. The authors report competitive predictive performance and transaction-cost-adjusted portfolio returns, with ICIRs of 0.2092 and 0.517 and annualized excess returns of 13.22% and 16.58%, respectively. Ablation experiments on CSI1000 and recorded program reuse are used to support the proposed bidirectional transfer mechanism.
Critical strengths
1. A meaningful approach to reusing knowledge from previous alpha discoveries.
The paper addresses an interesting limitation of existing alpha-mining systems: useful structures discovered during factor search are often reused only as parts of complete factors. Extracting them into reusable GP operators is a reasonable way to make previous discoveries more accessible to subsequent symbolic search. The FlowDecaySkew example in Figure 2 and Appendix A illustrates how a learned operator can be applied to new inputs and reused within more complex expressions.
2. A concrete implementation of bidirectional transfer, supported by program-level evidence.
The framework connects LLM-based factor generation with GP search through both operator construction and program feedback. Unlike a purely conceptual proposal, the paper provides operator definitions, validation procedures, prompt templates, and recorded examples of GP-to-LLM reuse. Table 5 gives useful evidence that symbolic discoveries actually entered subsequent LLM generations. The full system also achieves the highest portfolio IR among the reported CSI1000 ablation configurations.
Critical weaknesses
1. Insufficient evidence for the effectiveness of the proposed mechanisms.
The paper proposes two key mechanisms: extracting reusable operators from LLM-generated factors to improve GP search, and feeding GP discoveries back to the LLM to improve subsequent factor generation. However, the experiments provide limited direct evidence for either claim.
First, the benefit of learned operators remains unclear. In Table 3, removing the operator-construction agent yields a higher portfolio IR than the archive-only configuration with learned operators (1.742 vs. 1.563). More direct evidence is needed to show that these operators improve GP search efficiency or factor quality under comparable search budgets.
Second, while the full system outperforms archive-only feedback in portfolio IR (1.922 vs. 1.563), and Table 5 confirms that GP discoveries are reused, neither result directly shows whether GP feedback improves the quality of subsequent LLM-generated hypotheses or factors.
Since these mechanisms are central to the paper's contribution, their effectiveness should be evaluated more directly, rather than mainly through downstream portfolio performance.
2. Insufficient clarity and rigor in the search and evaluation protocols.
The semantic evolution procedure is not sufficiently specified. Section 4.3 reports 500 initial and 500 continuation LLM proposals, but it remains unclear how proposals use previous evaluation feedback, how the search is scheduled, and how many complete co-evolution cycles are performed. This makes the proposed iterative process difficult to reproduce.
The experimental comparisons are also limited. Table 2 relies on published baseline results rather than rerunning methods under a unified evaluation protocol, and the CSI1000 comparison with AlphaMaster is not fully aligned. Moreover, several closely related LLM-based alpha mining methods, such as HARLA, CogAlpha, and Navigating the Alpha Jungle[1], are discussed or relevant but not included in the main performance comparisons. Comparisons with representative methods under consistent settings would better establish the proposed framework's advantages.
[1]Yu Shi, Yitong Duan, Jian Li. Navigating the Alpha Jungle: An LLM-Powered MCTS Framework for Formulaic Factor Mining
Finally, the factor-selection procedure is less clearly specified for CSI500 than for CSI1000. These issues weaken the reproducibility and reliability of the empirical conclusions.
Questions for authors
Q1. Could the authors clarify the actual execution process of the semantic evolution agent and the overall co-evolution loop?
Section 4.3 reports 500 initial and 500 continuation LLM proposals, but I find it difficult to reconstruct how these proposals are generated and how information flows between them.
Could the authors describe the actual execution process of the initial 500 proposals, particularly how previously generated factors and their evaluation feedback are incorporated into subsequent LLM generations? I would also like to understand how the continuation stage builds on the initial semantic search and the discoveries made by GP.
More broadly, could the authors explain the complete execution timeline of the semantic-symbolic co-evolution process, including how many full co-evolution cycles are performed and how information is carried forward across these cycles?
A concrete description or pseudocode of the actual search procedure would help clarify how the proposed iterative knowledge reuse mechanism is implemented.
Q2. What is the actual benefit of learning new GP operators?
The paper motivates operator construction as a way to improve search under limited computational budgets. However, Table 3 shows that removing the operator-construction agent yields a higher IR than the archive-only configuration with learned operators (1.742 vs. 1.563).
Could the authors clarify the exact configuration differences between these two variants? Is there evidence that the learned operators improve the quality or efficiency of GP search under matched evaluation budgets?
Q3. Can the benefit of direct GP-to-LLM feedback be isolated more clearly?
The full system outperforms archive-only feedback in portfolio IR, but Section 4.3 notes that the search settings differ. Could the authors specify these differences and clarify whether the improvement remains when the initial archive, GP outputs, continuation budget, and downstream selection procedure are held fixed?
It would also help to understand why Table 5 reports 308 continuations with a direct GP parent on CSI500 but only 18 on CSI1000, and whether direct GP-parent usage is associated with improved subsequent factor quality.
Q4. Could the authors clarify the evaluation and factor-selection protocols?
Table 2 uses external baseline results without rerunning them, and the authors acknowledge that the CSI1000 comparison with AlphaMaster is not fully protocol-matched.
In addition, could they provide the final factor-selection rules for CSI500 at the same level of detail as CSI1000, along with the number of selected factors and uncertainty estimates for each ablation configuration?