DeepTOP: Deep Threshold-Optimal Policy for MDPs and RMABs
Not on the map. Why?
Abstract (arXiv)
We consider the problem of learning the optimal threshold policy for control problems. Threshold policies make control decisions by evaluating whether an element of the system state exceeds a certain threshold, whose value is determined by other elements of the system state. By leveraging the monotone property of threshold policies, we prove that their policy gradients have a surprisingly simple expression. We use this simple expression to build an off-policy actor-critic algorithm for learning the optimal threshold policy. Simulation results show that our policy significantly outperforms other reinforcement learning algorithms due to its ability to exploit the monotone property. In addition, we show that the Whittle index, a powerful tool for restless multi-armed bandit problems, is equivalent to the optimal threshold policy for an alternative problem. This observation leads to a simple algorithm that finds the Whittle index by learning the optimal threshold policy in the alternative problem. Simulation results show that our algorithm learns the Whittle index much faster than several recent studies that learn the Whittle index through indirect means.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 14 of its 41 references that are in the map. First posted on arXiv 18 Sep 2022.
Builds on
14 of 41 references.
References · 14
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2020Whittle index based Q-learning for restless bandits with average rewardcited by 43
- 2021Learn to Intervene: An Adaptive Learning Policy for Restless Bandits in Application to Preventive Healthcarecited by 34
- 2019Recovering Banditscited by 28
- 2021NeurWIN: Neural Whittle Index Network For Restless Bandits Via Deep RLcited by 27
- 2021Q-Learning Lagrange Policies for Multi-Action Restless Banditscited by 20
- 2016Deadline Scheduling as Restless Banditscited by 16
- 2020Deep Q-Network-based Adaptive Alert Threshold Selection Policy for Payment Fraud Systems in Retail Bankingcited by 10
- 2019Online Reinforcement Learning of Optimal Threshold Policies for Markov Decision Processescited by 7
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 2.
6 papers.
- 2023Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximationcited by 14
- 2023Online Restless Multi-Armed Bandits with Long-Term Fairness Constraintscited by 10
- 2025Projection-based Lyapunov method for fully heterogeneous weakly-coupled MDPscited by 2
- 2024Tabular and Deep Reinforcement Learning for Gittins Indexcited by 1
- 2024Deep Index Policy for Multi-Resource Restless Matching Bandit and Its Application in Multi-Channel Schedulingcited by 1
- 2025Online Learning of Whittle Indices for Restless Bandits with Non-Stationary Transition Kernelscited by 1
- 2025Online Learning of Whittle Indices for Restless Bandits with Non-Stationary Transition Kernels22 Jun 2025
- 2025Projection-based Lyapunov method for fully heterogeneous weakly-coupled MDPs9 Feb 2025
- 2024Deep Index Policy for Multi-Resource Restless Matching Bandit and Its Application in Multi-Channel Scheduling13 Aug 2024
- 2024Tabular and Deep Reinforcement Learning for Gittins Index2 May 2024
- 2023Online Restless Multi-Armed Bandits with Long-Term Fairness Constraints16 Dec 2023
- 2023Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximation3 Oct 2023