English
Related papers

Related papers: Finite Automata Extraction: Low-data World Model L…

200 papers

We present evidence that language models (LMs) of code can learn to represent the formal semantics of programs, despite being trained only to perform next-token prediction. Specifically, we train a Transformer model on a synthetic corpus of…

Machine Learning · Computer Science 2024-08-06 Charles Jin , Martin Rinard

We propose a method to construct finite-state reactive controllers for systems whose interactions with their adversarial environment are modeled by infinite-duration two-player games over (possibly) infinite graphs. The proposed method…

Formal Languages and Automata Theory · Computer Science 2016-01-08 Daniel Neider , Ufuk Topcu

A generative recurrent neural network is quickly trained in an unsupervised manner to model popular reinforcement learning environments through compressed spatio-temporal representations. The world model's extracted features are fed into…

Machine Learning · Computer Science 2018-09-07 David Ha , Jürgen Schmidhuber

Much of model-based reinforcement learning involves learning a model of an agent's world, and training an agent to leverage this model to perform a task more efficiently. While these models are demonstrably useful for agents, every…

Neural and Evolutionary Computing · Computer Science 2019-11-01 C. Daniel Freeman , Luke Metz , David Ha

An autoencoder (AE) is a neural network that, using self-supervised training, learns a succinct parameterized representation, and a corresponding encoding and decoding process, for all instances in a given class. Here, we introduce the…

Machine Learning · Computer Science 2025-07-15 Assaf Marron , Smadar Szekely , Irun Cohen , David Harel

Behavioural models are a valuable tool for software verification, testing, monitoring, publishing etc. However, they are rarely provided by the software developers and have to be extracted either from the source or from the compiled code.…

Software Engineering · Computer Science 2023-11-09 Larisa Safina , Simon Bliudze

This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FDCA). Inspired by the CA-based models of biological and…

Computational Complexity · Computer Science 2007-05-23 Maxim Makatchev

State-of-the-art Vision-Language-Action (VLA) models excel at semantic generalization but struggle to generalize to unseen physical motions in novel environments. We introduce DreamZero, a World Action Model (WAM) built upon a pretrained…

Representation learning seeks to expose certain aspects of observed data in a learned representation that's amenable to downstream tasks like classification. For instance, a good representation for 2D images might be one that describes only…

Machine Learning · Computer Science 2017-03-07 Xi Chen , Diederik P. Kingma , Tim Salimans , Yan Duan , Prafulla Dhariwal , John Schulman , Ilya Sutskever , Pieter Abbeel

We explore building generative neural network models of popular reinforcement learning environments. Our world model can be trained quickly in an unsupervised manner to learn a compressed spatial and temporal representation of the…

Machine Learning · Computer Science 2018-05-10 David Ha , Jürgen Schmidhuber

We present an algorithm for extraction of a probabilistic deterministic finite automaton (PDFA) from a given black-box language model, such as a recurrent neural network (RNN). The algorithm is a variant of the exact-learning algorithm L*,…

Machine Learning · Computer Science 2020-01-01 Gail Weiss , Yoav Goldberg , Eran Yahav

The utility of learning a dynamics/world model of the environment in reinforcement learning has been shown in a many ways. When using neural networks, however, these models suffer catastrophic forgetting when learned in a lifelong or…

Machine Learning · Computer Science 2019-06-12 Nicholas Ketz , Soheil Kolouri , Praveen Pilly

The identification of a deterministic finite automaton (DFA) from labeled examples is a well-studied problem in the literature; however, prior work focuses on the identification of monolithic DFAs. Although monolithic DFAs provide accurate…

Formal Languages and Automata Theory · Computer Science 2022-05-27 Niklas Lauffer , Beyazit Yalcinkaya , Marcell Vazquez-Chanlatte , Ameesh Shah , Sanjit A. Seshia

Text-based games provide an interactive way to study natural language processing. While deep reinforcement learning has shown effectiveness in developing the game playing agent, the low sample efficiency and the large action space remain to…

Computation and Language · Computer Science 2022-04-22 Yunqiu Xu , Meng Fang , Ling Chen , Yali Du , Joey Tianyi Zhou , Chengqi Zhang

Neural architectures inspired by our own human cognitive system, such as the recently introduced world models, have been shown to outperform traditional deep reinforcement learning (RL) methods in a variety of different domains. Instead of…

Neural and Evolutionary Computing · Computer Science 2019-06-24 Sebastian Risi , Kenneth O. Stanley

Finite automata (FA) are a fundamental computational abstraction that is widely used in practice for various tasks in computer science, linguistics, biology, electrical engineering, and artificial intelligence. Given an input word, an FA…

Artificial Intelligence · Computer Science 2026-04-22 Jaime Cuartas Granada , Alexey Ignatiev , Peter J. Stuckey

In this work, we introduce DeepDFA, a novel approach to identifying Deterministic Finite Automata (DFAs) from traces, harnessing a differentiable yet discrete model. Inspired by both the probabilistic relaxation of DFAs and Recurrent Neural…

Machine Learning · Computer Science 2024-08-19 Elena Umili , Roberto Capobianco

Learned world models summarize an agent's experience to facilitate learning complex behaviors. While learning world models from high-dimensional sensory inputs is becoming feasible through deep learning, there are many potential ways for…

Machine Learning · Computer Science 2020-03-18 Danijar Hafner , Timothy Lillicrap , Jimmy Ba , Mohammad Norouzi

In this paper, we present a novel approach to incrementally learn an Abstract Model of an unknown environment, and show how an agent can reuse the learned model for tackling the Object Goal Navigation task. The Abstract Model is a finite…

Computer Vision and Pattern Recognition · Computer Science 2022-03-08 Tommaso Campari , Leonardo Lamanna , Paolo Traverso , Luciano Serafini , Lamberto Ballan

Specifying tasks for robotic systems traditionally requires coding expertise, deep domain knowledge, and significant time investment. While learning from demonstration offers a promising alternative, existing methods often struggle with…

Robotics · Computer Science 2024-09-12 Mattijs Baert , Sam Leroux , Pieter Simoens