Improved Online Learning Algorithms for CTR Prediction in Ad Auctions (2403.00845v1)
Abstract: In this work, we investigate the online learning problem of revenue maximization in ad auctions, where the seller needs to learn the click-through rates (CTRs) of each ad candidate and charge the price of the winner through a pay-per-click manner. We focus on two models of the advertisers' strategic behaviors. First, we assume that the advertiser is completely myopic; i.e.~in each round, they aim to maximize their utility only for the current round. In this setting, we develop an online mechanism based on upper-confidence bounds that achieves a tight $O(\sqrt{T})$ regret in the worst-case and negative regret when the values are static across all the auctions and there is a gap between the highest expected value (i.e.~value multiplied by their CTR) and second highest expected value ad. Next, we assume that the advertiser is non-myopic and cares about their long term utility. This setting is much more complex since an advertiser is incentivized to influence the mechanism by bidding strategically in earlier rounds. In this setting, we provide an algorithm to achieve negative regret for the static valuation setting (with a positive gap), which is in sharp contrast with the prior work that shows $O(T{2/3})$ regret when the valuation is generated by adversary.
- Truthful auctions for pricing search keywords. In Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 1–7, 2006.
- Finite-time analysis of the multiarmed bandit problem. Machine learning, 47(2):235–256, 2002.
- Characterizing truthful multi-armed bandit mechanisms. SIAM Journal on Computing, 43(1):194–230, 2014.
- Truthful mechanisms with implicit payment computation. J. ACM, 62(2), may 2015.
- In Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems, 2012.
- Deep CTR prediction in display advertising. In Proceedings of the 24th ACM International Conference on Multimedia, pp. 811–820, 2016.
- Wide & deep learning for recommender systems. In Proceedings of the 1st workshop on deep learning for recommender systems, pp. 7–10, 2016.
- The price of truthfulness for pay-per-click auctions. In Proceedings of the 10th ACM Conference on Electronic Commerce, EC ’09, pp. 99–106, 2009.
- Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American economic review, 97(1):242–259, 2007.
- Incentivizing combinatorial bandit exploration, 2022.
- Field-aware factorization machines in a real-world online advertising system. In Proceedings of the 26th International Conference on World Wide Web Companion, pp. 680–688, 2017.
- xdeepfm: Combining explicit and implicit feature interactions for recommender systems. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 1754–1763, 2018.
- Bayesian incentive-compatible bandit exploration. Oper. Res., 68(4):1132–1161, 2020.
- Ad click prediction: a view from the trenches. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1222–1230, 2013.
- Myerson, R. B. Optimal auction design. Mathematics of operations research, 6(1):58–73, 1981.
- Product-based neural networks for user response prediction. In 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 1149–1154. IEEE, 2016.
- The price of incentivizing exploration: A characterization via thompson sampling and sample complexity. In Proceedings of the 22nd ACM Conference on Economics and Computation, EC ’21, pp. 795–796, New York, NY, USA, 2021. Association for Computing Machinery. ISBN 9781450385541.
- Exploration and incentives in reinforcement learning, 2021.
- Varian, H. R. Position auctions. International Journal of Industrial Organization, 25(6):1163–1178, December 2007.
- Deep learning over multi-field categorical data. In European conference on information retrieval, pp. 45–57. Springer, 2016.
- Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp. 1059–1068, 2018.
- Zhe Feng (53 papers)
- Christopher Liaw (23 papers)
- Zixin Zhou (8 papers)