A New DAPO Algorithm for Stock Trading
Authors: Ruijian Zha, Bojun Liu
AI-generated Key Points
- Ruijian Zha and Bojun Liu from Columbia University explore reinforcement learning techniques in financial trading
- Focus on Dynamic Sampling Policy Optimization (DAPO) algorithm combined with Large Language Models (LLMs)
- Introduce a novel trading agent integrating Group Relative Policy Optimization (GRPO) with insights from DAPO
- Agent incorporates LLM-based signals related to risk and sentiment from financial news sources
- Performance evaluated on NASDAQ-100 index using FNSPID dataset
- Improved DAPO algorithm achieves cumulative return of 230.49% and Information Ratio of 0.37, outperforming CPPO-DeepSeek baseline
- Training time reduced from 8 hours to 2.5 hours over 100 epochs, along with decreased RAM usage
- Research demonstrates potential for data-efficient trading agents by combining reinforcement learning algorithms like DAPO with LLM-based signals from financial news sources
Abstract: Recent advances in reinforcement learning, such as Dynamic Sampling Policy Optimization (DAPO), show strong performance when paired with large language models (LLMs). Motivated by this success, we ask whether similar gains can be realized in financial trading. We design a trading agent that combines an improved Group Relative Policy Optimization (GRPO) algorithm, augmented with ideas from DAPO, with LLM-based risk and sentiment signals extracted from financial news. On the NASDAQ-100 index (FNSPID dataset), our agent attains a cumulative return of 230.49 percent and an information ratio of 0.37, outperforming the CPPO-DeepSeek baseline. It also cuts training time from about 8 hours to 2.5 hours over 100 epochs while markedly reducing RAM usage. The proposed RL-LLM framework offers a scalable path toward data-efficient trading agents. Code: https://github.com/Ruijian-Zha/FinRL-DAPO-SR/
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.