<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Posterior Sampling for Large Scale Reinforcement Learning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1711.07979/</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/1711.07979/feed.xml" rel="self" type="application/rss+xml" /><item><title>Posterior Sampling for Large Scale Reinforcement Learning — mentioned by gwern</title><link>https://news.ycombinator.com/item?id=44162009</link><guid isPermaLink="false">urn:hackerpapers:mention:1711.07979:44162009</guid><pubDate>Mon, 02 Jun 2025 19:11:48 GMT</pubDate><description>&lt;p&gt;https://gwern.net/doc/science/1986-hamming#great-thoughts-fr... You can think of it as a RL problem, and there are some interesting algorithms which achieve good performance by periodically &amp;#x27;breaking out&amp;#x27; of exploitation, but less and less: https://arxiv.org/abs/1711.07979 (I expect that you can come up with an infinite hierarchy of &amp;#x27;wake ups&amp;#x27; which converge to a fixed overhead and which aren&amp;#x27;t terribly far off an optimal schedule of replanning wake-ups, and that something like &amp;#x27;great thoughts Friday&amp;#x27; is the first step; then you&amp;#x27;d have &amp;#x27;great thoughts first-of-the-month&amp;#x27; and &amp;#x27;great thoughts…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1711.07979/"&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>
