Interpretable Preference-based Reinforcement Learning with Tree-Structured Reward Functions
On the map: LLM alignment / RLHF / preference optimisation → Reward modeling and RLHF
Abstract (arXiv)
The potential of reinforcement learning (RL) to deliver aligned and performant agents is partially bottlenecked by the reward engineering problem. One alternative to heuristic trial-and-error is preference-based RL (PbRL), where a reward function is inferred from sparse human feedback. However, prior PbRL methods lack interpretability of the learned reward structure, which hampers the ability to assess robustness and alignment. We propose an online, active preference learning algorithm that constructs reward functions with the intrinsically interpretable, compositional structure of a tree. Using both synthetic and human-provided feedback, we demonstrate sample-efficient learning of tree-structured reward functions in several environments, then harness the enhanced interpretability to explore and debug for alignment.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Placed in Reward modeling and RLHF, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 15 of its 42 references that are in the map. First posted on arXiv 20 Dec 2021.
Builds on
15 of 42 references.
Closest ancestors · 3
Same direction, newest first
- 2018Scalable agent alignment via reward modeling: a research direction19 Nov
- 2018Reward learning from human preferences and demonstrations in Atari15 Nov
- 2017Deep reinforcement learning from human preferences12 Jun
Other references · 12
- 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 734
- 2017Inverse Reward Designcited by 246
- 2020Preference-based Reinforcement Learning with Finite-Time Guaranteescited by 65
- 2021A Survey on Interactive Reinforcement Learning: Design Principles and Open Challengescited by 41
- 2020Understanding Learned Reward Functionscited by 37
- 2015Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Banditscited by 29
- 2020TripleTree: A Versatile Interpretable Representation of Black Box Agents and their Environmentscited by 18
- 2021APReL: A Library for Active Preference-based Reward Learning Algorithmscited by 14
- 2020Interactive Imitation Learning in State-Spacecited by 10
- 2015A graph interpretation of the least squares ranking methodcited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 5; 2024: 2.
10 papers.
- 2023Explainable Artificial Intelligence (XAI) 2.0: A Manifesto of Open Challenges and Interdisciplinary Research Directionscited by 123
- 2021A Survey on Interpretable Reinforcement Learningcited by 70
- 2023Structure in Deep Reinforcement Learning: A Survey and Open Problemscited by 16
- 2022Non-Markovian Reward Modelling from Trajectory Labels via Interpretable Multiple Instance Learningcited by 13
- 2024Informativeness of Reward Functions in Reinforcement Learningcited by 3
- 2022Reward Learning with Trees: Methods and Evaluationcited by 2
- 2023Incorporating Human Flexibility through Reward Preferences in Human-AI Teamingcited by 2
- 2024Explaining Learned Reward Functions with Counterfactual Trajectoriescited by 1
- 2023Learning Interpretable Models of Aircraft Handling Behaviour by Reinforcement Learning from Human Feedbackcited by 0
- 2023Can Differentiable Decision Trees Enable Interpretable Reward Learning from Human Feedback?cited by 0
- 2024Informativeness of Reward Functions in Reinforcement Learning10 Feb 2024
- 2024Explaining Learned Reward Functions with Counterfactual Trajectories7 Feb 2024
- 2023Incorporating Human Flexibility through Reward Preferences in Human-AI Teaming21 Dec 2023
- 2023Explainable Artificial Intelligence (XAI) 2.0: A Manifesto of Open Challenges and Interdisciplinary Research Directions30 Oct 2023
- 2023Structure in Deep Reinforcement Learning: A Survey and Open Problems28 Jun 2023
- 2023Can Differentiable Decision Trees Enable Interpretable Reward Learning from Human Feedback?22 Jun 2023
- 2023Learning Interpretable Models of Aircraft Handling Behaviour by Reinforcement Learning from Human Feedback26 May 2023
- 2022Reward Learning with Trees: Methods and Evaluation3 Oct 2022
- 2022Non-Markovian Reward Modelling from Trajectory Labels via Interpretable Multiple Instance Learning30 May 2022
- 2021A Survey on Interpretable Reinforcement Learning24 Dec 2021
Similar, not cited
Close in wording, no citation either way
- 2026From Reward-Free Representations to Preferences: Rethinking Offline Preference-Based Reinforcement Learning
- 2025Repairing Reward Functions with Feedback to Mitigate Reward Hacking
- 2023Inverse Preference Learning: Preference-based RL without a Reward Function
- 2023Provable Reward-Agnostic Preference-Based Reinforcement Learning
- 2023Direct Preference-based Policy Optimization without Reward Modeling
- 2025Similarity as Reward Alignment: Robust and Versatile Preference-based Reinforcement Learning
- 2025AutoRule: Reasoning Chain-of-thought Extracted Rule-based Rewards Improve Preference Learning
- 2023Benchmarks and Algorithms for Offline Preference-Based Reward Learning