An impossibility result in automata-theoretic reinforcement learning

DOI10.1007/978-3-031-19992-9_3zbMATH Open1522.68269OpenAlexW4312564465MaRDI QIDQ6103159FDOQ6103159

Authors: Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak 

Publication date: 2 June 2023

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/f7123c75-906c-4ca5-a9b0-3a8f399c467b

Recommendations

• Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives
• Alternating good-for-MDPs automata
• Good-for-MDPs automata for probabilistic analysis and reinforcement learning
• On control of systems modelled as deterministic Rabin automata
• Reward machines: exploiting reward function structure in reinforcement learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites Work

• Title not available (Why is that?)
• Deep learning
• The complexity of probabilistic verification
• Title not available (Why is that?)
• Reinforcement learning. An introduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Decision problems forω-automata
• A Survey of Stochastic Games with Limsup and Liminf Objectives
• Optimal infinite scheduling for multi-priced timed automata
• Title not available (Why is that?)
• Omega-Regular Objectives in Model-Free Reinforcement Learning
• Good-for-MDPs automata for probabilistic analysis and reinforcement learning
• Model-Free Reinforcement Learning for Stochastic Parity Games

Cited In (1)

• Putnam's diagonal argument and the impossibility of a universal learning machine

This page was built for publication: An impossibility result in automata-theoretic reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103159)