Cover Image

Learning Reward Machines from Partially Observed Policies

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shehab, Mohamad Louai, Aspeel, Antoine, Ozay, Necmiye
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Active Reward Machine Inference From Raw State Trajectories
by: Shehab, Mohamad Louai, et al.
Published: (2026)

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

Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
by: Li, Tian, et al.
Published: (2025)

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
by: Dumitru, Radu Cosmin, et al.
Published: (2026)

MLRegTest: A Benchmark for the Machine Learning of Regular Languages
by: van der Poel, Sam, et al.
Published: (2023)

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

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)

Extending AALpy with Passive Learning: A Generalized State-Merging Approach
by: von Berg, Benjamin, et al.
Published: (2025)

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

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

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
by: Kuriyama, Takayuki
Published: (2026)

PAC learning PDFA from data streams
by: Baumgartner, Robert, et al.
Published: (2026)

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

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

Deconstructing Subset Construction -- Reducing While Determinizing
by: Nicol, John, et al.
Published: (2025)

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

Transformers as Transducers
by: Strobl, Lena, et al.
Published: (2024)

Continuous Diffusion Models Can Obey Formal Syntax
by: Kim, Jinwoo, et al.
Published: (2026)

Unsupervised Hierarchical Skill Discovery
by: Harvey, Damion, et al.
Published: (2026)

PDFA Distillation via String Probability Queries
by: Baumgartner, Robert, et al.
Published: (2024)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
by: Chen, Boqi, et al.
Published: (2024)

Solomonoff induction
by: Sterkenburg, Tom F.
Published: (2026)

RESTL: Reinforcement Learning Guided by Multi-Aspect Rewards for Signal Temporal Logic Transformation
by: Fang, Yue, et al.
Published: (2025)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)

Attributed Tree Transducers for Partial Functions
by: Maneth, Sebastian, et al.
Published: (2024)

Unraveling Syntax: How Language Models Learn Context-Free Grammars
by: Schulz, Laura Ying, et al.
Published: (2025)

Locality and Centrality: The Variety ZG
by: Amarilli, Antoine, et al.
Published: (2021)

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
by: Hayashi, Katsuhiko, et al.
Published: (2025)

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

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
by: Esparza, Javier, et al.
Published: (2023)

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024)

Notes on Stack Machines and Quantum Stack Machines
by: Qiu, Daowen
Published: (2025)

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

Sampling from Your Language Model One Byte at a Time
by: Hayase, Jonathan, et al.
Published: (2025)

Locality Testing for NFAs is PSPACE-complete
by: Amarilli, Antoine, et al.
Published: (2025)

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

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Networks of Moore Machines
by: Yodaiken, Victor
Published: (2015)

TR2MTL: LLM based framework for Metric Temporal Logic Formalization of Traffic Rules
by: Manas, Kumar, et al.
Published: (2024)