Learning Uncertainty-Aware Temporally-Extended Actions
Joongkyu Lee, Seung Joon Park, Yunhao Tang, Min-hwan Oh
Abstract
In reinforcement learning, temporal abstraction in the action space, exemplified by action repetition, is a technique to facilitate policy learning through extended actions. However, a primary limitation in previous studies of action repetition is its potential to degrade performance, particularly when sub-optimal actions are repeated. This issue often negates the advantages of action repetition. To address this, we propose a novel algorithm named Uncertainty-aware Temporal Extension (UTE). UTE employs ensemble methods to accurately measure uncertainty during action extension. This feature allows policies to strategically choose between emphasizing exploration or adopting an uncertainty-averse approach, tailored to their specific needs. We demonstrate the effectiveness of UTE through experiments in Gridworld and Atari 2600 environments. Our findings show that UTE outperforms existing action repetition algorithms, effectively mitigating their inherent limitations and significantly enhancing policy learning efficiency.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext eace2092-9731-4554-9ae2-8b536209dfbdCited by top-tier papers2
- Select before Act: Spatially Decoupled Action Repetition for Continuous ControlBuqing Nie, Yangqing Fu, Yue GaoICLR 2025
- The Cost of Commitment in Option-Based Hierarchical RLRandy Lefebvre, Audrey DurandICML 2026
Builds on8
- Uncertainty-Aware Action Advising for Deep Reinforcement Learning AgentsFelipe Leno da Silva, Pablo Hernandez-Leal, Bilal Kartal, Matthew E. TaylorAAAI 2020 · 84 citations
- Tactical Optimism and Pessimism for Deep Reinforcement LearningTed Moskovitz, Jack Parker-Holder, Aldo Pacchiano, Michael Arbel et al.NeurIPS 2021 · 75 citations
- Ensemble Bootstrapping for Q-LearningOren Peer, Chen Tessler, Nadav Merlis, Ron MeirICML 2021 · 56 citations
- Principled Exploration via Optimistic Bootstrapping and Backward InductionChenjia Bai, Lingxiao Wang, Lei Han, Jianye Hao et al.ICML 2021 · 46 citations
- Control Frequency Adaptation via Action Persistence in Batch Reinforcement LearningAlberto Maria Metelli, Flavio Mazzolini, Lorenzo Bisi, Luca Sabbioni et al.ICML 2020 · 43 citations
Related papers
- TAAC: Temporally Abstract Actor-Critic for Continuous ControlHaonan Yu, Wei Xu, Haichao ZhangNeurIPS 2021 · 30 citations
- Flexible Option LearningMartin Klissarov, Doina PrecupNeurIPS 2021 · 38 citations
- When Do Skills Help Reinforcement Learning? A Theoretical Analysis of Temporal AbstractionsZhening Li, Gabriel Poesia, Armando Solar-LezamaICML 2024 · 1 citation
- Beyond-Expert Performance with Limited Demonstrations: Efficient Imitation Learning with Double ExplorationHeyang Zhao, Xingrui Yu, David Mark Bossens, Ivor W. Tsang et al.ICLR 2025
- Temporally-Extended ε-Greedy ExplorationWill Dabney, Georg Ostrovski, André BarretoICLR 2021 · 2 citations
