<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>GradTree: Learning Axis-Aligned Decision Trees with Gradient Descent · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.03515/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2305.03515/feed.xml" rel="self" type="application/rss+xml" /><item><title>GradTree: Learning Axis-Aligned Decision Trees with Gradient Descent — mentioned by sitkack</title><link>https://news.ycombinator.com/item?id=40756751</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.03515:40756751</guid><pubDate>Sat, 22 Jun 2024 06:10:48 GMT</pubDate><description>&lt;p&gt;There is some work to convert NNs to decision trees. https://towardsdatascience.com/neural-networks-as-decision-t... https://arxiv.org/abs/2210.05189 I haven&amp;#x27;t reviewed any of it, I only know of it tangentially. https://www.semanticscholar.org/paper/Converting-A-Trained-N... Distilling a Neural Network Into a Soft Decision Tree https://arxiv.org/abs/1711.09784 GradTree: Learning Axis-Aligned Decision Trees with Gradient Descent https://arxiv.org/abs/2305.03515&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.03515/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>GradTree: Learning Axis-Aligned Decision Trees with Gradient Descent — mentioned by cgreerrun</title><link>https://news.ycombinator.com/item?id=38152855</link><guid isPermaLink="false">urn:hackerpapers:mention:2305.03515:38152855</guid><pubDate>Sun, 05 Nov 2023 16:51:38 GMT</pubDate><description>&lt;p&gt;You can use the straight through operator! During the forward pass you sample a discrete outcome given your NN weights to get an error for backprop. During the backward pass you directly propogate through the weights. This GradTree paper[1] does a good job covering how to do discrete gradient-based optimization (i.e. NNs w/ discrete representations). Another option is to use a GFlowNet[2]. Then you have a NN policy that takes discrete actions like you&amp;#x27;re playing an RL game. You&amp;#x27;re not back-propogating through something that isn&amp;#x27;t continuous, but you&amp;#x27;re utilizing a NN to make informed…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2305.03515/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
