<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Discovering Symbolic Models from Deep Learning with Inductive Biases · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2006.11287/</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/2006.11287/feed.xml" rel="self" type="application/rss+xml" /><item><title>Discovering Symbolic Models from Deep Learning with Inductive Biases — mentioned by goodmachine</title><link>https://news.ycombinator.com/item?id=40305732</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.11287:40305732</guid><pubDate>Thu, 09 May 2024 06:15:34 GMT</pubDate><description>&lt;p&gt;In order for that not to happen (uninterpretable ML models) some research on symbolic distillation, aka symbolic regression https://arxiv.org/abs/2006.11287 https://www.science.org/doi/10.1126/sciadv.aay2631&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.11287/"&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>Discovering Symbolic Models from Deep Learning with Inductive Biases — mentioned by tbalsam</title><link>https://news.ycombinator.com/item?id=37572317</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.11287:37572317</guid><pubDate>Tue, 19 Sep 2023 16:26:39 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m curious how this relates to MDL-tied regularization. I don&amp;#x27;t see any explicit reference to the L2 norm here, and I&amp;#x27;m not too smart about graph neural networks. But it seems like overfitting is almost necessary unless some kind of obscure variational technique is used? They did have one paper where they used a progressively compressed GNN to isolate an approximation for a cosmological equation smaller and more accurate than had been previously achieved. I&amp;#x27;ll update here if I find it. Edit: Ah, here we are: https://arxiv.org/abs/2006.11287 I believe there was some very good followup work…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.11287/"&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>Discovering Symbolic Models from Deep Learning with Inductive Biases — mentioned by KhoomeiK</title><link>https://news.ycombinator.com/item?id=25351541</link><guid isPermaLink="false">urn:hackerpapers:mention:2006.11287:25351541</guid><pubDate>Tue, 08 Dec 2020 21:24:03 GMT</pubDate><description>&lt;p&gt;Discovering Symbolic Models from Deep Learning with Inductive Biases [1] trains graph neural nets on astrophysical phenomena and then performs symbolic regression to generate algebraic formulae to elegantly model the phenomena in a classical physics framework. It&amp;#x27;s largely gone under the radar but has pretty interesting implications for NLP and language theory in my opinion. Direct Feedback Alignment Scales to Modern Deep Learning Tasks and Architectures [2] applies DFA, an approach to training neural nets without backprop, to modern architectures like the Transformer. It does surprisingly…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2006.11287/"&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>Discovering Symbolic Models from Deep Learning with Inductive Biases — HN submission</title><link>https://news.ycombinator.com/item?id=23901071</link><guid isPermaLink="false">urn:hackerpapers:submission:2006.11287:23901071</guid><pubDate>Mon, 20 Jul 2020 19:31:32 GMT</pubDate><description>&lt;p&gt;Discovering Symbolic Models from Deep Learning with Inductive Biases&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2006.11287/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Discovering Symbolic Models from Deep Learning with Inductive Biases — HN submission</title><link>https://news.ycombinator.com/item?id=23681262</link><guid isPermaLink="false">urn:hackerpapers:submission:2006.11287:23681262</guid><pubDate>Mon, 29 Jun 2020 19:09:37 GMT</pubDate><description>&lt;p&gt;Discovering Symbolic Models from Deep Learning with Inductive Biases&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2006.11287/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Discovering Symbolic Models from Deep Learning with Inductive Biases — HN submission</title><link>https://news.ycombinator.com/item?id=23668235</link><guid isPermaLink="false">urn:hackerpapers:submission:2006.11287:23668235</guid><pubDate>Sun, 28 Jun 2020 12:14:40 GMT</pubDate><description>&lt;p&gt;Discovering Symbolic Models from Deep Learning with Inductive Biases&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2006.11287/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
