arXiv Machine Learning
Temporal-Causal Inference for Reinforcement Learning via Automata Learning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Sep 11
Reinforcement Learning with Temporal-Logic-Based Causal Diagrams
The paper introduces Temporal-Logic-based Causal Diagrams (TL-CDs) for reinforcement learning tasks that involve temporally extended goals. TL-CDs encode causal relationships among environmental properties, complementing deterministic finite automata that model rewards. By leveraging TL-CDs, the authors design an RL algorithm that can predict expected rewards early, leading to significantly reduced exploration and faster convergence to optimal policies.
arXiv AI
Jun 24
An Introduction to Causal Reinforcement Learning
arXiv:2606. 24160v1 Announce Type: new Abstract: Causal inference provides a set of principles and tools that allow one to combine data and knowledge about an environment to reason with questions of counterfactual nature, i.
arXiv AI
Aug 17
Reward Machines for Signal Temporal Logic
arXiv:2608. 13625v1 Announce Type: new Abstract: Signal temporal logic (STL) provides a formal language for specifying real-time properties of real-valued observations, along with a quantitative robustness score for monitoring satisfaction.
Hugging Face Trending Papers
Jun 23
An Introduction to Causal Reinforcement Learning
Causal inference provides a set of principles and tools that allow one to combine data and knowledge about an environment to reason with questions of counterfactual nature, i. e.
arXiv Machine Learning
Jul 30
Learning Implicit Causal World Models from Multi-Agent Demonstrations
arXiv:2607. 26336v1 Announce Type: new Abstract: In model-based reinforcement learning, world models exist as internal simulators, but their training often conflates statistical correlations with causal mechanisms.
arXiv AI
Jun 30
Sample-Efficient Learning of Probabilistic Causes for Reachability in Markov Decision Processes with Probabilistic Guarantees
arXiv:2606. 29681v1 Announce Type: new Abstract: Probabilistic model checking for Markov decision processes (MDPs) provides quantitative guarantees, but often offers limited insight into why undesired outcomes occur.