paper-with-me

홈 › Papers

Online and Scalable Model Selection with Multi-Armed Bandits

2021-01-25 · Jiayi Xie, Michael Tashman, John Hoffman, Lee Winikor, Rouzbeh Gerami

Many online applications running on live traffic are powered by machine learning models, for which training, validation, and hyper-parameter tuning are conducted on historical data. However, it is common for models demonstrating strong performance in offline analysis to yield poorer performance when deployed online. This problem is a consequence of the difficulty of training on historical data in non-stationary environments. Moreover, the machine learning metrics used for model selection may not sufficiently correlate with real-world business metrics used to determine the success of the applications being tested. These problems are particularly prominent in the Real-Time Bidding (RTB) domain, in which ML models power bidding strategies, and a change in models will likely affect performance of the advertising campaigns. In this work, we present Automatic Model Selector (AMS), a system for scalable online selection of RTB bidding strategies based on real-world performance metrics. AMS employs Multi-Armed Bandits (MAB) to near-simultaneously run and evaluate multiple models against live traffic, allocating the most traffic to the best-performing models while decreasing traffic to those with poorer online performance, thereby minimizing the impact of inferior models on overall campaign performance. The reliance on offline data is avoided, instead making model selections on a case-by-case basis according to actionable business goals. AMS allows new models to be safely introduced into live campaigns as soon as they are developed, minimizing the risk to overall performance. In live-traffic tests on multiple ad campaigns, the AMS system proved highly effective at improving ad campaign performance.

📄 PDF Abstract BibTeX arXiv:2101.10385

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningModel SelectionMulti-Armed Bandits

Similar Papers 제목 키워드 기반

Adapting multi-armed bandits policies to contextual bandits scenarios

2018-11-11 · David Cortes

This work explores adaptations of successful multi-armed bandits policies to the online contextual bandits scenario with binary rewards using binary classification algorithms such as logistic regression as black-box orac…

Binary ClassificationClassificationGeneral ClassificationMulti-Armed Bandits+2

Contextual Restless Multi-Armed Bandits with Application to Demand Response Decision-Making

2024-03-22 · Xin Chen, I-Hong Hou

This paper introduces a novel multi-armed bandits framework, termed Contextual Restless Bandits (CRB), for complex online decision-making. This CRB framework incorporates the core features of contextual bandits and restl…

Decision MakingMulti-Armed Bandits

Generalized Translation and Scale Invariant Online Algorithm for Adversarial Multi-Armed Bandits

2021-09-19 · Kaan Gokcesu, Hakan Gokcesu

We study the adversarial multi-armed bandit problem and create a completely online algorithmic framework that is invariant under arbitrary translations and scales of the arm losses. We study the expected performance of o…

Multi-Armed BanditsTranslation

Evolutionary Multi-Armed Bandits with Genetic Thompson Sampling

2022-04-26 · Baihan Lin

As two popular schools of machine learning, online learning and evolutionary computations have become two important driving forces behind real-world decision making engines for applications in biomedicine, economics, and…

Decision MakingEvolutionary AlgorithmsMulti-Armed BanditsSequential Decision Making+1

Rising Rested Bandits: Lower Bounds and Efficient Algorithms

2024-11-06 · Marco Fiandri, Alberto Maria Metelli, Francesco Trov`o

This paper is in the field of stochastic Multi-Armed Bandits (MABs), i.e. those sequential selection techniques able to learn online using only the feedback given by the chosen option (a.k.a. $arm$). We study a particula…

Model SelectionMulti-Armed Bandits