mlsanityData to 7 Oct 2026

Learn Continuously, Act Discretely: Hybrid Action-Space Reinforcement Learning For Optimal Execution

arXiv 2207.11152 ↗First posted 22 Jul 2022q-fin.TR cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Optimal execution is a sequential decision-making problem for cost-saving in algorithmic trading. Studies have found that reinforcement learning (RL) can help decide the order-splitting sizes. However, a problem remains unsolved: how to place limit orders at appropriate limit prices? The key challenge lies in the "continuous-discrete duality" of the action space. On the one hand, the continuous action space using percentage changes in prices is preferred for generalization. On the other hand, the trader eventually needs to choose limit prices discretely due to the existence of the tick size, which requires specialization for every single stock with different characteristics (e.g., the liquidity and the price range). So we need continuous control for generalization and discrete control for specialization. To this end, we propose a hybrid RL method to combine the advantages of both of them. We first use a continuous control agent to scope an action subset, then deploy a fine-grained agent to choose a specific limit price. Extensive experiments show that our method has higher sample efficiency and better training stability than existing RL algorithms and significantly outperforms previous learning-based methods for order execution.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 6 of its 23 references that are in the map. First posted on arXiv 22 Jul 2022.

Builds on

6 of 23 references.

References · 6

  1. 2017Attention Is All You Needcited by 59,932
  2. 2017Proximal Policy Optimization Algorithmscited by 14,441
  3. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  4. 2018Double Deep Q-Learning for Optimal Executioncited by 39
  5. 2021Universal Trading for Order Execution with Oracle Policy Distillationcited by 29
  6. 2018Policy Optimization with Model-based Explorationscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 2.

4 papers.