When to Sense and Control? A Time-adaptive Approach for Continuous-Time RL
Lenart Treven, Bhavya Sukhija, Yarden As, Florian Dörfler, Andreas Krause
Abstract
Reinforcement learning (RL) excels in optimizing policies for discrete-time Markov decision processes (MDP). However, various systems are inherently continuous in time, making discrete-time MDPs an inexact modeling choice. In many applications, such as greenhouse control or medical treatments, each interaction (measurement or switching of action) involves manual intervention and thus is inherently costly. Therefore, we generally prefer a time-adaptive approach with fewer interactions with the system. In this work, we formalize an RL framework, Time-adaptive Control&Sensing (TaCoS), that tackles this challenge by optimizing over policies that besides control predict the duration of its application. Our formulation results in an extended MDP that any standard RL algorithm can solve. We demonstrate that state-of-the-art RL algorithms trained on TaCoS drastically reduce the interaction amount over their discrete-time counterpart while retaining the same or improved performance, and exhibiting robustness over discretization frequency. Finally, we propose OTaCoS, an efficient model-based algorithm for our setting. We show that OTaCoS enjoys sublinear regret for systems with sufficiently smooth dynamics and empirically results in further sample-efficiency gains.
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 649f1e61-59c2-431d-9ee7-caf1be6af229Cited by top-tier papers3
- Sample-efficient and Scalable Exploration in Continuous-Time RLKlemens Iten, Lenart Treven, Bhavya Sukhija, Florian Dörfler et al.ICLR 2026 · 3 citations
- Instance-Dependent Continuous-Time Reinforcement Learning via Maximum Likelihood EstimationRunze Zhao, Yue Yu, Ruhan Wang, Chunfeng Huang et al.ICML 2026 · 1 citation
- The Value of Sensory Information to a RobotArjun Krishna, Edward S. Hu, Dinesh JayaramanICLR 2025
Builds on16
- Dream to Control: Learning Behaviors by Latent ImaginationDanijar Hafner, Timothy P. Lillicrap, Jimmy Ba, Mohammad NorouziICLR 2020 · 1,852 citations
- Information Theoretic Regret Bounds for Online Nonlinear ControlSham M. Kakade, Akshay Krishnamurthy, Kendall Lowrey, Motoya Ohnishi et al.NeurIPS 2020 · 137 citations
- Efficient Model-Based Reinforcement Learning through Optimistic Policy Search and PlanningSebastian Curi, Felix Berkenkamp, Andreas KrauseNeurIPS 2020 · 120 citations
- Continuous-time Model-based Reinforcement LearningÇagatay Yildiz, Markus Heinonen, Harri LähdesmäkiICML 2021 · 72 citations
- Optimistic Active Exploration of Dynamical SystemsBhavya Sukhija, Lenart Treven, Cansu Sancaktar, Sebastian Blaes et al.NeurIPS 2023 · 42 citations
Related papers
- Efficient Exploration in Continuous-time Model-based Reinforcement LearningLenart Treven, Jonas Hübotter, Bhavya Sukhija, Florian Dörfler et al.NeurIPS 2023 · 24 citations
- Model-based Reinforcement Learning for Semi-Markov Decision Processes with Neural ODEsJianzhun Du, Joseph Futoma, Finale Doshi-VelezNeurIPS 2020 · 63 citations
- Managing Temporal Resolution in Continuous Value Estimation: A Fundamental Trade-offZichen Vincent Zhang, Johannes Kirschner, Junxi Zhang, Francesco Zanini et al.NeurIPS 2023 · 3 citations
- Logarithmic Regret Bound in Partially Observable Linear Dynamical SystemsSahin Lale, Kamyar Azizzadenesheli, Babak Hassibi, Anima AnandkumarNeurIPS 2020 · 106 citations
- Improving planning and MBRL with temporally-extended actionsPalash Chatterjee, Roni KhardonNeurIPS 2025
