A hybrid learning agent for episodic learning tasks with unknown target distance

被引:0
|
作者
Oliver Sefrin [1 ]
Sabine Wölk [1 ]
机构
[1] German Aerospace Center (DLR),Institute of Quantum Technologies
[2] Ulm University,Institute for Complex Quantum Systems
关键词
Quantum reinforcement learning; Amplitude amplification; Hybrid algorithm; Navigation problem;
D O I
10.1007/s42484-025-00269-1
中图分类号
学科分类号
摘要
The “hybrid agent for quantum-accessible reinforcement learning,” as defined in (Hamann and Wölk New J Phys 24:033044 2022), provides a proven quasi-quadratic speedup and is experimentally tested. However, the standard version can only be applied to episodic learning tasks with fixed episode length. In many real-world applications, the information about the necessary number of steps within an episode to reach a defined target is not available in advance and especially before reaching the target for the first time. Furthermore, in such scenarios, classical agents have the advantage of observing at which step they reach the target. How to best deal with an unknown target distance in classical and quantum reinforcement learning and whether the hybrid agent can provide an advantage in such learning scenarios is unknown so far. In this work, we introduce a hybrid agent with a stochastic episode length selection strategy to alleviate the need for knowledge about the necessary episode length. Through simulations, we test the adapted hybrid agent’s performance versus classical counterparts with and without similar episode selection strategies. Our simulations demonstrate a speedup in certain scenarios due to our developed episode length selection strategy for classical learning agents as well as an additional speedup for our resulting hybrid learning agent.
引用
收藏
相关论文
共 50 条
  • [1] CMC Modes for Learning Tasks at a Distance
    Paulus, Trena M.
    JOURNAL OF COMPUTER-MEDIATED COMMUNICATION, 2007, 12 (04): : 1322 - 1345
  • [2] Maximizing the average reward in episodic reinforcement learning tasks
    Reinke, Chris
    Uchibe, Eiji
    Doya, Kenji
    2015 INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATICS AND BIOMEDICAL SCIENCES (ICIIBMS), 2015, : 420 - 421
  • [3] The information complexity of learning tasks, their structure and their distance
    Achille, Alessandro
    Paolini, Giovanni
    Mbeng, Glen
    Soatto, Stefano
    INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2021, 10 (01) : 51 - 72
  • [4] Quantum machine learning with glow for episodic tasks and decision games
    Clausen, Jens
    Briegel, Hans J.
    PHYSICAL REVIEW A, 2018, 97 (02)
  • [5] Efficient learning algorithms for episodic tasks with acyclic state spaces
    Reveliotis, Spyros
    Bountourelis, Theologos
    2006 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1 AND 2, 2006, : 411 - +
  • [6] Customized Learning Algorithms for Episodic Tasks with Acyclic State Spaces
    Bountourelis, Theologos
    Reveliotis, Spyros
    2009 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, 2009, : 627 - 634
  • [7] Efficient PAC Learning for Episodic Tasks with Acyclic State Spaces
    Spyros Reveliotis
    Theologos Bountourelis
    Discrete Event Dynamic Systems, 2007, 17 : 307 - 327
  • [8] Efficient PAC learning for episodic tasks with acyclic state spaces
    Reveliotis, Spyros
    Bountourelis, Theologos
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2007, 17 (03): : 307 - 327
  • [9] Learning and Planning for Temporally Extended Tasks in Unknown Environments
    Bradley, Christopher
    Pacheck, Adam
    Stein, Gregory J.
    Castro, Sebastian
    Kress-Gazit, Hadas
    Roy, Nicholas
    2021 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2021), 2021, : 4830 - 4836
  • [10] A Cognitive Tutoring Agent with Episodic and Causal Learning Capabilities
    Faghihi, Usef
    Fournier-Viger, Philippe
    Nkambou, Roger
    ARTIFICIAL INTELLIGENCE IN EDUCATION, 2011, 6738 : 72 - 80