<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Accelerating Self-Play Learning in Go · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1902.10565/</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/1902.10565/feed.xml" rel="self" type="application/rss+xml" /><item><title>Accelerating Self-Play Learning in Go — mentioned by carry_bit</title><link>https://news.ycombinator.com/item?id=33454434</link><guid isPermaLink="false">urn:hackerpapers:mention:1902.10565:33454434</guid><pubDate>Thu, 03 Nov 2022 17:30:07 GMT</pubDate><description>&lt;p&gt;From a tweet of one of the authors [1]: &amp;quot;KataGo was trained on Tromp-Taylor rules so we evaluate our attack using this too.&amp;quot; This is incorrect. According to the KataGo paper [2], KataGo is trained using modified Tromp-Taylor rules (as pointed out by [3]): &amp;quot;Self play games used Tromp-Taylor rules modified to not require capturing stones within pass-aliveterritory [...] In Go, a version of Benson&amp;#x27;s algorithm [1] can prove areas safe even given unboundedly many consecutive opponent moves (&amp;quot;pass-alive&amp;quot;), enabling this minor optimization.&amp;quot; It would be more interesting if they beat KataGo using the…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1902.10565/"&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>Accelerating Self-Play Learning in Go — mentioned by cgreerrun</title><link>https://news.ycombinator.com/item?id=23600875</link><guid isPermaLink="false">urn:hackerpapers:mention:1902.10565:23600875</guid><pubDate>Mon, 22 Jun 2020 14:54:13 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve been working on a Python implementation that uses Gradient Boosted Decision Trees (LightGBM/Treelite) instead of using a neural network for the value/policy models: https://github.com/cgreer/alpha-zero-boosted It&amp;#x27;s mostly to understand how AlphaZero&amp;amp;Friends work. I&amp;#x27;m also curious about how well a GBDT could do, and if there are self-play techniques that can accelerate training. The nice thing about a GBDT is that, unlike when using a NN, you can do thousands of value/policy lookups per second on a single core. So it should be cheaper to scale self-play and run a lot of self-play…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1902.10565/"&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>Accelerating Self-Play Learning in Go — mentioned by jedharris</title><link>https://news.ycombinator.com/item?id=23521836</link><guid isPermaLink="false">urn:hackerpapers:mention:1902.10565:23521836</guid><pubDate>Sun, 14 Jun 2020 22:16:07 GMT</pubDate><description>&lt;p&gt;Related demos, repositories, papers and posts: More recent and extensive post: https://blog.janestreet.com/deep-learning-the-hardest-go-pro... Site to play against KataGo: https://online-go.com/player/592684/ Arxiv paper on KataGo design: https://arxiv.org/abs/1902.10565 GitHub repository of KataGo: https://github.com/lightvector/KataGo Another writer commenting on the history of Go AI, and significance of KataGo: https://brantondemoss.com/writing/kata.html&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1902.10565/"&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>Accelerating Self-Play Learning in Go — mentioned by sanxiyn</title><link>https://news.ycombinator.com/item?id=23487105</link><guid isPermaLink="false">urn:hackerpapers:mention:1902.10565:23487105</guid><pubDate>Thu, 11 Jun 2020 10:07:56 GMT</pubDate><description>&lt;p&gt;KataGo optimized AlphaZero and achieved 50x compute reduction. https://arxiv.org/abs/1902.10565&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1902.10565/"&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>Accelerating Self-Play Learning in Go — mentioned by gwern</title><link>https://news.ycombinator.com/item?id=21673211</link><guid isPermaLink="false">urn:hackerpapers:mention:1902.10565:21673211</guid><pubDate>Sun, 01 Dec 2019 01:27:42 GMT</pubDate><description>&lt;p&gt;He&amp;#x27;s also wrong about a lot. For all his insistence on accuracy, he himself is misleading or ignorant. Like his slam of the Dartmouth project - even if you knew nothing about it, all you have to do is click through to see the claims of &amp;#x27;solving vision&amp;#x27; are sheer projection and urban legend. And he&amp;#x27;s happy to make up claims out of whole cloth: for example, when he says &amp;quot;AlphaGo works fine on a 19x19 board, but would need to be retrained to play on a rectangular board; the lack of transfer is telling.&amp;quot;, for which he provides precisely zero evidence, he ignores the fact that AG training works…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1902.10565/"&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>Accelerating Self-Play Learning in Go — mentioned by codehotter</title><link>https://news.ycombinator.com/item?id=21609598</link><guid isPermaLink="false">urn:hackerpapers:mention:1902.10565:21609598</guid><pubDate>Fri, 22 Nov 2019 20:16:28 GMT</pubDate><description>&lt;p&gt;AlphaGo Master, unsurprisingly, was significantly stronger than AlphaGoZero. AlphaZero, although it can play multiple games, was weaker yet. In both cases, they compared the 40 block version of the one with the 20 block version of the other (they had to double the network size to approach the level of the predecessor.) Recently, Katago has reached similar levels of strength using a small fraction of the resources: https://arxiv.org/abs/1902.10565 It depends on what you mean by &amp;quot;more efficient.&amp;quot; The significance of AlphaZero was that you can reach good results in a variety of domains even…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1902.10565/"&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>
