mlsanityData to 14 Oct 2026

Trading Strategy Optimization via Textual Gradient

arXiv 2610.03128 ↗First posted 2 Oct 2026cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Quantitative trading strategy design aims to discover trading programs from historical data that remain effective in future markets, which can be viewed as a black-box program optimization problem. LLM-based textual gradients offer a promising approach by providing explicit optimization directions for iterative strategy refinement. However, directly applying textual gradients faces two challenges: (1) optimization is myopic, underutilizing experience from previous evaluations; and (2) aggregate backtest feedback overlooks temporal robustness, potentially favoring strategies that perform well only in specific market periods. To address these challenges, we propose TradeGrad, an experience-guided textual-gradient framework for robust trading strategy optimization. TradeGrad leverages accumulated optimization experience to estimate textual gradients and employs multi-scale revisions for both strategy exploration and refinement. It further introduces the Cross-Period Robust Objective (CPRO), which emphasizes performance in unfavorable historical periods to promote temporal robustness. Experiments on cross-sectional and time-series strategy design in Chinese A-share and U.S. equity markets show that TradeGrad achieves the best in-sample and out-of-sample performance across all four settings. Notably, its Chinese cross-sectional strategy achieves 27.99% annualized return, 12.19% maximum drawdown, and a Sharpe ratio of 1.63, approximately 68% higher than the CSI 300 benchmark. Further analyses validate the proposed components and show consistent improvements in both in-sample and out-of-sample performance throughout optimization. The code is available at https://github.com/transcend-0/TradeGrad.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 38 references that are in the map. First posted on arXiv 2 Oct 2026.

Builds on

14 of 38 references.

References · 14

  1. 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 867
  2. 2023Large Language Models as Optimizerscited by 864
  3. 2023Automatic Prompt Optimization with "Gradient Descent" and Beam Searchcited by 653
  4. 2023Eureka: Human-Level Reward Design via Coding Large Language Modelscited by 571
  5. 2025GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learningcited by 542
  6. 2024ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolutioncited by 276
  7. 2024Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Modelcited by 268
  8. 2025ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolutioncited by 174
  9. 2024LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristicscited by 97
  10. 2024Unleashing the Potential of Large Language Models as Prompt Optimizers: Analogical Analysis with Gradient-based Model Optimizerscited by 35
  11. 2025DLPO: Towards a Robust, Efficient, and Generalizable Prompt Optimization Framework from a Deep-Learning Perspectivecited by 8
  12. 2022Quant 4.0: Engineering Quantitative Investment with Automated, Explainable and Knowledge-driven Artificial Intelligencecited by 6
2 more
  1. 2025Scaling Textual Gradients via Sampling-Based Momentumcited by 6
  2. 2025QuantEvolve: Automating Quantitative Strategy Discovery through Multi-Agent Evolutionary Frameworkcited by 6

Built on by

Not cited yet.