<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2202.05826/</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/2202.05826/feed.xml" rel="self" type="application/rss+xml" /><item><title>End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking — mentioned by atrudeau</title><link>https://news.ycombinator.com/item?id=45517307</link><guid isPermaLink="false">urn:hackerpapers:mention:2202.05826:45517307</guid><pubDate>Wed, 08 Oct 2025 15:33:34 GMT</pubDate><description>&lt;p&gt;Very cool to see the effectiveness of recurrence on ARC. For those interested in recurrence, here are other works that leverage a similar approach for other types of problems: Language modeling: Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach https://arxiv.org/pdf/2502.05171 Puzzle solving: A Simple Loss Function for Convergent Algorithm Synthesis using RNNs https://openreview.net/pdf?id=WaAJ883AqiY End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking https://arxiv.org/abs/2202.05826 Can You Learn an Algorithm?…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2202.05826/"&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>End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking — HN submission</title><link>https://news.ycombinator.com/item?id=30329971</link><guid isPermaLink="false">urn:hackerpapers:submission:2202.05826:30329971</guid><pubDate>Mon, 14 Feb 2022 09:20:43 GMT</pubDate><description>&lt;p&gt;End-to-End Algorithm Synthesis with Recurrent 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/2202.05826/"&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>
