Wush Wu
ABSTRACT
We generalize the winning price model to incorporate the deep learning models with different distributions and propose an algorithm to learn from the historical bidding information, where the winning price are either observed or partially observed. We study if the successful deep learning models of the click-through rate can enhance the prediction of the winning price or not. We also study how different distributions of winning price can affect the learning results. Experiment results show that the deep learning models indeed boost the prediction quality when they are learned on the historical observed data. In addition, the deep learning models on the unobserved data are improved after learning from the censored data. The main advantage of the proposed generalized deep learning model is to provide more flexibility to model the winning price and improve the performance in consideration of the possibly various winning price distributions and various model structures in practice.
- James Bergstra and Yoshua Bengio. 2012. Random Search for Hyper-parameter Optimization. J. Mach. Learn. Res. 13 (Feb. 2012), 281--305. http://dl.acm.org/ citation.cfm?id=2188385.2188395 Google Scholar
Digital Library
- Richard H. Byrd, Peihuang Lu, Jorge Nocedal, and Ciyou Zhu. 1995. A Limited Memory Algorithm for Bound Constrained Optimization. SIAM J. Sci. Comput. 16, 5 (Sept. 1995), 1190--1208. Google ScholarDigital Library
- Tianqi Chen and Carlos Guestrin. 2016. XGBoost: A Scalable Tree Boosting System. In Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '16). ACM, New York, NY, USA, 785--794. Google ScholarDigital Library
- Heng-Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, Rohan Anil, Zakaria Haque, Lichan Hong, Vihan Jain, Xiaobing Liu, and Hemal Shah. 2016. Wide &Deep Learning for Recommender Systems. In Proceedings of the 1st Workshop on Deep Learning for Recommender Systems (DLRS). ACM, New York, NY, USA, 7--10. Google ScholarDigital Library
- Ying Cui, Ruofei Zhang,Wei Li, and Jianchang Mao. 2011. Bid Landscape Forecasting in Online Ad Exchange Marketplace. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '11). ACM, New York, NY, USA, 265--273. Google ScholarDigital Library
- Jerome Friedman, Trevor Hastie, and Robert Tibshirani. 2010. Regularization Paths for Generalized Linear Models via Coordinate Descent. Journal of Statistical Software 33, 1 (2010), 1--22. http://www.jstatsoft.org/v33/i01/Google ScholarCross Ref
- E. J. Gumbel. 1958. Statistics of extremes. Columbia University Press, New York (1958).Google ScholarCross Ref
- Chi-Chun Lin, Kun-Ta Chuang, Wush Chi-Hsuan Wu, and Ming-Syan Chen. 2016. Combining Powers of Two Predictors in Optimizing Real-Time Bidding Strategy Under Constrained Budget. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management (CIKM '16). ACM, New York, NY, USA, 2143--2148. Google ScholarDigital Library
- RuoxiWang, Bin Fu, Gang Fu, and MingliangWang. 2017. Deep &Cross Network for Ad Click Predictions. In Proceedings of the ADKDD'17 (ADKDD). ACM, New York, NY, USA, Article 12, 7 pages. Google ScholarDigital Library
- YuchenWang, Kan Ren,Weinan Zhang, JunWang, and Yong Yu. 2016. Functional Bid Landscape Forecasting for Display Advertising.. In ECML/PKDD (1) (Lecture Notes in Computer Science), Paolo Frasconi, Niels Landwehr, Giuseppe Manco, and Jilles Vreeken (Eds.), Vol. 9851. Springer, 115--131.Google Scholar
- Wush Chi-Hsuan Wu, Mi-Yen Yeh, and Ming-Syan Chen. 2015. Predicting Winning Price in Real Time Bidding with Censored Data. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '15). ACM, New York, NY, USA, 1305--1314. Google ScholarDigital Library
- Matthew D. Zeiler. 2012. ADADELTA: An Adaptive Learning Rate Method. CoRR abs/1212.5701 (2012). http://dblp.uni-trier.de/db/journals/corr/corr1212.html# abs-1212--5701Google Scholar
- Weinan Zhang, Shuai Yuan, and Jun Wang. 2014. Optimal Real-time Bidding for Display Advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '14). ACM, New York, NY, USA, 1077--1086. Google ScholarDigital Library
- Weinan Zhang, Shuai Yuan, Jun Wang, and Xuehua Shen. 2014. Real-Time Bidding Benchmarking with iPinYou Dataset. arXiv preprint arXiv:1407.7073Google Scholar
Index Terms
- Deep Censored Learning of the Winning Price in the Real Time Bidding
Recommendations
An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data MiningSince 2019, most ad exchanges and sell-side platforms (SSPs), in the online advertising industry, shifted from second to first price auctions. Due to the fundamental difference between these auctions, demand-side platforms (DSPs) have had to update ...
Deep Landscape Forecasting for Real-time Bidding Advertising
KDD '19: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningThe emergence of real-time auction in online advertising has drawn huge attention of modeling the market competition, i.e., bid landscape forecasting. The problem is formulated as to forecast the probability distribution of market price for each ad ...
Optimal real-time bidding for display advertising
KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data miningIn this paper we study bid optimisation for real-time bidding (RTB) based display advertising. RTB allows advertisers to bid on a display ad impression in real time when it is being generated. It goes beyond contextual advertising by motivating the ...
Comments