pith. sign in

arxiv: 1908.06256 · v2 · pith:JCKAPWCFnew · submitted 2019-08-17 · 💻 cs.LG · stat.ML

A Batched Multi-Armed Bandit Approach to News Headline Testing

classification 💻 cs.LG stat.ML
keywords headlinetestingheadlinesmethodnewstrafficallocateapproach
0
0 comments X
read the original abstract

Optimizing news headlines is important for publishers and media sites. A compelling headline will increase readership, user engagement and social shares. At Yahoo Front Page, headline testing is carried out using a test-rollout strategy: we first allocate equal proportion of the traffic to each headline variation for a defined testing period, and then shift all future traffic to the best-performing variation. In this paper, we introduce a multi-armed bandit (MAB) approach with batched Thompson Sampling (bTS) to dynamically test headlines for news articles. This method is able to gradually allocate traffic towards optimal headlines while testing. We evaluate the bTS method based on empirical impressions/clicks data and simulated user responses. The result shows that the bTS method is robust, converges accurately and quickly to the optimal headline, and outperforms the test-rollout strategy by 3.69% in terms of clicks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits

    cs.LG 2026-05 unverdicted novelty 6.0

    Formalizes regret minimization with free exploration, introduces (α,β)-probably saving policies and UFE-KLUCB-H algorithm, and proves instance-dependent regret savings with upper and lower bounds in the logarithmic bu...