Time-Aware Q-Networks: Resolving Temporal Irregularity for Deep Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Deep Reinforcement Learning (DRL) has shown outstanding performance on inducing effective action policies that maximize expected long-term return on many complex tasks. Much of DRL work has been focused on sequences of events with discrete time steps and ignores the irregular time intervals between consecutive events. Given that in many real-world domains, data often consists of temporal sequences with irregular time intervals, and it is important to consider the time intervals between temporal events to capture latent progressive patterns of states. In this work, we present a general Time-Aware RL framework: Time-aware Q-Networks (TQN), which takes into account physical time intervals within a deep RL framework. TQN deals with time irregularity from two aspects: 1) elapsed time in the past and an expected next observation time for time-aware state approximation, and 2) action time window for the future for time-aware discounting of rewards. Experimental results show that by capturing the underlying structures in the sequences with time irregularities from both aspects, TQNs significantly outperform DQN in four types of contexts with irregular time intervals. More specifically, our results show that in classic RL tasks such as CartPole and MountainCar and Atari benchmark with randomly segmented time intervals, time-aware discounting alone is more important while in the real-world tasks such as nuclear reactor operation and septic patient treatment with intrinsic time intervals, both time-aware state and time-aware discounting are crucial. Moreover, to improve the agent's learning capacity, we explored three boosting methods: Double networks, Dueling networks, and Prioritized Experience Replay, and our results show that for the two real-world tasks, combining all three boosting methods with TQN is especially effective.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 61 references that are in the map. First posted on arXiv 6 May 2021.
Builds on
22 of 61 references.
References · 22
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,227
- 2015Prioritized Experience Replaycited by 1,070
- 2018Exploration by Random Network Distillationcited by 966
- 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 833
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
- 2016Recurrent Neural Networks for Multivariate Time Series with Missing Valuescited by 548
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
- 2019Go-Explore: a New Approach for Hard-Exploration Problemscited by 207
- 2016The Predictron: End-To-End Learning and Planningcited by 92
10 more
- 2019Interpolation-Prediction Networks for Irregularly Sampled Time Seriescited by 89
- 2017Deep Reinforcement Learning for Sepsis Treatmentcited by 71
- 2019Hyperbolic Discounting and Learning over Multiple Horizonscited by 58
- 2017Hybrid Reward Architecture for Reinforcement Learningcited by 57
- 2019Making Deep Q-learning methods robust to time discretizationcited by 51
- 2016Unifying task specification in reinforcement learningcited by 41
- 2016DeepCare: A Deep Dynamic Memory Model for Predictive Medicinecited by 32
- 2019Rethinking the Discount Factor in Reinforcement Learning: A Decision Theoretic Approachcited by 32
- 2020Model-based Reinforcement Learning for Semi-Markov Decision Processes with Neural ODEscited by 32
- 2018Towards a Deep Unified Framework for Nuclear Reactor Perturbation Analysiscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Temporal Self-Imitation Learningcited by 0
- 2026Temporal Self-Imitation Learning18 Jun 2026