Papers › Unbiased Offline Evaluation of Contextual-bandit-based News Article Recommendation Algorithms

Unbiased Offline Evaluation of Contextual-bandit-based News Article Recommendation Algorithms

31 Mar 2010arXiv:1003.5956archive 2025-07-28

Lihong Li, Wei Chu, John Langford, Xuanhui Wang

Contextual bandit algorithms have become popular for online recommendation systems such as Digg, Yahoo! Buzz, and news recommendation in general. Offline evaluation of the effectiveness of new algorithms in these applications is critical for protecting online user experiences but very challenging due to their "partial-label" nature. Common practice is to create a simulator which simulates the online environment for the problem at hand and then run an algorithm against this simulator. However, creating simulator itself is often difficult and modeling bias is usually unavoidably introduced. In this paper, we introduce a replay methodology for contextual bandit algorithm evaluation. Different from simulator-based approaches, our method is completely data-driven and very easy to adapt to different applications. More importantly, our method can provide provably unbiased evaluations. Our empirical results on a large-scale news article recommendation dataset collected from Yahoo! Front Page conform well with our theoretical results. Furthermore, comparisons between our offline replay and online bucket evaluation of several contextual bandit algorithms show accuracy and effectiveness of our offline evaluation method.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Andy-TK/COMP90051_Project1 mentioned on GitHubtfSyntology: not harvested report
antoine-hochart/bandit_algo_evaluation mentioned on GitHubSyntology: not harvested report
antonismand/Personalized-News-Recommendation mentioned on GitHubSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A Contextual-Bandit Approach to Personalized News Article Recommendation (arXiv:1003.0146; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result); nothing checks that they implement this paper's method. report
danilprov/batch-bandits mentioned on GitHubSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A Contextual-Bandit Approach to Personalized News Article Recommendation (arXiv:1003.0146; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result); nothing checks that they implement this paper's method. report
PlaytikaOSS/pybandits NOASSERTIONSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

News RecommendationRecommendation Systems

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections