<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning and Planning in Complex Action Spaces · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2104.06303/</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/2104.06303/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning and Planning in Complex Action Spaces — mentioned by osaariki</title><link>https://news.ycombinator.com/item?id=34506001</link><guid isPermaLink="false">urn:hackerpapers:mention:2104.06303:34506001</guid><pubDate>Tue, 24 Jan 2023 16:39:05 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;d love for someone to do a good quality PyTorch enabled implementation of Sampled AlphaZero/MuZero [1]. RLLib has an AlphaZero, but it doesn&amp;#x27;t have the parallelized MCTS you really want to have and the &amp;quot;Sampled&amp;quot; part is another twist to it. It does implement a single player variant though, which I needed. This would be amazing for applying MCTS based RL to various hard combinatorial optimization problems. Case in point, AlphaTensor uses their internal implementation of Sampled AlphaZero. An initial implementation might be doable in 5 hours for someone competent and familiar with RLLib&amp;#x27;s…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2104.06303/"&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>
