Detecting Hidden Triggers: Mapping Non-Markov Reward Functions to Markov
On the map: Deep reinforcement learning methods → Interpretable and logic-guided RL
Abstract (arXiv)
Many Reinforcement Learning algorithms assume a Markov reward function to guarantee optimality. However, not all reward functions are Markov. This paper proposes a framework for mapping non-Markov reward functions into equivalent Markov ones by learning specialized reward automata, Reward Machines. Unlike the general practice of learning Reward Machines, we do not require a set of high-level propositional symbols from which to learn. Rather, we learn hidden triggers, directly from data, that construct them. We demonstrate the importance of learning Reward Machines over their Deterministic Finite-State Automata counterparts given their ability to model reward dependencies. We formalize this distinction in our learning objective. Our mapping process is constructed as an Integer Linear Programming problem. We prove that our mappings form a suitable proxy for maximizing reward expectations. We empirically validate our approach by learning black-box, non-Markov reward functions in the Officeworld domain. Additionally, we demonstrate the effectiveness of learning reward dependencies in a new domain, Breakfastworld.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Interpretable and logic-guided RL, one of 15 directions in Deep reinforcement learning methods. Builds on 15 of its 35 references that are in the map. First posted on arXiv 20 Jan 2024.
Builds on
15 of 35 references.
References · 15
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 465
- 2020Reward Machines: Exploiting Reward Function Structure in Reinforcement Learningcited by 191
- 2016Reinforcement Learning With Temporal Logic Rewardscited by 117
- 2021On the Expressivity of Markov Rewardcited by 71
- 2017Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamplescited by 66
- 2019Joint Inference of Reward Machines and Policies for Reinforcement Learningcited by 56
- 2019Reinforcement Learning with Non-Markovian Rewardscited by 45
- 2020Induction and Exploitation of Subgoal Automata for Reinforcement Learningcited by 26
- 2020Interpretable Sequence Classification via Discrete Optimizationcited by 19
- 2021Inferring Probabilistic Reward Machines from Non-Markovian Reward Processes for Reinforcement Learningcited by 13
- 2022Non-Markovian Reward Modelling from Trajectory Labels via Interpretable Multiple Instance Learningcited by 13
3 more
Built on by
Citing papers per year: 2025: 4; 2026: 1.
5 papers.
- 2025Ground-Compose-Reinforce: Grounding Language in Agentic Behaviours using Limited Datacited by 5
- 2025Synthetic POMDPs to Challenge Memory-Augmented RL: Memory Demand Structure Modelingcited by 1
- 2025Fully Learnable Neural Reward Machinescited by 1
- 2025Inferring Reward Machines and Transition Machines from Partially Observable Markov Decision Processescited by 0
- 2026DeepDFA: Injecting Temporal Logic in Deep Learning for Sequential Subsymbolic Applicationscited by 0
- 2026DeepDFA: Injecting Temporal Logic in Deep Learning for Sequential Subsymbolic Applications3 Feb 2026
- 2025Fully Learnable Neural Reward Machines23 Sep 2025
- 2025Synthetic POMDPs to Challenge Memory-Augmented RL: Memory Demand Structure Modeling6 Aug 2025
- 2025Inferring Reward Machines and Transition Machines from Partially Observable Markov Decision Processes3 Aug 2025
- 2025Ground-Compose-Reinforce: Grounding Language in Agentic Behaviours using Limited Data14 Jul 2025
Similar, not cited
Close in wording, no citation either way
- 2025Expressive Reward Synthesis with the Runtime Monitoring Language
- 2025About Time: Model-free Reinforcement Learning with Timed Reward Machines
- 2025Pushdown Reward Machines for Reinforcement Learning
- 2025Physics-Informed Reward Machines
- 2026Active Reward Machine Inference From Raw State Trajectories
- 2024Neural Reward Machines
- 2024Beyond Simple Sum of Delayed Rewards: Non-Markovian Reward Modeling for Reinforcement Learning
- 2025RLAF: Reinforcement Learning from Automaton Feedback