<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On the ability of neural nets to express distributions · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1702.07028/</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/1702.07028/feed.xml" rel="self" type="application/rss+xml" /><item><title>On the ability of neural nets to express distributions — HN submission</title><link>https://news.ycombinator.com/item?id=39953801</link><guid isPermaLink="false">urn:hackerpapers:submission:1702.07028:39953801</guid><pubDate>Sat, 06 Apr 2024 17:13:14 GMT</pubDate><description>&lt;p&gt;Algebraic Simplification Neural Nets&lt;/p&gt;&lt;p&gt;It seems that there should be a way to algebraically simplify neural nets. Trivially a node that has a zero weight can be removed as can any links to / from that node. It should also be possible to eliminate nodes that have a full-value (aka &amp;#x27;1&amp;#x27; on the 0-1 scale) I have also seen work where the matrix multiplies during training can have columns &amp;quot;collapsed&amp;quot;. The ultimate question might be applying an &amp;quot;algebraic simplification&amp;quot; of the final network to simplify a post-trained network used for inference. The idea is to take a path through a network, constructing the equation for that path…&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1702.07028/"&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>
