<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>neural networks on Andrew Silva</title>
    <link>https://andrew-silva.github.io/tags/neural-networks/</link>
    <description>Recent content in neural networks on Andrew Silva</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <lastBuildDate>Mon, 21 Dec 2020 03:58:16 +0000</lastBuildDate>
    <atom:link href="https://andrew-silva.github.io/tags/neural-networks/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Learning Differentiable Decision Trees for Reinforcement Learning: Q-Learning or Policy Gradient?</title>
      <link>https://andrew-silva.github.io/posts/learning-differentiable-decision-trees-for-reinforcement-learning/</link>
      <pubDate>Mon, 21 Dec 2020 03:58:16 +0000</pubDate>
      <guid>https://andrew-silva.github.io/posts/learning-differentiable-decision-trees-for-reinforcement-learning/</guid>
      <description>In conjunction with an earlier post on the use of Differentiable Decision Trees (DDTs) for interpretable reinforcement learning, this post will cover my recent AISTATS paper Optimization Methods for Interpretable Differentiable Decision Trees in Reinforcement Learning. In my earlier post, I laid out some reasons that we might want to use DDTs for reinforcement learning: they afford discretization for interpretable plans, they allow for warm-starting and human initialization, and they are surprisingly robust to hyperparameter selection (things like learning rates, number of layers, and so on).</description>
    </item>
    <item>
      <title>Interpretable Machine Learning: Neural Networks and Differentiable Decision Trees</title>
      <link>https://andrew-silva.github.io/posts/interpretable-machine-learning/</link>
      <pubDate>Tue, 10 Mar 2020 20:35:58 +0000</pubDate>
      <guid>https://andrew-silva.github.io/posts/interpretable-machine-learning/</guid>
      <description>A brief foreword: This entire post is a high-level summary of the motivations and contributions of my paper which was recently accepted to AISTATS 2020! For some math on why Q-Learning is less stable than policy gradients for differentiable decision trees, a full list of my references/sources, and more thorough comparisons, etc. check out the full paper: Optimization Methods for Interpretable Differentiable Decision Trees in Reinforcement Learning.
Why aren’t normal neural networks interpretable?</description>
    </item>
  </channel>
</rss>
