CosmosAlpha: Multi-Relational Graph Search with Pareto-Guided Exploration for LLM-Driven Alpha Mining
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Quantitative Finance. The day in quantitative finance: models of markets, risk and prices.
Ruth: We're looking at the paper: "CosmosAlpha: Multi-Relational Graph Search with Pareto-Guided Exploration for LLM-Driven Alpha Mining".
Warren: Here's the gist of the paper. Discovering predictive alpha factors from noisy financial data is a fundamental yet challenging problem in quantitative finance The paper introduces CosmosAlpha, an LLM-driven framework that organizes evaluated factors as a multirelational search state This framework combines generation lineage, expression structure, and cross-sectional exposure correlation to guide factor mining through Graph Flow and Pareto-guided selection.
Ruth: Pruning redundant reasoning tokens The existing generation-centric and tree-based search strategies primarily organize factors through generation lineage, leaving structural and statistical relationships across search branches underutilized Information remains localized along parent–child trajectories, which can confine exploration to redundant regions CosmosAlpha represents discovered factors as a multi-relational graph encoding generation lineage, expression-structure similarity, and cross-sectional exposure correlation A Graph Flow mechanism propagates search utilities across the graph, allowing each factor to be assessed using relational evidence from nearby factors rather than in isolation Pareto-guided selection jointly considers quality, fertility and diversity, explicitly modeling their trade-offs within a multi-objective search framework Across CSI 300 and CSI 500, CosmosAlpha-Graph achieves the best mean rank over seven predictive and portfolio metrics and outperforms its controlled CosmosAlpha-MCTS counterpart on every reported metric How the training signal is built The search state is modeled as a multi-relational graph G = (V, E gen, E str, E corr), where nodes are evaluated factors The three relations capture complementary notions of factor proximity, including generation relation i → j for provenance, structure relation dstr ij based on canonical subexpression similarity, and correlation relation dcorr ij based on cross-sectional Pearson correlation Cij Node utilities are defined by a three-dimensional vector Ri = (Q self i, Qfert i, Qdiv i), where intrinsic quality qi measures predictive strength, fertility measures whether previous expansions produced high-quality descendants, and diversity measures redundancy relative to a reference set Rr These utilities are propagated through the graph using Graph Flow F(k+1) = (1 − γ)R + γP F(k), where P is the combined transition matrix of generation, structure, and correlation links Where the gains come from The key innovation lies in combining relational evidence with distinct quality, fertility, and diversity criteria through Graph Flow and Pareto-guided selection The search utility propagation allows parent assessment to reflect both local measurements and evidence from related factors Parent selection operates on propagated vectors Fi = (F self i, Ffert i, Fdiv i) by applying nondominated sorting rather than a fixed scalarization of quality, fertility, and diversity This preserves non-dominated trade-offs without collapsing these criteria to a single scalar The results show that CosmosAlpha-Graph achieves the best overall mean rank on both CSI 300 and CSI 500 and outperforms the controlled CosmosAlpha-MCTS counterpart on every reported predictive and portfolio metric Evaluation Protocol The evaluation protocol involves recomputing each method’s factor pool under a common data protocol, using the factors jointly as LightGBM features Predictive performance is measured from held-out LightGBM predictions using IC, ICIR, RankIC, and RankICIR Portfolio performance is measured from the same signal using annualized return (ARR), information ratio (IR), and signed maximum drawdown (MDD) The final MeanRankm summarizes the four predictive and three portfolio metrics for each method CosmosAlpha-Graph achieves the best mean rank on both CSI 300 and CSI 500 under a common data and downstream LightGBM integration protocol The results indicate that the graph variant’s advantage also extends to CSI 500, although Alpha158 retains an advantage on RankICIR LLM Sensitivity Study Across all three backbone models, Graph delivers the strongest overall performance and leads all seven metrics for each backbone The portfolio results particularly favor DeepSeek-V4-Flash in the Graph setting, leading ARR, IR, and signed MDD for Graph The mean IC, ICIR, RankIC, and RankICIR are 0.0326, 0.3467, 0.0501, and 0.5699 for CosmosAlpha-Graph on CSI 300 The same ordering holds for the portfolio metrics: Graph reaches a mean ARR of 8.45%, IR of 0.5398, and signed MDD of −25.10% Across each search mode, the three backbone models remain relatively close on Predictive Performance, whereas the differences between Graph, MCTS, and Chain are more pronounced CosmosAlpha-Graph has the highest mean in all seven metrics when using the three independent runs The mean IC, ICIR, RankIC, and RankICIR are 0.0326, 0.3467, 0.0501, and 0.5699 for CosmosAlpha-Graph on CSI 300 under the three independent runs The same ordering holds for the portfolio metrics: Graph reaches a mean ARR of 8.45%, IR of 0.5398, and signed MDD of −25.10% Ablation Study Insights Every ablation in Table 3 falls below the full model on all seven metrics, supporting the joint use of the quality archive, Flow-level parent selection, all three utility objectives, and all three graph relations The Flow scalarization variant retains the intrinsic-quality Pareto archive but replaces Pareto front and crowding-based parent ranking with an equal-weight score over the propagated utilities (Q, F, D) Removing Structure or Correlation excludes that relation from both Graph Flow and AverageDistance The remaining Flow relation weights are renormalized The results confirm that relational propagation, Pareto-guided selection, utility composition, and the three graph relations are all necessary for optimal performance Factor Language Specification CosmosAlpha restricts candidate generation to a fixed domain-specific language (DSL) defined by a versioned field and operator catalog The DSL includes nine daily market fields as terminals, such as open Oi,t and close Pi,t The operator catalog contains 26 canonical names, including non-windowed operators like add(x,y) and time-series operators like corr(x,y,w) The expression space is constrained by rules such as a maximum AST depth of 15 and an operator count cap of at most 32 call nodes This ensures that the LLM generates expressions within a syntactically valid search space The final factor expression system message instructs the agent to translate one supplied FactorDesign into one CosmosAlpha DSL expression, returning only exactly what is requested The paper provides concrete examples of factors, such as E1 which uses the expression decay linear(div(sub(close,vwap),sub(high,low)),5) The catalog specifies that variables like industry id gi,t are consumed internally by indneutralize and cannot be inserted directly into a generated expression The DSL field set is strictly defined to include only admissible fields from Table 13 The operator catalog details the numerical behavior of each operator, specifying rules for missing inputs and window reducers The syntax normalizer produces deterministic lowercase prefix text but does not perform algebraic simplification or reorder operands, while Graph identity applies a narrower commutative rule to ensure structural consistency A node’s final undirected degree can therefore exceed 30 after combining the three modalities CosmosAlpha introduces an LLM-driven framework that organizes evaluated factors as a multirelational search state connecting generation lineage, expression structure, and cross-sectional exposure correlation It uses Graph Flow to propagate quality, fertility, and diversity through these relations and Pareto-guided selection to guide expansion beyond local generation history CosmosAlpha-Graph achieves the best mean rank on both CSI 300 and CSI 500 and outperforms the controlled CosmosAlpha-MCTS variant on every reported metric The framework demonstrates that relational graph search is superior for LLM-driven factor mining The source code is available at https://github.com/wzhmtldswz/CosmosAlpha References The paper cites numerous prior works in formulaic alpha mining, evolutionary search, and LLM-driven agentic systems Specific related methods include AlphaPROBE which combines retrieval-guided factor proposal with graph-biased evolution, and AlphaSAGE which uses GFlowNets to encourage diverse exploration The paper also compares CosmosAlpha against various LLM backbones including DeepSeek-V4-Flash, GPT-5.6-Sol, and Kimi K3 across different search modes The stability study confirms that CosmosAlpha-Graph has the highest mean in all seven metrics when using the three independent runs Future work will apply CosmosAlpha to additional markets and to the discovery of high-frequency and fundamental factors The paper uses historical market data and does not involve human participants, personal data, or interaction with individual investors This work is an offline research evaluation, and its backtest results should not be interpreted as financial advice or guaranteed live-trading performance The reproducibility statement specifies the rolling-operator lookback window and temporal splits for all experiments The authors acknowledge support from various national science foundations This work is supported by the National Natural Science Foundation of China (Grant No.
Warren: 12475064), the National Key Research and Development Program of China (Grant No.
Ruth: 2021YFC2203004), and the Fundamental Research Funds for the Central Universities The AI use statement notes that Generative AI tools were used primarily for English-language editing, grammar correction, and local improvements in clarity and organization The ethics statement confirms that this work uses historical market data and does not involve human participants, personal data, or interaction with individual investors The reproducibility statement specifies the rolling-operator lookback window and temporal splits for all experiments The released artifacts will identify the exact code revision used for each experiment Page 11 --- The paper cites Emmanuel Bengio et al.
Paper summary: Ruth: So we're looking at this paper now called CosmosAlpha: Multi-Relational Graph Search with Pareto-Guided Exploration for LLM-Driven Alpha Mining. It tackles this really fundamental problem in quantitative finance, which is finding predictive alpha factors from messy financial data.
Warren: Right. The core idea here is that using a large language model to find these formulaic alpha factors is attractive because you get interpretable expressions, but the search methods we have now are mostly just focused on generation lineage.
Iris: That's what the abstract points out, Warren. Existing methods organize things by how they were generated, which means structural and statistical relationships across different search branches are left underutilized.
Ruth: Exactly. So what CosmosAlpha claims is that instead of just looking at where a factor came from in the generation process, it uses a graph structure to connect factors based on three different kinds of relationships.
Warren: It encodes generation lineage, expression structure similarity, and cross-sectional exposure correlation into this multi-relational graph. That means when you look at one factor, you can instantly see its structural neighbors and how it correlates with other factors across the market.
Iris: The framework uses something called a Graph Flow mechanism to spread search utilities across this graph so that each factor gets assessed using evidence from nearby factors instead of being judged in isolation.
Ruth: And on top of that, they use Pareto-guided selection to choose which parents to expand next by jointly considering quality, fertility, and diversity.
Warren: They are explicitly modeling the trade-offs between those three things—quality, fertility, and diversity—within a multi-objective search framework so the system doesn't just optimize for one thing.
Iris: That’s interesting because quality measures present predictive strength, fertility looks at whether past expansions led to good results, and diversity checks if a factor is in a less redundant part of the pool.
Ruth: So what does this mean for us right now? The paper says that across the CSI three hundred and CSI five hundred datasets, CosmosAlpha-Graph achieves the best mean rank over seven predictive and portfolio metrics.
Warren: It also outperforms its controlled CosmosAlpha-MCTS counterpart on every single reported metric, which suggests that this relational graph search approach gives a consistent edge in factor mining with LLMs.
Paper summary: Iris: That’s solid evidence showing that when you combine those three specific dimensions—generation, structure, and correlation—with Pareto guidance, you get a better outcome than relying on just one or two of those signals alone.
Ruth: It seems the main implication is that for anyone doing automated alpha mining with LLMs, moving beyond just lineage-based search to a multi-relational graph approach provides a much richer way to explore the space.
Warren: And it suggests that simply generating more factors isn't enough; you have to manage redundancy and structure simultaneously, or you end up exploring the same noisy regions over and over.
Iris: I think the key is how they defined those relations, especially how they measured structural similarity using Jaccard similarity and cross-sectional correlation by averaging daily Pearson correlations.
Ruth: That detail matters because it shows them mapping very concrete financial concepts—like expression structure and market behavior—onto the graph edges.
Warren: And before we go deeper into the specific search mechanics, I want to quickly address how this works in practice for someone running a system. The paper says they restrict candidate generation to a fixed domain-specific language or DSL.
Iris: That’s important because it means the LLM isn't just free-form writing; it has rules about what fields you can use and what operators you can combine, keeping the generated expressions syntactically valid.
Ruth: So, the system enforces a specific vocabulary and syntax before letting the LLM generate something that looks like a factor expression.
Warren: And they specify things like an AST depth limit of fifteen call nodes and an operator count cap of thirty-two call nodes to keep the search space manageable for the model.
Iris: That constraint helps prevent the LLM from just generating incredibly complex, uninterpretable mathematical monstrosities that we wouldn't be able to use for alpha.
Ruth: It seems like they’ve built a very controlled sandbox where you can mine factors systematically, rather than just throwing everything at the wall and hoping something useful comes out.
Warren: It shows they are trying to make the LLM generation process more grounded in what actually constitutes a usable financial expression.
Paper summary: Iris: And as we look at their evaluation protocol, they use a common data protocol and integrate the factors into a LightGBM model for predictive performance measurement using things like IC and RankICIR.
Ruth: That’s smart because it tests the final integrated signal, not just individual factors in isolation, which is how you actually trade or use alpha in production.
Warren: And for portfolio performance, they look at annualized return or ARR, information ratio or IR, and signed maximum drawdown MDD using the same signal.
Iris: That’s a comprehensive way to measure success because it checks both the predictive power of the signals and how those signals behave when you actually try to manage a portfolio.
Ruth: So, in conclusion for CosmosAlpha: Multi-Relational Graph Search with Pareto-Guided Exploration for LLM-Driven Alpha Mining, they are proposing this graph framework as superior because it captures more relationships than previous generation-centric methods.
Warren: It’s about using the graph to connect structure and correlation alongside lineage, and then using those connections to guide the search through quality, fertility, and diversity trade-offs.
Iris: The authors argue that this relational propagation allows parent assessment to reflect both local measurements and evidence from related factors in a way that isolates promising regions better than just looking at the immediate parent.
Ruth: It’s essentially saying that exploring based on structural similarity and cross-sectional correlation is a necessary step if you want the LLM mining process to be effective in finding high-quality, diverse factors.
Warren: The paper suggests that this relational graph search approach is the better way to do it when using LLMs for alpha mining compared to older tree-based or generation-only strategies.
Iris: The limitation they mention is that while the graph captures these relations well, they haven't explicitly shown how this framework scales perfectly when moving to even larger market datasets beyond CSI five hundred.
Ruth: It’s a realistic point; the performance is proven on CSI three hundred and five hundred but we still need to see if it holds up under more extreme conditions.
Warren: So, for the listener tuning in, the big picture here is that sophisticated financial discovery with AI needs to move past simple generation and start modeling how different ideas relate to each other across time and structure.
Conclusion: Ruth: So, to wrap up, CosmosAlpha is this new framework that uses a graph structure to connect factors based on generation lineage, expression structure similarity, and cross-sectional exposure correlation to guide the AI factor mining process.
Warren: Right. It’s essentially taking all those different ways factors relate—how they were made, how they look mathematically—and weaving them into one big map.
Iris: And this isn't just a simple map; it uses a mechanism called Graph Flow to spread search utility across the graph so each factor gets assessed using evidence from its neighbors instead of being in isolation.
Ruth: It then uses Pareto-guided selection to choose the next factors to explore by looking at quality, fertility, and diversity all at once.
Warren: That’s what the authors are claiming is a significant step forward because it models those trade-offs between quality and diversity explicitly within a multi-objective search framework.
Iris: They show that this approach achieves the best mean rank across seven predictive and portfolio metrics on both the CSI three hundred and CSI five hundred datasets.
Ruth: It also beats their controlled version, CosmosAlpha MCTS, on every single reported metric, which shows a consistent advantage for this relational graph search method in LLM driven factor mining.
Warren: So what does this mean for the world? It suggests that when you’re using AI to find alpha factors from financial data, just generating more ideas isn't enough; you have to model how those ideas interact structurally and statistically across different market conditions.
Iris: The limitation they mention is that while it performs great on CSI three hundred and five hundred they haven't shown how this framework scales perfectly when you move to much larger market datasets.
Ruth: Exactly. It’s a solid result for the datasets they tested, but we still need to see if this relational graph search holds up under more extreme conditions with bigger data.
Warren: We'll look at those scaling issues next, so keep your eyes peeled for that discussion on how this system handles massive amounts of financial data.
Zhan-He Wang, Zi-Yang Lang, Yi-Yang Li, Qing-Yu Lan, Yun-Song Piao
Artificial Intelligence and Quantitative Finance Laboratory, University of Chinese Academy of Sciences · School of Physics and Astronomy, Shanghai Jiao Tong University · Hangzhou Institute for Advanced Study, UCAS
q-fin.CP, cs.AI, cs.LG
Submitted: 2026-11-03
Updated: 2026-11-03
Comments: 41 pages, 3 figures
Code: https://github.com/wzhmtldswz/CosmosAlpha
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 96/100
The gist: Discovering predictive alpha factors from noisy financial data is a fundamental yet challenging problem in quantitative finance The paper introduces CosmosAlpha…
Key concepts
- Multi-Relational Graph
- This framework organizes discovered factors as a graph where nodes are factors. The edges represent three distinct relationships: generation lineage (how one factor was created from another), expression structure similarity (how similar the mathematical formulas are), and cross-sectional exposure correlation (how related the factors' performance is across different markets).
- Graph Flow Mechanism
- This mechanism propagates search utilities—quality, fertility, and diversity scores—across the entire graph. Instead of evaluating a factor in isolation, its utility is informed by relational evidence from its neighbors. This allows each factor to be assessed based on the collective knowledge of related factors during the search process.
- Pareto-Guided Selection
- This selection method guides expansion by considering three objectives—quality (predictive strength), fertility (ability to produce good descendants), and diversity (redundancy). Instead of picking a single best factor, it uses nondominated sorting to select factors that represent the best possible trade-offs between these competing goals.
- Node Utilities
- Each factor node is assigned a three-dimensional vector representing its utility: intrinsic quality (predictive strength), fertility (how productive it is), and diversity (its uniqueness relative to existing factors). These utilities are propagated through the graph using Graph Flow to guide the search toward factors that balance these three dimensions effectively.
Summary
Discovering predictive alpha factors from noisy financial data is a fundamental yet challenging problem in quantitative finance The paper introduces CosmosAlpha, an LLM-driven framework that organizes evaluated factors as a multirelational search state This framework combines generation lineage, expression structure, and cross-sectional exposure correlation to guide factor mining through Graph Flow and Pareto-guided selection. p. 8
Pruning redundant reasoning tokens
The existing generation-centric and tree-based search strategies primarily organize factors through generation lineage, leaving structural and statistical relationships across search branches underutilized Information remains localized along parent–child trajectories, which can confine exploration to redundant regions CosmosAlpha represents discovered factors as a multi-relational graph encoding generation lineage, expression-structure similarity, and cross-sectional exposure correlation A Graph Flow mechanism propagates search utilities across the graph, allowing each factor to be assessed using relational evidence from nearby factors rather than in isolation Pareto-guided selection jointly considers quality, fertility and diversity, explicitly modeling their trade-offs within a multi-objective search framework Across CSI 300 and CSI 500, CosmosAlpha-Graph achieves the best mean rank over seven predictive and portfolio metrics and outperforms its controlled CosmosAlpha-MCTS counterpart on every reported metric
How the training signal is built
The search state is modeled as a multi-relational graph G = (V, E gen, E str, E corr), where nodes are evaluated factors The three relations capture complementary notions of factor proximity, including generation relation i → j for provenance, structure relation dstr ij based on canonical subexpression similarity, and correlation relation dcorr ij based on cross-sectional Pearson correlation Cij Node utilities are defined by a three-dimensional vector Ri = (Q self i, Qfert i, Qdiv i), where intrinsic quality qi measures predictive strength, fertility measures whether previous expansions produced high-quality descendants, and diversity measures redundancy relative to a reference set Rr These utilities are propagated through the graph using Graph Flow F(k+1) = (1 − γ)R + γP F(k), where P is the combined transition matrix of generation, structure, and correlation links
Where the gains come from
The key innovation lies in combining relational evidence with distinct quality, fertility, and diversity criteria through Graph Flow and Pareto-guided selection The search utility propagation allows parent assessment to reflect both local measurements and evidence from related factors Parent selection operates on propagated vectors Fi = (F self i, Ffert i, Fdiv i) by applying nondominated sorting rather than a fixed scalarization of quality, fertility, and diversity This preserves non-dominated trade-offs without collapsing these criteria to a single scalar The results show that CosmosAlpha-Graph achieves the best overall mean rank on both CSI 300 and CSI 500 and outperforms the controlled CosmosAlpha-MCTS counterpart on every reported predictive and portfolio metric
Evaluation Protocol
The evaluation protocol involves recomputing each method’s factor pool under a common data protocol, using the factors jointly as LightGBM features Predictive performance is measured from held-out LightGBM predictions using IC, ICIR, RankIC, and RankICIR Portfolio performance is measured from the same signal using annualized return (ARR), information ratio (IR), and signed maximum drawdown (MDD) The final MeanRankm summarizes the four predictive and three portfolio metrics for each method CosmosAlpha-Graph achieves the best mean rank on both CSI 300 and CSI 500 under a common data and downstream LightGBM integration protocol The results indicate that the graph variant’s advantage also extends to CSI 500, although Alpha158 retains an advantage on RankICIR
LLM Sensitivity Study
Across all three backbone models, Graph delivers the strongest overall performance and leads all seven metrics for each backbone The portfolio results particularly favor DeepSeek-V4-Flash in the Graph setting, leading ARR, IR, and signed MDD for Graph The mean IC, ICIR, RankIC, and RankICIR are 0.0326, 0.3467, 0.0501, and 0.5699 for CosmosAlpha-Graph on CSI 300 The same ordering holds for the portfolio metrics: Graph reaches a mean ARR of 8. p. 045%, IR of 0.5398, and signed MDD of −25. p. 7 p. 710% Across each search mode, the three backbone models remain relatively close on Predictive Performance, whereas the differences between Graph, MCTS, and Chain are more pronounced CosmosAlpha-Graph has the highest mean in all seven metrics when using the three independent runs The mean IC, ICIR, RankIC, and RankICIR are 0. p. 20326, 0.3467, 0.0501, and 0.5699 for CosmosAlpha-Graph on CSI 300 under the three independent runs The same ordering holds for the portfolio metrics: Graph reaches a mean ARR of 8. p. 245%, IR of 0.5398, and signed MDD of −25.10%
Ablation Study Insights
Every ablation in Table 3 falls below the full model on all seven metrics, supporting the joint use of the quality archive, Flow-level parent selection, all three utility objectives, and all three graph relations The Flow scalarization variant retains the intrinsic-quality Pareto archive but replaces Pareto front and crowding-based parent ranking with an equal-weight score over the propagated utilities (Q, F, D) Removing Structure or Correlation excludes that relation from both Graph Flow and AverageDistance The remaining Flow relation weights are renormalized The results confirm that relational propagation, Pareto-guided selection, utility composition, and the three graph relations are all necessary for optimal performance
Factor Language Specification
CosmosAlpha restricts candidate generation to a fixed domain-specific language (DSL) defined by a versioned field and operator catalog The DSL includes nine daily market fields as terminals, such as open Oi,t and close Pi,t The operator catalog contains 26 canonical names, including non-windowed operators like add(x,y) and time-series operators like corr(x,y,w) The expression space is constrained by rules such as a maximum AST depth of 15 and an operator count cap of at most 32 call nodes This ensures that the LLM generates expressions within a syntactically valid search space The final factor expression system message instructs the agent to translate one supplied FactorDesign into one CosmosAlpha DSL expression, returning only exactly what is requested The paper provides concrete examples of factors, such as E1 which uses the expression decay linear(div(sub(close,vwap),sub(high,low)),5) The catalog specifies that variables like industry id gi,t are consumed internally by indneutralize and cannot be inserted directly into a generated expression The DSL field set is strictly defined to include only admissible fields from Table 13 The operator catalog details the numerical behavior of each operator, specifying rules for missing inputs and window reducers The syntax normalizer produces deterministic lowercase prefix text but does not perform algebraic simplification or reorder operands, while Graph identity applies a narrower commutative rule to ensure structural consistency A node’s final undirected degree can therefore exceed 30 after combining the three modalities
Conclusion
CosmosAlpha introduces an LLM-driven framework that organizes evaluated factors as a multirelational search state connecting generation lineage, expression structure, and cross-sectional exposure correlation It uses Graph Flow to propagate quality, fertility, and diversity through these relations and Pareto-guided selection to guide expansion beyond local generation history CosmosAlpha-Graph achieves the best mean rank on both CSI 300 and CSI 500 and outperforms the controlled CosmosAlpha-MCTS variant on every reported metric The framework demonstrates that relational graph search is superior for LLM-driven factor mining The source code is available at https://github.com/wzhmtldswz/CosmosAlpha
References
The paper cites numerous prior works in formulaic alpha mining, evolutionary search, and LLM-driven agentic systems Specific related methods include AlphaPROBE which combines retrieval-guided factor proposal with graph-biased evolution, and AlphaSAGE which uses GFlowNets to encourage diverse exploration The paper also compares CosmosAlpha against various LLM backbones including DeepSeek-V4-Flash, GPT-5.6-Sol, and Kimi K3 across different search modes The stability study confirms that CosmosAlpha-Graph has the highest mean in all seven metrics when using the three independent runs Future work will apply CosmosAlpha to additional markets and to the discovery of high-frequency and fundamental factors The paper uses historical market data and does not involve human participants, personal data, or interaction with individual investors This work is an offline research evaluation, and its backtest results should not be interpreted as financial advice or guaranteed live-trading performance The reproducibility statement specifies the rolling-operator lookback window and temporal splits for all experiments The authors acknowledge support from various national science foundations This work is supported by the National Natural Science Foundation of China (Grant No. p. 9 12475064), the National Key Research and Development Program of China (Grant No. p. 0 2021YFC2203004), and the Fundamental Research Funds for the Central Universities The AI use statement notes that Generative AI tools were used primarily for English-language editing, grammar correction, and local improvements in clarity and organization The ethics statement confirms that this work uses historical market data and does not involve human participants, personal data, or interaction with individual investors The reproducibility statement specifies the rolling-operator lookback window and temporal splits for all experiments The released artifacts will identify the exact code revision used for each experiment
--- Page 11 ---
The paper cites Emmanuel Bengio et al. for Flow network based generative models It also cites Kalyanmoy Deb et al. p. 4 for a fast and elitist multiobjective genetic algorithm The paper includes detailed appendix details on metric definitions and search semantics The paper provides concrete factor examples illustrating the selection criteria in the intrinsic Quality Pareto Archive The authors provide environment specifications for regeneration and evaluation protocols
--- Page 12 ---
The paper cites Eugene Fama and Kenneth R. French for foundational concepts of alpha mining The paper includes detailed appendix details on metric definitions and search semantics
--- Page 13 ---
The paper cites Johannes Klicpera et al. for graph neural networks meeting personalized PageRank The paper provides concrete factor examples illustrating the selection criteria in the intrinsic Quality Pareto Archive
--- Page 14 ---
The paper cites Shuo Yu et al. for generating synergistic formulaic alpha collections via reinforcement learning The paper also cites AlphaForge which mines formulaic alpha factors and dynamically combines them into factor collections The paper compares CosmosAlpha against various LLM backbones including DeepSeek-V4-Flash, GPT-5. p. 26-Sol, and Kimi K3
--- Page 15 ---
The paper cites Emmanuel Bengio et al. for Flow network based generative models It also cites AlphaSAGE which uses GFlowNets to encourage diverse exploration The paper includes detailed appendix details on metric definitions and search semantics
--- Page 16 ---
The paper cites Zitzler and Thiele for multiobjective evolutionary algorithms It also cites AlphaPROBE which combines retrieval-guided factor proposal with graph-biased evolution The paper compares CosmosAlpha against various LLM backbones including DeepSeek-V4-Flash, GPT-5.6-Sol, and Kimi K3
--- Page 17 ---
The paper cites Shuo Yu et al. for generating synergistic formulaic alpha collections via reinforcement learning It also cites AlphaForge which mines formulaic alpha factors and dynamically combines them into factor collections The paper compares CosmosAlpha against various LLM backbones including DeepSeek-V4-Flash, GPT-5. p. 26-Sol, and Kimi K3
--- Page 18 ---
The paper cites the foundational concepts of alpha mining by Fama and French The paper includes detailed appendix details on metric definitions and search semantics
The existing generation-centric and tree-based search strategies primarily organize factors through generation lineage, leaving structural and statistical relationships across search branches underutilized Consequently, information remains localized along parent–child trajectories, which can confine exploration to redundant regions Moreover, effective factor discovery must account for multiple distinct objectives that cannot be adequately captured by a single search criterion CosmosAlpha introduces a graph-based LLM factor-mining framework that represents discovered factors as a multi-relational graph encoding generation lineage, expression-structure similarity, and cross-sectional exposure correlation The Graph Flow mechanism propagates search utilities across the graph, allowing each factor to be assessed using relational evidence from nearby factors rather than in isolation Pareto-guided selection jointly considers quality, fertility and diversity, explicitly modeling their trade-offs within a multi-objective search framework
The three relations capture complementary notions of factor proximity: generation lineage, expression structure similarity, and empirical cross-sectional exposure correlation Structure similarity is defined by Jaccard similarity S str ij = Si ∩ Sj / Si ∪ Sj dstr ij = 1 − S str ij Correlation relation measures behavioral proximity by computing daily cross-sectional Pearson correlation Cij and then averaging equally over valid dates dcorr ij = 1 − Cij Node utilities are defined as Ri = (Q self i, Qfert i, Qdiv i), which are propagated via Graph Flow F(k+1) = (1 − γ)R + γP F(k) The search utility composition is achieved by mapping the three objectives through fixed pre-specified normalization functions and averaging them to obtain a scalar node quality Qself i
The search utility Ri reflects node-specific evidence but ignores the quality of its neighborhood, which is addressed by Graph Flow Parent selection operates on propagated vectors Fi = (F self i, Ffert i, Fdiv i) using nondominated sorting rather than a manually weighted scalarization The resulting node utility Ri is the three-dimensional vector (Q self i, Qfert i, Qdiv i) This approach allows for the preservation of non-dominated trade-offs among quality, fertility, and diversity during parent selection CosmosAlpha-Graph achieves the best mean rank on both CSI 300 and CSI 500 and outperforms its controlled CosmosAlpha-MCTS counterpart on every reported metric The search behavior analysis shows that Graph maintains a stable Fertility signal throughout the search, indicating continued productive improvement The pattern of higher AverageDistance over nearly the entire trajectory supports the role of generation, structure, and correlation relations in preserving factor diversity and reducing local search risk
The final predictive metrics use the same daily definitions but evaluate the integrated LightGBM signal rather than an individual factor Predictive performance is measured from held-out LightGBM predictions using IC, ICIR, RankIC, and RankICIR Portfolio performance is measured from the same signal using annualized return (ARR), information ratio (IR), and signed maximum drawdown (MDD) The final MeanRankm summarizes the four predictive and three portfolio metrics for each method CosmosAlpha-Graph achieves the best mean rank on both CSI 300 and CSI 500 under a common data and downstream LightGBM integration protocol The results indicate that the graph variant’s advantage also extends to CSI 500, although Alpha158 retains an advantage on RankICIR The three independent runs show that C…
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Multi-relational graph representation allows for assessing each factor using
relational evidence from nearby factors rather than in isolation,
enabling information propagation across search branches to avoidlocal exploration.
-
Pareto-guided selection jointly considers
quality, fertility and diversity, explicitly modeling their trade-offs within a multi-objective search framework
by selecting parents from successive non-dominated fronts in the propagated utility space. -
The Graph Flow mechanism propagates node utilities through the graph structure, allowing each factor to be assessed using evidence from its neighbors, which is superior to methods that
primarily organize factors through generation lineage.
-
The system can discover factors that share similar structures or exposure profiles by encoding
expression-structure similarity
as a relation type in the graph. -
The framework allows for the isolation of search effects by providing a controlled evaluation where
CosmosAlpha-Graph and CosmosAlpha-MCTS share the factor language, evaluator, LLM backbone, and downstream modeling protocol,
testing the benefit of relational graph search. -
The AI system can generate parent-grounded mutations conditioned on
parent expression with its raw quality metrics, current Quality, Fertility, AverageDistance, expansion history
instead of relying on undifferentiated collections of prior factors. -
The framework implements a complex search state that evolves iteratively as
the factor archive is thus no longer a passive record of past attempts; it becomes the state that organizes subsequent exploration.
Sources
- AlphaPROBE: Alpha Mining via Principled Retrieval and On-graph biased evolution
- QuantaAlpha: An Evolutionary Framework for LLM-Driven Alpha Mining
- Qlib: An AI-oriented Quantitative Investment Platform
- AutoAlpha: an Efficient Hierarchical Evolutionary Algorithm for Mining Alpha Factors in Quantitative Investment
- Learning from Expert Factors: Trajectory-level Reward Shaping for Formulaic Alpha Mining
Related papers
- AFNO: Universal Certifiably-Arbitrage-Free Operator Learning Framework for European Call-Price Surfaces
- Diffusion models for dynamic volatility surface generation and data-driven hedging
- Rethinking Synthetic Scenario Realism: Compatibility, Not Fidelity, Drives Hedging Performance
- Diversification Across Predictors: Heterogeneous Ensemble Learning for Cross-Sectional Return Prediction
- DSINC beyond Heston: the 3/2 and other non-affine stochastic-volatility models
- Generative AI, Managerial Expectations, and Economic Activity