mlsanityData to 14 Oct 2026

Learning Environment Models with Continuous Stochastic Dynamics

arXiv 2306.17204 ↗First posted 29 Jun 2023cs.LG cs.FLcited by 0

Not on the map. Why?

Abstract (arXiv)

Solving control tasks in complex environments automatically through learning offers great potential. While contemporary techniques from deep reinforcement learning (DRL) provide effective solutions, their decision-making is not transparent. We aim to provide insights into the decisions faced by the agent by learning an automaton model of environmental behavior under the control of an agent. However, for most control problems, automata learning is not scalable enough to learn a useful model. In this work, we raise the capabilities of automata learning such that it is possible to learn models for environments that have complex and continuous dynamics. The core of the scalability of our method lies in the computation of an abstract state-space representation, by applying dimensionality reduction and clustering on the observed environmental state space. The stochastic transitions are learned via passive automata learning from observed interactions of the agent and the environment. In an iterative model-based RL process, we sample additional trajectories to learn an accurate environment model in the form of a discrete-state Markov decision process (MDP). We apply our automata learning framework on popular RL benchmarking environments in the OpenAI Gym, including LunarLander, CartPole, Mountain Car, and Acrobot. Our results show that the learned models are so precise that they enable the computation of policies solving the respective control tasks. Yet the models are more concise and more general than neural-network-based policies and by using MDPs we benefit from a wealth of tools available for analyzing them. When solving the task of LunarLander, the learned model even achieved similar or higher rewards than deep RL policies learned with stable-baselines3.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 41 references that are in the map. First posted on arXiv 29 Jun 2023.

Builds on

11 of 41 references.

References · 11

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2016OpenAI Gymcited by 1,736
  3. 2017Safe Reinforcement Learning via Shieldingcited by 449
  4. 2017A Laplacian Framework for Option Discovery in Reinforcement Learningcited by 110
  5. 2019Joint Inference of Reward Machines and Policies for Reinforcement Learningcited by 56
  6. 2019Reinforcement Learning with Non-Markovian Rewardscited by 45
  7. 2020Active Finite Reward Automaton Inference and Reinforcement Learning Using Queries and Counterexamplescited by 23
  8. 2019Induction of Subgoal Automata for Reinforcement Learningcited by 17
  9. 2021Inferring Probabilistic Reward Machines from Non-Markovian Reward Processes for Reinforcement Learningcited by 13
  10. 2019Model-Based Testing IoT Communication via Active Automata Learningcited by 4
  11. 2019Learning a Behavior Model of Hybrid Systems Through Combining Model-Based Testing and Machine Learning (Full Version)cited by 1

Built on by

Not cited yet.