Calibration Matters: Tackling Maximization Bias in Large-scale Advertising Recommendation Systems
This addresses a critical issue for advertisers and platforms in online advertising by improving calibration accuracy, though it is incremental as it builds on existing methods to solve a specific bias problem.
The paper tackles the problem of maximization bias in calibration for large-scale advertising recommendation systems, which overestimates true click rates and affects ad auction bids, and proposes a variance-adjusting debiasing algorithm that mitigates this bias without additional online costs or ranking performance loss, demonstrating effectiveness on a real-world dataset.
Calibration is defined as the ratio of the average predicted click rate to the true click rate. The optimization of calibration is essential to many online advertising recommendation systems because it directly affects the downstream bids in ads auctions and the amount of money charged to advertisers. Despite its importance, calibration optimization often suffers from a problem called "maximization bias". Maximization bias refers to the phenomenon that the maximum of predicted values overestimates the true maximum. The problem is introduced because the calibration is computed on the set selected by the prediction model itself. It persists even if unbiased predictions can be achieved on every datapoint and worsens when covariate shifts exist between the training and test sets. To mitigate this problem, we theorize the quantification of maximization bias and propose a variance-adjusting debiasing (VAD) meta-algorithm in this paper. The algorithm is efficient, robust, and practical as it is able to mitigate maximization bias problems under covariate shifts, neither incurring additional online serving costs nor compromising the ranking performance. We demonstrate the effectiveness of the proposed algorithm using a state-of-the-art recommendation neural network model on a large-scale real-world dataset.