<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Adapting multi-armed bandits policies to contextual bandits scenarios · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1811.04383/</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/1811.04383/feed.xml" rel="self" type="application/rss+xml" /><item><title>Adapting multi-armed bandits policies to contextual bandits scenarios — mentioned by abhgh</title><link>https://news.ycombinator.com/item?id=38749657</link><guid isPermaLink="false">urn:hackerpapers:mention:1811.04383:38749657</guid><pubDate>Sun, 24 Dec 2023 00:15:55 GMT</pubDate><description>&lt;p&gt;Beta-Bernoulli multi-armed bandits (BB-MAB) are definitely a good way to get started on a Bayesian version of A/B testing where you&amp;#x27;ve the additional benefit that your population is dynamically allocated to the most performant option (actually this dynamic allocation makes it similar to interim analysis [1] rather than vanilla A/B testing). There are some caveats though - and I mention these from the experience of running such solutions on a large scale in production. First, BB-MAB can&amp;#x27;t adapt to context by design. They only look at click/no-click behavior across the population. So, if your…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1811.04383/"&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>
