Cover Image

Compositional Automata Embeddings for Goal-Conditioned Reinforcement Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yalcinkaya, Beyazit, Lauffer, Niklas, Vazquez-Chanlatte, Marcell, Seshia, Sanjit A.
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence Computation and Language Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Provably Correct Automata Embeddings for Optimal Automata-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2025)

Automata-Conditioned Cooperative Multi-Agent Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2025)

$L^*LM$: Learning Automata from Examples using Natural Language Oracles
by: Vazquez-Chanlatte, Marcell, et al.
Published: (2024)

Learning Formal Specifications from Membership and Preference Queries
by: Shah, Ameesh, et al.
Published: (2023)

Automata Extraction from Transformers
by: Zhang, Yihao, et al.
Published: (2024)

Extracting Robust Register Automata from Neural Networks over Data Sequences
by: Hong, Chih-Duo, et al.
Published: (2025)

A Detailed Account of Compositional Automata Learning through Alphabet Refinement
by: Henry, Leo, et al.
Published: (2025)

Inference of Deterministic Finite Automata via Q-Learning
by: Hosseinkhani, Elaheh, et al.
Published: (2025)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
by: Carrasco, Matías, et al.
Published: (2024)

SMT-Based Active Learning of Weighted Automata
by: Ferreira, Tiago, et al.
Published: (2026)

Partial Answer of How Transformers Learn Automata
by: Zhang, Tiantian
Published: (2025)

Active Learning of Symbolic Automata Over Rational Numbers
by: Hagedorn, Sebastian, et al.
Published: (2025)

Warm Starting State-Space Models with Automata Learning
by: Fishell, William, et al.
Published: (2026)

Automata Learning of Preferences over Temporal Logic Formulas from Pairwise Comparisons
by: Rahmani, Hazhar, et al.
Published: (2025)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
by: Okudono, Takamasa, et al.
Published: (2024)

Querying Labeled Time Series Data with Scenario Programs
by: Kim, Edward, et al.
Published: (2025)

Tractable Offline Learning of Regular Decision Processes
by: Deb, Ahana, et al.
Published: (2024)

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
by: Raha, Ritam, et al.
Published: (2021)

Are Agents Probabilistic Automata? A Trace-Based, Memory-Constrained Theory of Agentic AI
by: Koohestani, Roham, et al.
Published: (2025)

Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability
by: Dhayalkar, Sahil Rajesh
Published: (2026)

Language Generation: Complexity Barriers and Implications for Learning
by: Arenas, Marcelo, et al.
Published: (2025)

LTL-Constrained Policy Optimization with Cycle Experience Replay
by: Shah, Ameesh, et al.
Published: (2024)

A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
by: Dhayalkar, Sahil Rajesh
Published: (2025)

MinMax Recurrent Neural Cascades
by: Ronca, Alessandro
Published: (2026)

Robust Probabilistic Model Checking with Continuous Reward Domains
by: Ji, Xiaotong, et al.
Published: (2025)

Lost in Transmission: When and Why LLMs Fail to Reason Globally
by: Schnabel, Tobias, et al.
Published: (2025)

Expressive Reward Synthesis with the Runtime Monitoring Language
by: Donnelly, Daniel, et al.
Published: (2025)

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)

Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning
by: Schneider, Tim, et al.
Published: (2023)

Analyzing constrained LLM through PDFA-learning
by: Carrasco, Matías, et al.
Published: (2024)

The Sparse Tsetlin Machine: Sparse Representation with Active Literals
by: Østby, Sebastian, et al.
Published: (2024)

Hilbert: Recursively Building Formal Proofs with Informal Reasoning
by: Varambally, Sumanth, et al.
Published: (2025)

Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs
by: Tomlinson, Kiran, et al.
Published: (2026)

Finding path and cycle counting formulae in graphs with Deep Reinforcement Learning
by: Piquenot, Jason, et al.
Published: (2024)

The Lottery LLM Hypothesis, Rethinking What Abilities Should LLM Compression Preserve?
by: Tang, Zhenheng, et al.
Published: (2025)

Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks
by: Voudouris, Konstantinos, et al.
Published: (2025)

InductionBench: LLMs Fail in the Simplest Complexity Class
by: Hua, Wenyue, et al.
Published: (2025)

Formal-LLM: Integrating Formal Language and Natural Language for Controllable LLM-based Agents
by: Li, Zelong, et al.
Published: (2024)

FormalAlign: Automated Alignment Evaluation for Autoformalization
by: Lu, Jianqiao, et al.
Published: (2024)

Mathematical Approach in Automata and Automata Association
by: Maciel, Sergio Henrique
Published: (2020)