<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Minimum Description Length Recurrent Neural Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2111.00600/</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/2111.00600/feed.xml" rel="self" type="application/rss+xml" /><item><title>Minimum Description Length Recurrent Neural Networks — HN submission</title><link>https://news.ycombinator.com/item?id=40407682</link><guid isPermaLink="false">urn:hackerpapers:submission:2111.00600:40407682</guid><pubDate>Sun, 19 May 2024 15:47:53 GMT</pubDate><description>&lt;p&gt;Minimum Description Length Recurrent Neural Networks (2022)&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/2111.00600/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Minimum Description Length Recurrent Neural Networks — mentioned by puttycat</title><link>https://news.ycombinator.com/item?id=34401947</link><guid isPermaLink="false">urn:hackerpapers:mention:2111.00600:34401947</guid><pubDate>Mon, 16 Jan 2023 16:01:15 GMT</pubDate><description>&lt;p&gt;Recent work on NNs where applying Kolmogorov complexity optimization leads to a network that solves binary addition with a carry-over counter and 100% provable accuracy: (see Results section) https://arxiv.org/abs/2111.00600&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2111.00600/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Minimum Description Length Recurrent Neural Networks — HN submission</title><link>https://news.ycombinator.com/item?id=31694762</link><guid isPermaLink="false">urn:hackerpapers:submission:2111.00600:31694762</guid><pubDate>Fri, 10 Jun 2022 14:33:29 GMT</pubDate><description>&lt;p&gt;Minimum Description Length Recurrent Neural Networks&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/2111.00600/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Minimum Description Length Recurrent Neural Networks — mentioned by puttycat</title><link>https://news.ycombinator.com/item?id=31675341</link><guid isPermaLink="false">urn:hackerpapers:mention:2111.00600:31675341</guid><pubDate>Wed, 08 Jun 2022 22:41:28 GMT</pubDate><description>&lt;p&gt;Indeed this would need to predefine a maximum number of states. This work referenced also in the OP paper uses recurrent neural nets and a genetic algorithm to evolve the minimal number of states needed: https://arxiv.org/abs/2111.00600&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2111.00600/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item><item><title>Minimum Description Length Recurrent Neural Networks — HN submission</title><link>https://news.ycombinator.com/item?id=30896902</link><guid isPermaLink="false">urn:hackerpapers:submission:2111.00600:30896902</guid><pubDate>Sun, 03 Apr 2022 13:49:08 GMT</pubDate><description>&lt;p&gt;Minimum Description Length Recurrent Neural Networks&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/2111.00600/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
