<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0805.3415/</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/0805.3415/feed.xml" rel="self" type="application/rss+xml" /><item><title>On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems — mentioned by noelwelsh</title><link>https://news.ycombinator.com/item?id=4042549</link><guid isPermaLink="false">urn:hackerpapers:mention:0805.3415:4042549</guid><pubDate>Wed, 30 May 2012 12:54:37 GMT</pubDate><description>&lt;p&gt;So Ben, looks like it&amp;#x27;s time to cross swords again :) 1. Real world performance varies over time... I don&amp;#x27;t really understand this complaint. With A/B testing, you have to collect enough data before making a decision that the conversion rate fluctuations average out. If you&amp;#x27;re worried about monthly fluctuations (which is reasonable), and you&amp;#x27;re doing A/B testing, you need to collect data for a few months. This means months where you aren&amp;#x27;t optimising. With a bandit algorithm conversion rate fluctuations will cause changes in the bandit behaviour, but they will average out over time just like…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0805.3415/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.ST</category></item></channel></rss>
