<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Less is More: Recursive Reasoning with Tiny Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2510.04871/</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/2510.04871/feed.xml" rel="self" type="application/rss+xml" /><item><title>Less is More: Recursive Reasoning with Tiny Networks — mentioned by calebkaiser</title><link>https://news.ycombinator.com/item?id=50149833</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.04871:50149833</guid><pubDate>Mon, 19 Oct 2026 08:32:17 GMT</pubDate><description>&lt;p&gt;Sebastian Raschka has a good introductory piece on what Looped Transformers usually refer to in practice: https://magazine.sebastianraschka.com/p/gpt-6-astra-looped-t... One of the big points is that looped architectures don&amp;#x27;t necessarily remove CoT style reasoning. They definitely change it, but the model can still be prompted for this kind of output. It just spends more computation on individual tokens. I think the hope, in that particular scenario, is that the model spends less tokens on things like backtracking. But there are lots of approaches to looped transformer architectures. Some…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — mentioned by SamCoding</title><link>https://news.ycombinator.com/item?id=49027871</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.04871:49027871</guid><pubDate>Thu, 23 Jul 2026 20:50:27 GMT</pubDate><description>&lt;p&gt;Referring to this paper: https://arxiv.org/pdf/2510.04871 My understanding: The Q-head predicts whether to stop early or not to reduce training times (by not always having to complete the full number of deep supervision steps). The complication: When working in batches: - Either, the Q-head is computed over the entire batch and averaged (which could early stopping of reasoning steps when most items in batch are complete but some aren&amp;#x27;t, meaning that those incomplete samples aren&amp;#x27;t trained on fully) - Or, the Q-head is computed over entire batch and samples that are complete are dropped. The…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — mentioned by whiplash451</title><link>https://news.ycombinator.com/item?id=48474894</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.04871:48474894</guid><pubDate>Wed, 10 Jun 2026 11:48:48 GMT</pubDate><description>&lt;p&gt;The TRM architecture models both the problem and the solution at the same time. You might find it an interesting read. https://arxiv.org/abs/2510.04871&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — mentioned by scoring1774</title><link>https://news.ycombinator.com/item?id=46904868</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.04871:46904868</guid><pubDate>Thu, 05 Feb 2026 20:36:20 GMT</pubDate><description>&lt;p&gt;This has been done: https://arxiv.org/abs/2510.04871v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — mentioned by m_ke</title><link>https://news.ycombinator.com/item?id=46018170</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.04871:46018170</guid><pubDate>Sat, 22 Nov 2025 20:55:04 GMT</pubDate><description>&lt;p&gt;Yes it would require completely new hardware and most likely ditching gradient descent for alternative optimization methods, though I&amp;#x27;m not convinced that we&amp;#x27;d need to turn to discrete optimization. Some recent works that people might find interesting: - Evolution Strategies at the Hyperscale - https://eshyperscale.github.io/ - Introducing Nested Learning: A new ML paradigm for continual learning - https://research.google/blog/introducing-nested-learning-a-n... - Less is More: Recursive Reasoning with Tiny Networks - https://arxiv.org/abs/2510.04871 - Nemotron Elastic: Towards Efficient…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — mentioned by JSR_FDED</title><link>https://news.ycombinator.com/item?id=45922978</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.04871:45922978</guid><pubDate>Fri, 14 Nov 2025 01:54:48 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2510.04871&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — mentioned by ayazhan</title><link>https://news.ycombinator.com/item?id=45597896</link><guid isPermaLink="false">urn:hackerpapers:mention:2510.04871:45597896</guid><pubDate>Wed, 15 Oct 2025 20:21:06 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2510.04871 another recursive based model&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — HN submission</title><link>https://news.ycombinator.com/item?id=45542329</link><guid isPermaLink="false">urn:hackerpapers:submission:2510.04871:45542329</guid><pubDate>Fri, 10 Oct 2025 18:43:52 GMT</pubDate><description>&lt;p&gt;Less is More: An LLM that outscores Claude Sonnet 4 while being 50.000x smaller&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — HN submission</title><link>https://news.ycombinator.com/item?id=45535098</link><guid isPermaLink="false">urn:hackerpapers:submission:2510.04871:45535098</guid><pubDate>Fri, 10 Oct 2025 03:19:10 GMT</pubDate><description>&lt;p&gt;Less is More: An LLM that outscores Claude Sonnet 4 while being 50.000x smaller&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/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — HN submission</title><link>https://news.ycombinator.com/item?id=45522827</link><guid isPermaLink="false">urn:hackerpapers:submission:2510.04871:45522827</guid><pubDate>Thu, 09 Oct 2025 02:23:09 GMT</pubDate><description>&lt;p&gt;Less Is More: Recursive Reasoning with Tiny Networks&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — HN submission</title><link>https://news.ycombinator.com/item?id=45516900</link><guid isPermaLink="false">urn:hackerpapers:submission:2510.04871:45516900</guid><pubDate>Wed, 08 Oct 2025 14:55:44 GMT</pubDate><description>&lt;p&gt;Show HN: Recursive Reasoning with Tiny Networks in the Browser&lt;/p&gt;&lt;p&gt;I wanted to get a better understanding of this paper, so I asked Claude to train and generate a small sudoku solver with some extra explaining. Original paper: https://arxiv.org/abs/2510.04871 New Link including link to source in github: https://claude.ai/public/artifacts/1dde5d3c-4ad8-420f-9b62-4...&lt;/p&gt;&lt;p&gt;1 point; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — HN submission</title><link>https://news.ycombinator.com/item?id=45516346</link><guid isPermaLink="false">urn:hackerpapers:submission:2510.04871:45516346</guid><pubDate>Wed, 08 Oct 2025 14:04:40 GMT</pubDate><description>&lt;p&gt;Samsung released a 7M model that achieved 45% on ARC-AGI-1&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;34 points; 12 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>Less is More: Recursive Reasoning with Tiny Networks — HN submission</title><link>https://news.ycombinator.com/item?id=45506268</link><guid isPermaLink="false">urn:hackerpapers:submission:2510.04871:45506268</guid><pubDate>Tue, 07 Oct 2025 17:42:06 GMT</pubDate><description>&lt;p&gt;Less is more: Recursive reasoning with tiny networks&lt;/p&gt;&lt;p&gt;Paper: https://arxiv.org/abs/2510.04871, Code: https://github.com/SamsungSAILMontreal/TinyRecursiveModels&lt;/p&gt;&lt;p&gt;323 points; 71 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2510.04871/"&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>
