Paper: arXiv 2509.01590

Authors: Bingyang Wang, Grant Johnson, Maria Hybinette, Tucker Balch

Abstract

This paper investigates whether artificial intelligence can enhance stock clustering compared to traditional methods. We consider this in the context of the semi-strong Efficient Markets Hypothesis (EMH), which posits that prices fully reflect all public information and, accordingly, that clusters based on price information cannot be improved upon. We benchmark three clustering approaches: (i) price-based clusters derived from historical return correlations, (ii) human-informed clusters defined by the Global Industry Classification Standard (GICS), and (iii) AI-driven clusters constructed from large language model (LLM) embeddings of stock-related news headlines. At each date, each method provides a classification in which each stock is assigned to a cluster. To evaluate a clustering, we transform it into a synthetic factor model following the Arbitrage Pricing Theory (APT) framework. This enables consistent evaluation of predictive performance in a roll forward, out-of-sample test. Using S&P 500 constituents from from 2022 through 2024, we find that price-based clustering consistently outperforms both rule-based and AI-based methods, reducing root mean squared error (RMSE) by 15.9% relative to GICS and 14.7% relative to LLM embeddings. Our contributions are threefold: (i) a generalizable methodology that converts any equity grouping: manual, machine, or market-driven, into a real-time factor model for evaluation; (ii) the first direct comparison of price-based, human rule-based, and AI-based clustering under identical conditions; and (iii) empirical evidence reinforcing that short-horizon return information is largely contained in prices. These results support the EMH while offering practitioners a practical diagnostic for monitoring evolving sector structures and provide academics a framework for testing alternative hypotheses about how quickly markets absorb information.

Complexity vs Empirical Score

  • Math Complexity: 6.5/10
  • Empirical Rigor: 8.0/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper uses advanced financial theory (APT, EMH) and embedding techniques, but the empirical setup is exceptionally rigorous with out-of-sample rolling tests, specific dataset details (S&P 500 2022-2024), and clear error metrics (RMSE).

Research Flowchart

  flowchart TD
  A["Research Question:<br>Can AI improve stock clustering<br>over price-based methods under EMH?"] --> B["Methodology Setup<br>Rolling Out-of-Sample Test"]
  B --> C{"Inputs"}
  C --> C1["S&P 500 Constituents<br>2022-2024"]
  C --> C2["Three Clustering Methods<br>1. Price-Based<br>2. GICS (Human Rules)<br>3. LLM Embeddings"]
  C --> C3["APT Factor Model Framework<br>Consistent Evaluation"]
  C1 & C2 & C3 --> D["Computational Process<br>Convert clusters to synthetic factors<br>Calculate RMSE in out-of-sample rolls"]
  D --> E{"Key Findings"}
  E --> E1["Price-Based Clustering<br>Best Performance"]
  E --> E2["15.9% RMSE Reduction<br>vs GICS"]
  E --> E3["14.7% RMSE Reduction<br>vs LLM Embeddings"]
  E --> E4["Conclusion:<br>Short-horizon returns<br>contained in prices (EMH supported)"]

Cited References (134)

  1. Algorithm AS 136: A K-Means Clustering Algorithm (1979)
  2. Language Models are Few-Shot Learners (2020) — link
  3. Mistral 7B (2023) — link
  4. Supervised Learning of Universal Sentence Representations from Natural Language Inference Data (2018) — link
  5. Some methods for classification and analysis of multivariate observations (1967) — link
  6. Clustering by Means of Medoids (1987)
  7. A simple and fast algorithm for K-medoids clustering (2009) — link
  8. Cluster Analysis (2011) — link
