Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.00030 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915366143262720 |
|---|---|
| author | Verma, Abhishek V, Nallarasan Ravindran, Balaraman |
| author_facet | Verma, Abhishek V, Nallarasan Ravindran, Balaraman |
| contents | Deep Reinforcement Learning (DRL) has achieved remarkable success in complex sequential decision-making tasks, such as playing Atari 2600 games and mastering board games. A critical yet underexplored aspect of DRL is the temporal scale of action execution. We propose a novel paradigm that integrates contextual bandits with DRL to adaptively select action durations, enhancing policy flexibility and computational efficiency. Our approach augments a Deep Q-Network (DQN) with a contextual bandit module that learns to choose optimal action repetition rates based on state contexts. Experiments on Atari 2600 games demonstrate significant performance improvements over static duration baselines, highlighting the efficacy of adaptive temporal abstractions in DRL. This paradigm offers a scalable solution for real-time applications like gaming and robotics, where dynamic action durations are critical. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_00030 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments Verma, Abhishek V, Nallarasan Ravindran, Balaraman Machine Learning Artificial Intelligence Deep Reinforcement Learning (DRL) has achieved remarkable success in complex sequential decision-making tasks, such as playing Atari 2600 games and mastering board games. A critical yet underexplored aspect of DRL is the temporal scale of action execution. We propose a novel paradigm that integrates contextual bandits with DRL to adaptively select action durations, enhancing policy flexibility and computational efficiency. Our approach augments a Deep Q-Network (DQN) with a contextual bandit module that learns to choose optimal action repetition rates based on state contexts. Experiments on Atari 2600 games demonstrate significant performance improvements over static duration baselines, highlighting the efficacy of adaptive temporal abstractions in DRL. This paradigm offers a scalable solution for real-time applications like gaming and robotics, where dynamic action durations are critical. |
| title | Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2507.00030 |