<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Deep Reinforcement Learning from Self-Play in Imperfect-Information Games · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1603.01121/</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/1603.01121/feed.xml" rel="self" type="application/rss+xml" /><item><title>Deep Reinforcement Learning from Self-Play in Imperfect-Information Games — mentioned by thomasahle</title><link>https://news.ycombinator.com/item?id=29545314</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.01121:29545314</guid><pubDate>Mon, 13 Dec 2021 22:08:31 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;m more surprised David Silver isn&amp;#x27;t on it, since his background is in imperfect information games, with papers such as https://arxiv.org/abs/1603.01121 He did multiple poker papers before he was the main author of Alpha Zero.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.01121/"&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>Deep Reinforcement Learning from Self-Play in Imperfect-Information Games — mentioned by sanxiyn</title><link>https://news.ycombinator.com/item?id=15920807</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.01121:15920807</guid><pubDate>Thu, 14 Dec 2017 08:41:54 GMT</pubDate><description>&lt;p&gt;I would consider a successful application of AlphaZero algorithm to imperfect information games to be a separate achievement, not a done deal. David Silver himself, who led AlphaGo project, wrote in 2016 in &amp;quot;Deep Reinforcement Learning from Self-Play in Imperfect-Information Games&amp;quot; https://arxiv.org/abs/1603.01121 &amp;quot;While many machine learning methods have achieved near-optimal solutions to classical, perfect-information games, these methods fail to converge in imperfect-information games&amp;quot;.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.01121/"&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>Deep Reinforcement Learning from Self-Play in Imperfect-Information Games — mentioned by nl</title><link>https://news.ycombinator.com/item?id=13407352</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.01121:13407352</guid><pubDate>Mon, 16 Jan 2017 00:10:24 GMT</pubDate><description>&lt;p&gt;That paper doesn&amp;#x27;t mention game theory or the Nash equilibrium at all. Perhaps you mean [2], which does. However, the article seems to misinterpret this: the fact that that system approximates the Nash equilibrium should be expected. Any system (including humans) that performs well in those types of games will, almost by definition. [2] https://arxiv.org/pdf/1603.01121.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.01121/"&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>Deep Reinforcement Learning from Self-Play in Imperfect-Information Games — HN submission</title><link>https://news.ycombinator.com/item?id=11404164</link><guid isPermaLink="false">urn:hackerpapers:submission:1603.01121:11404164</guid><pubDate>Fri, 01 Apr 2016 11:51:53 GMT</pubDate><description>&lt;p&gt;The lead researcher behind AlphaGo describing how to build a poker bot&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;7 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1603.01121/"&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>
