Learning Differentiable Decision Trees for Reinforcement Learning: Q-Learning or Policy Gradient?

In an earlier post, I laid out reasons that we might want to use a differentiable decision tree for reinforcement learning. In this post, I cover some experiments comparing two approaches for learning the parameters of these models: Q-Learning and Policy Gradient, showing that Q-Learning may not be a great choice if you want to apply differentiable decision trees in your own work.

Read More

Interpretable Machine Learning: Neural Networks and Differentiable Decision Trees

Ultimately, neural networks are lots of matrix multiplication and non-linear functions in series. And following where a single number goes and how it affects the outcome of a set of matrix multiplication problems can be rather daunting. What if we could distill a neural network into a simple decision tree, and just use that to understand how the agent makes decisions? In this overview of my recent work, I cover one approach to doing exactly that!

Read More