paper-with-me

Papers

POETREE: Interpretable Policy Learning with Adaptive Decision Trees

2022-03-15 · ICLR 2022 4 · Alizée Pace, Alex J. Chan, Mihaela van der Schaar

Building models of human decision-making from observed behaviour is critical to better understand, diagnose and support real-world policies such as clinical care. As established policy learning approaches remain focused on imitation performance, they fall short of explaining the demonstrated decision-making process. Policy Extraction through decision Trees (POETREE) is a novel framework for interpretable policy learning, compatible with fully-offline and partially-observable clinical decision environments -- and builds probabilistic tree policies determining physician actions based on patients' observations and medical history. Fully-differentiable tree architectures are grown incrementally during optimization to adapt their complexity to the modelling task, and learn a representation of patient history through recurrence, resulting in decision tree policies that adapt over time with patient information. This policy learning method outperforms the state-of-the-art on real and synthetic medical datasets, both in terms of understanding, quantifying and evaluating observed behaviour as well as in accurately replicating it -- with potential to improve future decision support systems.

📄 PDF Abstract BibTeX arXiv:2203.08057

Code (0)

등록된 구현이 없습니다.

Tasks

Decision Making

Similar Papers 제목 키워드 기반

Policy Trees for Prediction: Interpretable and Adaptive Model Selection for Machine Learning

2024-05-30 · Dimitris Bertsimas, Matthew Peroni

As a multitude of capable machine learning (ML) models become widely available in forms such as open-source software and public APIs, central questions remain regarding their use in real-world applications, especially in…

Decision MakingModel Selection

Optimization Methods for Interpretable Differentiable Decision Trees in Reinforcement Learning

2019-03-22 · Andrew Silva, Taylor Killian, Ivan Dario Jimenez Rodriguez, Sung-Hyun Son 외

Decision trees are ubiquitous in machine learning for their ease of use and interpretability. Yet, these models are not typically employed in reinforcement learning as they cannot be updated online via stochastic gradien…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Mitigating Information Loss in Tree-Based Reinforcement Learning via Direct Optimization

2024-08-16 · Sascha Marton, Tim Grams, Florian Vogt, Stefan Lüdtke 외

Reinforcement learning (RL) has seen significant success across various domains, but its adoption is often limited by the black-box nature of neural network policies, making them difficult to interpret. In contrast, symb…

Decision Makingreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Optimal Policy Trees

2020-12-03 · Maxime Amram, Jack Dunn, Ying Daisy Zhuo

We propose an approach for learning optimal tree-based prescription policies directly from data, combining methods for counterfactual estimation from the causal inference literature with recent advances in training globa…

Causal Inferencecounterfactual

MoET: Interpretable and Verifiable Reinforcement Learning via Mixture of Expert Trees

2019-09-25 · Marko Vasic, Andrija Petrovic, Kaiyuan Wang, Mladen Nikolic 외

Deep Reinforcement Learning (DRL) has led to many recent breakthroughs on complex control tasks, such as defeating the best human player in the game of Go. However, decisions made by the DRL agent are not explainable, hi…

Deep Reinforcement LearningGame of GoImitation LearningMixture-of-Experts+3