The DOI matches its Crossref record; 20 of the 22 references it cites were found in a registry or an index.
Automatic ad format selection via contextual bandits
Abstract
Visual design plays an important role in online display advertising: changing the layout of an online ad can increase or decrease its effectiveness, measured in terms of click-through rate (CTR) or total revenue. The decision of which lay- out to use for an ad involves a trade-off: using a layout provides feedback about its effectiveness (exploration), but collecting that feedback requires sacrificing the immediate reward of using a layout we already know is effective (exploitation). To balance exploration with exploitation, we pose automatic layout selection as a contextual bandit problem. There are many bandit algorithms, each generating a policy which must be evaluated. It is impractical to test each policy on live traffic. However, we have found that offline replay (a.k.a. exploration scavenging) can be adapted to provide an accurate estimator for the performance of ad layout policies at Linkedin, using only historical data about the effectiveness of layouts. We describe the development of our offline replayer, and benchmark a number of common bandit algorithms.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Such a model has been applied previously to ad layout optimization [19].”
From An Efficient Bandit Algorithm for Realtime Multivariate Optimization (2017) · cites this paper as [19]
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 25,268
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 16,043
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
Edelman, B., Ostrovsky, M., & Schwarz, M. H. (2007) · American Economic Review · doi:10.1257/aer.97.1.242 · Cited by 1,780
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
(2011) · Cited by 1,000
McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E. V., Golovin, D., et al. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2488200 · Cited by 870
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Audibert, J.-Y., Munos, R., & Szepesvári, C. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.016 · Cited by 599
Multi-armed Bandit Algorithms and Empirical Evaluation
Vermorel, J., & Mohri, M. (2005) · Lecture notes in computer science · doi:10.1007/11564096_42 · Cited by 535
Research works printed but not linked: 2
- B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review, 99(2):430--434, 2009.
- 10.5555/2898607.2898800 · DOI
Cited by
Sorted by citations
Items 101–112 of 112
An asymptotically optimal solution for contextual bandit problem in adversarial setting
Neyshabouri, M. M. (2018) · Bilkent University Institutional Repository (Bilkent University)
A contextual bandit algorithm for ad creative under ad fatiguePreprint
Moriwaki, D., FUJITA, K., Yasui, S., & Hoshino, T. (2019) · arXiv (Cornell University)
Ad Creative Discontinuation Prediction with Multi-Modal Multi-Task Neural Survival Networks
Kitada, S., Iyatomi, H., & Seki, Y. (2022) · Applied Sciences · doi:10.3390/app12073594
The Stochastic Multi-Armed Bandit Problem
Agrawal, S. (2022) · Springer series in supply chain management · doi:10.1007/978-3-031-01926-5_1
Sequential Experimentation and Learning
Kruijswijk, J., van Emden, R., & Kaptein, M. C. (2023) · Classroom companion: business · doi:10.1007/978-3-031-19554-9_8
den Hengst, F. (2023) · doi:10.5463/thesis.390
Measuring the harms of personalization through advertising
Ali, M. (2023) · Digital Repository Service (Northeastern University) · doi:10.17760/d20620606
Optimizing Click-Through Rates in Online Advertising Using Thompson Sampling
Zhao, B. (2025) · ITM Web of Conferences · doi:10.1051/itmconf/20257301012
Minimax off-policy evaluation and learning with subgaussian and differentiable importance weighting
Metelli, A. M., Russo, A., & Restelli, M. (2025) · Artificial Intelligence · doi:10.1016/j.artint.2025.104419
Sequential learning and stochastic optimization of convex functions
Fontaine, X. (2020) · theses.fr (ABES) · doi:10.70675/786fbdf9zb71az4f87zbdfeze2277d9f1a6c
Adaptive Exploration for Latent-State Bandits
Jin, J., Hung, K. E., Krishnamurthy, S. K., Shi, B., & Zhang, C. (2026) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3770855.3817882
Metadata
- Authors
- Tang, L., Rosales, R., Singh, A., & Agarwal, D.
- Affiliations
- Florida International University (US)
- LinkedIn (United States) (US)
- Venue
- Proceedings of the 22nd ACM international conference on Information & Knowledge Management
- Publisher
- ACM
- Published
- 2013-10-27
- Pages
- 1587-1594
- ISSN
- 2155-0751 (ISSN-L)
- OpenAlex
- W2092092836
- Cited by
- 111
- References
- 22
- Citations by year
- 2026: 3 · 2025: 4 · 2024: 5 · 2023: 8 · 2022: 5 · 2021: 15 · 2020: 17 · 2019: 15 · 2018: 8 · 2017: 7 · 2016: 9 · 2015: 11 · 2014: 4
- FWCI
- 13.52
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- ACM International Conference on Information and Knowledge Management (CIKM) (publishedVersion)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Keywords
- contextual bandits, online display advertising, exploration-exploitation balance, click-through rate, advertising revenue, LinkedIn
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
