<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>It's Hard for Neural Networks To Learn the Game of Life · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2009.01398/</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/2009.01398/feed.xml" rel="self" type="application/rss+xml" /><item><title>It's Hard for Neural Networks To Learn the Game of Life — mentioned by friedchips</title><link>https://news.ycombinator.com/item?id=45025249</link><guid isPermaLink="false">urn:hackerpapers:mention:2009.01398:45025249</guid><pubDate>Tue, 26 Aug 2025 11:51:32 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m not involved in this project, but I partially replicated the results from Mordvintsev et al. a few years ago because I found the idea interesting. The key idea for me was learning the possibly unknown rules of a CA from training examples. This sounded to me like something that could be useful in science, to learn about spatially distributed processes. Or in ML as a new idea for image classification or segmentation. The hope was always that a CA could be learned which would have a simple discrete representation which could then be used in inference with much lower computational needs than…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2009.01398/"&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>
