<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2402.14083/</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/2402.14083/feed.xml" rel="self" type="application/rss+xml" /><item><title>Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping — mentioned by hislaziness</title><link>https://news.ycombinator.com/item?id=41921983</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.14083:41921983</guid><pubDate>Wed, 23 Oct 2024 05:03:31 GMT</pubDate><description>&lt;p&gt;As I understand, the LLM uses the techniques of searchformer - https://arxiv.org/abs/2402.14083. To do &amp;quot;slow thinking&amp;quot; doing a A* search using a transofrmer.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.14083/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping — mentioned by throwaway4aday</title><link>https://news.ycombinator.com/item?id=41505784</link><guid isPermaLink="false">urn:hackerpapers:mention:2402.14083:41505784</guid><pubDate>Tue, 10 Sep 2024 21:28:57 GMT</pubDate><description>&lt;p&gt;While I agree that we don&amp;#x27;t want to extrapolate too much I disagree that this type of exploration may not benefit from more compute. We won&amp;#x27;t know until we try and since we have what seems to be a very generalizable architecture it makes sense to take the brute force approach of creating models of that data by scaling the amount of data and the amount of compute we dedicate to it. If it turns out not to work then we&amp;#x27;ve learned something. As it turns out, Logic and Algorithms has seen some early success using Transformers (Searchformer) https://arxiv.org/abs/2402.14083&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2402.14083/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping — HN submission</title><link>https://news.ycombinator.com/item?id=39487007</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.14083:39487007</guid><pubDate>Fri, 23 Feb 2024 22:34:11 GMT</pubDate><description>&lt;p&gt;Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.14083/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item><item><title>Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping — HN submission</title><link>https://news.ycombinator.com/item?id=39479478</link><guid isPermaLink="false">urn:hackerpapers:submission:2402.14083:39479478</guid><pubDate>Fri, 23 Feb 2024 11:53:25 GMT</pubDate><description>&lt;p&gt;Beyond A*: Better Planning with Transformers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;313 points; 120 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2402.14083/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
