Unifilarisation of stochastic Mealy machines is an instance of coalgebraic determinisation over monads with support structure, producing causal stochastic behaviours rather than Moore-style output distributions.
A Theory of Abstraction in Reinforcement Learning
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Abstract simulators can be grounded to real tasks by making their dynamics history-dependent and correcting them with real data, enabling RL policy transfer.
citing papers explorer
-
Bayesian updates from coalgebraic determinisation
Unifilarisation of stochastic Mealy machines is an instance of coalgebraic determinisation over monads with support structure, producing causal stochastic behaviours rather than Moore-style output distributions.
-
Abstract Sim2Real through Approximate Information States
Abstract simulators can be grounded to real tasks by making their dynamics history-dependent and correcting them with real data, enabling RL policy transfer.