Timing is Everything: Learning to Act Selectively with Costly Actions and Budgetary Constraints
Not on the map. Why?
Abstract (arXiv)
Many real-world settings involve costs for performing actions; transaction costs in financial systems and fuel costs being common examples. In these settings, performing actions at each time step quickly accumulates costs leading to vastly suboptimal outcomes. Additionally, repeatedly acting produces wear and tear and ultimately, damage. Determining textitwhen to act is crucial for achieving successful outcomes and yet, the challenge of efficiently textitlearning to behave optimally when actions incur minimally bounded costs remains unresolved. In this paper, we introduce a reinforcement learning (RL) framework named Learnable Impulse Control Reinforcement Algorithm (LICRA), for learning to optimally select both when to act and which actions to take when actions incur costs. At the core of LICRA is a nested structure that combines RL and a form of policy known as textitimpulse control which learns to maximise objectives when actions incur costs. We prove that LICRA, which seamlessly adopts any RL method, converges to policies that optimally select when to perform actions and their optimal magnitudes. We then augment LICRA to handle problems in which the agent can perform at most k<∞ actions and more generally, faces a budget constraint. We show LICRA learns the optimal value function and ensures budget constraints are satisfied almost surely. We demonstrate empirically LICRA's superior performance against benchmark RL methods in OpenAI gym's textitLunar Lander and in textitHighway environments and a variant of the Merton portfolio problem within finance.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 41 references that are in the map. First posted on arXiv 31 May 2022.
Builds on
12 of 41 references.
References · 12
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,240
- 2022Saute RL: Almost Surely Safe Reinforcement Learning Using State Augmentationcited by 69
- 2019Discovering Options for Exploration by Minimizing Cover Timecited by 31
- 2021Flexible Option Learningcited by 25
- 2018Deep Reinforcement Learningcited by 14
- 2021Deep Reinforcement Learning for Optimal Stopping with Application in Financial Engineeringcited by 6
- 2018A Viscosity Approach to Stochastic Differential Games of Control and Stopping Involving Impulsive Controlcited by 5
- 2019Cutting Your Losses: Learning Fault-Tolerant Control and Optimal Stopping under Adverse Riskcited by 5
- 2018Optimal Selection of Transaction Costs in a Dynamic Principal-Agent Problemcited by 3
- 2018Optimal Capital Injections with the Risk of Ruin: A Stochastic Differential Game of Impulse Control and Stopping Approachcited by 1
- 2018Duopoly Investment Problems with Minimally Bounded Adjustment Costscited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.
- 2024All Language Models Large and Smallcited by 1
- 2025Learning Multi-Timescale Interventions under Safety and Resource Constraintscited by 0
- 2025Learning Multi-Timescale Interventions under Safety and Resource Constraints5 Aug 2025
- 2024All Language Models Large and Small19 Feb 2024