Safe Online Bid Optimization with Return-On-Investment and Budget Constraints subject to Uncertainty

01/18/2022
by   Matteo Castiglioni, et al.
0

In online marketing, the advertisers' goal is usually a tradeoff between achieving high volumes and high profitability. The companies' business units customarily address this tradeoff by maximizing the volumes while guaranteeing a lower bound to the Return On Investment (ROI). This paper investigates combinatorial bandit algorithms for the bid optimization of advertising campaigns subject to uncertain budget and ROI constraints. We study the nature of both the optimization and learning problems. In particular, when focusing on the optimization problem without uncertainty, we show that it is inapproximable within any factor unless P=NP, and we provide a pseudo-polynomial-time algorithm that achieves an optimal solution. When considering uncertainty, we prove that no online learning algorithm can violate the (ROI or budget) constraints during the learning process a sublinear number of times while guaranteeing a sublinear pseudo-regret. Thus, we provide an algorithm, namely GCB, guaranteeing sublinear regret at the cost of a potentially linear number of constraints violations. We also design its safe version, namely GCB_safe, guaranteeing w.h.p. a constant upper bound on the number of constraints violations at the cost of a linear pseudo-regret. More interestingly, we provide an algorithm, namely GCB_safe(ψ,ϕ), guaranteeing both sublinear pseudo-regret and safety w.h.p. at the cost of accepting tolerances ψand ϕin the satisfaction of the ROI and budget constraints, respectively. This algorithm actually mitigates the risks due to the constraints violations without precluding the convergence to the optimal solution. Finally, we experimentally compare our algorithms in terms of pseudo-regret/constraint-violation tradeoff in settings generated from real-world data, showing the importance of adopting safety constraints in practice and the effectiveness of our algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2023

The Impact of the Geometric Properties of the Constraint Set in Safe Optimization with Bandit Feedback

We consider a safe optimization problem with bandit feedback in which an...
research
10/31/2021

Safe Adaptive Learning-based Control for Constrained Linear Quadratic Regulators with Regret Guarantees

We study the adaptive control of an unknown linear system with a quadrat...
research
02/16/2023

Joint Feedback Loop for Spend and Return-On-Spend Constraints

Budget pacing is a popular service that has been offered by major intern...
research
08/29/2022

Online Bidding Algorithms for Return-on-Spend Constrained Advertisers

Online advertising has recently grown into a highly competitive and comp...
research
01/30/2019

Minimal Investment Risk with Cost and Return Constraints: A Replica Analysis

Previous studies into the budget constraint of portfolio optimization pr...
research
03/04/2015

Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints

We study online prediction where regret of the algorithm is measured aga...
research
07/16/2021

Bidding and Pricing in Budget and ROI Constrained Markets

In online advertising markets, setting budget and return on investment (...

Please sign up or login with your details

Forgot password? Click here to reset