and 126 more
  1. Ward’s Hierarchical Agglomerative Clustering Method: Which Algorithms Implement Ward’s Criterion? (2014) — link
  2. Hierarchical clustering schemes (1967) — link
  3. Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms (2021) — link
  4. An empirical comparison of four initialization methods for the K-Means algorithm (1999) — link
  5. Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques (2007) — link
  6. Industry Classifications and Return Comovement (2007) — link
  7. Understanding trend inflation through the lens of the goods and services sectors (2023) — link
  8. Markets,Sectors, and the Trading Cube (2012) — link
  9. The Role of the S&P 500 Index Constituents in Tracking the U.S. Equity Market (2012) — link
  10. Nonlinear Interdependence Between the US and Emerging Markets’ Industrial Stock Sectors (2015) — link
  11. Financial clusters, industry groups, and stock return correlations (2021) — link
  12. What’s My Line? A Comparison of Industry Classification Schemes for Capital Market Research (2003) — link
  13. Understanding Defensive Equity (2014) — link
  14. Clustering in US Stock Prices after Decimalisation (2008) — link
  15. Correlation Matrix Clustering for Statistical Arbitrage Portfolios (2023) — link
  16. Clustering in US Stock Prices after Decimalisation (2008) — link
  17. Scope, Scale, and Concentration: The 21st-Century Firm (2025) — link
  18. Multi-Industry Simplex : A Probabilistic Extension of GICS (2023) — link
  19. Co-trading networks for modeling dynamic interdependency structures and estimating high-dimensional covariances in US equity markets (2024) — link
  20. A Comparison of Economic Agent-Based Model Calibration Methods (2019) — link
  21. Hierarchical structure in financial markets (1999)
  22. Global Industry Classification Standard (GICS\textsuperscript \textregistered ) Methodology (2024) — link
  23. Text-based network industries and endogenous product differentiation (2016)
  24. Efficient capital markets (1970)
  25. A Brief Survey on Anonymization Techniques for Privacy Preserving Publishing of Social Network Data (2008)
  26. Scalable Modeling of Real Graphs Using Kronecker Multiplication (2007)
  27. The Arbitrage Theory of Capital Asset Pricing (1976) — link
  28. Measurement-Calibrated Graph Models for Social Network Experiments (2010)
  29. Reverse stress testing interbank networks (2017)
  30. A survey on graph kernels (2020)
  31. Statistical mechanics of complex networks (2002)
  32. Statistical mechanics of networks (2004)
  33. On Random Graphs I (1959)
  34. JSON (2001) — link
  35. Fraud detection: A systematic literature review of graph-based anomaly detection approaches (2020)
  36. Using social network analysis to prevent money laundering (2017)
  37. Using the RetSim Fraud Simulation Tool to Set Thresholds for Triage of Retail Fraud (2015)
  38. Exploring Agent-Based Methods for the Analysis of Payment Systems: A Crisis Model for StarLogo TNG (2009)
  39. Survey of Approaches to Generate Realistic Synthetic Graphs (2016)
  40. Privacy and Anonymization in Social Networks (2014)
  41. Private Analysis of Graph Data (2014)
  42. Network models of financial systemic risk: A review (2017)
  43. Differentially Private Release of Synthetic Graphs (2020)
  44. Privacy-Preserving Dark Pools (2020)
  45. Informational Inequality: How High Frequency Traders Use Premier Access to Information to Prey on Institutional Investors (2016)
  46. Brokers and Order Flow Leakage: Evidence from Fire Sales (2019)
  47. An agent-based model of payment systems (2011)
  48. Explaining Explanations: An Overview of Interpretability of Machine Learning (2018)
  49. Reflections on Random Kitchen Sinks (2017) — link
  50. Enhancing trading strategies with order book signals (2018)
  51. Limit order books (2013)
  52. The European Union general data protection regulation: what it is and what it means (2019)
  53. Improved Techniques for Training GANs (2016)
  54. ABIDES: Towards High-Fidelity Market Simulation for AI Research (2019) — link
  55. Limit Order Books (2016)
  56. Trades, quotes and prices: financial markets under the microscope (2018)
  57. Evaluating Differentially Private Machine Learning in Practice (2019)
  58. How to Evaluate Trading Strategies: Single Agent Market Replay or Multiple Agent Interactive Simulation? (2019)
  59. Time Series Simulation by Conditional Generative Adversarial Net (2019) — link
  60. Generating Realistic Stock Market Order Streams (2019) — link
  61. Quant GANs: Deep Generation of Financial Time Series (2019) — link
  62. k-anonymity: a model for protecting privacy. International Journal on Uncertainty (2002)
  63. 50 Years of Data Science (2017)
  64. GANs Trained by a Two Time-scale Update Rule Converge to a Local Nash Equilibrium (2017)
  65. Are GANs Created Equal? A Large-scale Study (2018)
  66. A note on the evaluation of generative models (2016) — link
  67. Are adversarial examples inevitable? (2019) — link
  68. Family Educational Rights and Privacy Act (FERPA) (2007)
  69. HIPAA and Protecting Health Information in the 21st Century (2018)
  70. What can we learn from the Facebook—Cambridge Analytica scandal? (2018)
  71. Enterprise data breach: causes, challenges, prevention, and future directions (2017)
  72. Financial market reaction to cyberattacks (2019)
  73. Protecting Privacy when Disclosing Information: $k$-Anonymity and Its Enforcement through Generalization and Suppression (1998)
  74. Calibrating Noise to Sensitivity in Private Data Analysis (2006)
  75. On $K$-anonymity and the Curse of Dimensionality (2005)
  76. Comparative Study of Differentially Private Data Synthesis Methods (2019) — link
  77. Privacy, Anonymity, and Big Data in the Social Sciences (2014)
  78. UCI Machine Learning Repository (2017) — link
  79. Assessing Generative Models via Precision and Recall (2018)
  80. Modeling Tabular data using Conditional GAN (2019) — link
  81. Airline Passenger Name Record Generation using Generative Adversarial Networks (2019) — link
  82. Generating Multi-label Discrete Patient Records using Generative Adversarial Networks (2017)
  83. Value at Risk: The New Benchmark for Managing Financial Risk (2006)
  84. A Review Of Synthetic Data Generation Methods For Privacy Preserving Data Publishing (2015)
  85. Privacy-preserving deep learning (2015)
  86. Differentially Private Mixture of Generative Neural Networks (2019)
  87. Generating Synthetic Data to Match Data Mining Patterns (2008)
  88. PrivBayes: Private Data Release via Bayesian Networks (2014)
  89. DPSynthesizer: Differentially Private Data Synthesizer for Privacy Preserving Data Sharing (2014)
  90. PeGS: Perturbed Gibbs Samplers That Generate Privacy-Compliant Synthetic Data (2014)
  91. Using Support Vector Machines for Generating Synthetic Datasets (2010)
  92. Random Forests for Generating Partially Synthetic, Categorical Data (2010)
  93. Differential Privacy in New Settings (2010)
  94. Differential Privacy Under Continual Observation (2010)
  95. Differentially Private Event Sequences over Infinite Streams (2014)
  96. Broadening the Scope of Differential Privacy Using Metrics (2013)
  97. Optstream: Releasing Time Series Privately (2019)
  98. Analysis of Financial Time Series (2010)
  99. Agent-based Computational Finance (2006)
  100. Who’s Watching? De-anonymization of Netflix Reviews using Amazon Reviews (2018)
  101. A Rigorous and Customizable Framework for Privacy (2012)
  102. The Synthetic Data Vault (2016)
  103. Protecting the 2020 Census (2019)
  104. A Kernel Two-sample Test (2012)
  105. Generating Multi-label Discrete Patient Records using Generative Adversarial Networks (2017)
  106. Data Synthesis based on Generative Adversarial Networks (2018)
  107. Modeling Tabular data using Conditional GAN (2019)
  108. A vector space model for automatic indexing (1975)
  109. PATE-GAN: Generating Synthetic Data with Differential Privacy Guarantees (2019) — link
  110. A Framework for Behavioural Cloning. (1995)
  111. Cluster-driven Hierarchical Representation of Large Asset Universes for Optimal Portfolio Construction (2024) — link
  112. Can Daily Closing Prices Predict Future Movements?\ The Role of Limit Order Clustering (2025) — link
  113. Fads, Martingales, and Market Efficiency (1990) — link
  114. Evidence of Predictable Behavior of Security Returns (1990) — link
  115. Artificial Intelligence for Measurement: Using Transformer-Based Embeddings to Cluster Firms by Economic Similarity (2024) — link
  116. Pairs Trading: Performance of a Relative‐Value Arbitrage Rule (2006) — link
  117. Correlation Matrix Clustering for Statistical Arbitrage Portfolios (2023) — link
  118. A Quantitative Approach to Tactical Asset Allocation (2007) — link
  119. Value and Momentum Everywhere (2013)
  120. The Properties of Equally Weighted Risk Contribution Portfolios (2010) — link
  121. Building Diversified Portfolios that Outperform Out of Sample (2016) — link
  122. Cluster analysis for portfolio optimization (2008)
  123. Portfolio Selection (1952)
  124. Compustat North America Daily Updates (2025)
  125. Wharton Research Data Services (WRDS) (2025)
  126. RavenPack News Analytics (2025)

0 of 134 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2518 linked papers.