Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3437963.3441727acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article
Open access

DeepLight: Deep Lightweight Feature Interactions for Accelerating CTR Predictions in Ad Serving

Published: 08 March 2021 Publication History

Abstract

Click-through rate (CTR) prediction is a crucial task in recommender systems and online advertising. The embedding-based neural networks have been proposed to learn both explicit feature interactions through a shallow component and deep feature interactions by a deep neural network (DNN) component. These sophisticated models, however, slow down the prediction inference by at least hundreds of times. To address the issue of significantly increased serving latency and high memory usage for real-time serving in production, this paper presents DeepLight: a framework to accelerate the CTR predictions in three aspects: 1) accelerate the model inference via explicitly searching informative feature interactions in the shallow component; 2) prune redundant parameters at the inter-layer level in the DNN component; 3) prune the dense embedding vectors to make them sparse in the embedding matrix. By combining the above efforts, the proposed approach accelerates the model inference by 46X on Criteo dataset and 27X on Avazu dataset without any loss on the prediction accuracy. This paves the way for successfully deploying complicated embedding-based neural networks in real-world serving systems.

References

[1]
Mathieu Blondel, Akinori Fujino, Naonori Ueda, and Masakazu Ishihata. 2016. Higher-Order Factorization Machines. In NIPS'16.
[2]
Interactive Advertising Bureau. 2020. IAB internet advertising revenue report. In Iab Pwc. 1--32.
[3]
Wenqiang Chen, Lizhang Zhan, Yuanlong Ci, and Chen Lin. 2020. FLEN: Leveraging Field for Scalable CTR Prediction. In KDD'20 DLP workshop.
[4]
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. (2016). arxiv: 1606.07792
[5]
Matthieu Courbariaux and Yoshua Bengio. 2016. BinaryNet: Training Deep Neural Networks with Weights and Activations Constrained to +1 or -1. CoRR.
[6]
Abhimanyu Das and David Kempe. 2011. Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection. In ICML'11.
[7]
Wei Deng, Xiao Zhang, Faming Liang, and Guang Lin. 2019. An Adaptive Empirical Bayesian Method for Sparse Deep Learning. In NeurIPS'19.
[8]
Jonathan Frankle and Michael Carbin. 2019. The lottery ticket hypothesis: Finding sparse, trainable neural networks. ICLR'19.
[9]
Thore Graepel, Joaquin Quiñonero Candela, Thomas Borchert, and Ralf Herbrich. 2010. Web-scale Bayesian Click-through Rate Prediction for Sponsored Search Advertising in Microsoft's Bing Search Engine. In ICML'10.
[10]
Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. 2017. DeepFM: A Factorization-Machine based Neural Network for CTR Prediction. In IJCAI-17.
[11]
Song Han, Huizi Mao, and William J. Dally. 2016. Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding. In ICLR'16.
[12]
Song Han, Jeff Pool, John Tran, and William Dally. 2015. Learning both weights and connections for efficient neural network. In NIPS'15.
[13]
Xiangnan He and Tat-Seng Chua. 2017. Neural Factorization Machines for Sparse Predictive Analytics. In SIGIR'17.
[14]
Xinran He, Junfeng Pan, Ou Jin, Tianbing Xu, Bo Liu, Tao Xu, Yanxin Shi, Antoine Atallah, Ralf Herbrich, Stuart Bowers, and Joaquin Quinonero Candela. 2014. Practical Lessons from Predicting Clicks on Ads at Facebook. In ADKDD'14.
[15]
Geoffrey Hinton, Oriol Vinyals, and Jeffrey Dean. 2015. Distilling the Knowledge in a Neural Network. In NIPS Deep Learning and RL Workshop.
[16]
Yuchin Juan, Yong Zhuang, Wei-Sheng Chin, and Chih-Jen Lin. 2016. Field-aware Factorization Machines for CTR Prediction. In RecSys'16.
[17]
Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. In ICLR'15.
[18]
Criteo Labs. 2014. Display Advertising Challenge. In Kaggle.
[19]
Chunyuan Li, Changyou Chen, David Carlson, and Lawrence Carin. 2016. Preconditioned Stochastic Gradient Langevin Dynamics for Deep Neural Networks. In AAAI'16.
[20]
Dawei Li, Xiaolong Wang, and Deguang Kong. 2018. DeepRebirth: Accelerating Deep Neural Network Execution on Mobile Devices. In AAAI'18.
[21]
Hao Li, Asim Kadav, Igor Durdanovic, Hanan Samet, and Hans Peter Graf. 2017. Pruning Filters for Efficient ConvNets. In ICLR'17.
[22]
Jianxun Lian, Xiaohuan Zhou, Fuzheng Zhang, Zhongxia Chen, Xing Xie, and Guangzhong Sun. 2018. xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems. KDD'18.
[23]
Bin Liu, Chenxu Zhu, Guilin Li, Weinan Zhang, Jincai Lai, Ruiming Tang, Xiuqiang He, Zhenguo Li, and Yong Yu. 2020. AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction. In KDD'20.
[24]
Yuanfei Luo, Mengshuo Wang, Hao Zhou, Quanming Yao, Wei-Wei Tu, Yuqiang Chen, Qiang Yang, and Wenyuan Dai. 2019. AutoCross: Automatic Feature Crossing for Tabular Data in Real-World Applications. In KDD'19.
[25]
Lester Mackey, Ameet Talwalkar, and Michael I. Jordan. 2015. Distributed Matrix Completion and Robust Factorization. JMLR'15, Vol. 16 (2015), 913--960.
[26]
H. Brendan McMahan, Gary Holt, D. Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, Sharat Chikkerur, Dan Liu, Martin Wattenberg, Arnar Mar Hrafnkelsson, Tom Boulos, and Jeremy Kubica. 2013. Ad Click Prediction: a View from the Trenches. In KDD'13.
[27]
Junwei Pan, Yizhi Mao, Alfonso Lobos Ruiz, Yu Sun, and Aaron Flores. 2019. Predicting different types of conversions with multi-task learning in online advertising. In KDD'19.
[28]
Junwei Pan, Jian Xu, Alfonso Lobos Ruiz, Wenliang Zhao, Shengjun Pan, Yu Sun, and Quan Lu. 2018. Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising. In WWW'18.
[29]
Yanru Qu, Han Cai, Kan Ren, Weinan Zhang, Yong Yu, Ying Wen, and Jun Wang. 2016. Product-based Neural Networks for User Response Prediction. CoRR (2016).
[30]
Steffen Rendle. 2010. Factorization Machines. In ICDM'10.
[31]
Ying Shan, T. Ryan Hoens, Jian Jiao, Haijing Wang, Dong Yu, and JC Mao. 2016. Deep Crossing: Web-Scale Modeling Without Manually Crafted Combinatorial Features. In KDD'16.
[32]
Benyah Shaparenko, Ozgur Cetin, and Rukmini Iyer. 2009. Data-driven Text Features for Sponsored Search Click Prediction. In ADKDD'09.
[33]
Weiping Song, Chence Shi, Zhiping Xiao, Zhijian Duan, Yewen Xu, Ming Zhang, and Jian Tang. 2019. AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks. CIKM'19.
[34]
Ruoxi Wang, Bin Fu, Gang Fu, and Mingliang Wang. 2017. Deep & Cross Network for Ad Click Predictions. arxiv: 1708.05123
[35]
Taifeng Wang, Jiang Bian, Shusen Liu, Yuyu Zhang, and Tie-Yan Liu. 2013. Psychological Advertising: Exploring User Psychology for Click Prediction in Sponsored Search. KDD'13.
[36]
Wei Wen, Chunpeng Wu, Yandan Wang, Yiran Chen, and Hai Li. 2016. Learning Structured Sparsity in Deep Neural Networks. In NIPS'16.
[37]
Mao Ye, Chengyue Gong, Lizhen Nie, Denny Zhou, Adam Klivans, and Qiang Liu. 2020 a. Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection. In ICML'20.
[38]
Mao Ye, Lemeng Wu, and Qiang Liu. 2020 b. Greedy Optimization Provably Wins the Lottery: Logarithmic Number of Winning Tickets is Enough. In NeurIPS'20.
[39]
Guorui Zhou, Xiaoqiang Zhu, Chengru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2014. Deep Interest Network for Click-Through Rate Prediction. In KDD'14.

Cited By

View all
  • (2024)Cross Feature Engineering for Anti-Fraud Task in InsuranceArtificial Intelligence and Robotics Research10.12677/AIRR.2024.13204813:02(467-477)Online publication date: 2024
  • (2024)A case for server-scale photonic connectivityProceedings of the 23rd ACM Workshop on Hot Topics in Networks10.1145/3696348.3696856(290-299)Online publication date: 18-Nov-2024
  • (2024)CETN: Contrast-enhanced Through Network for Click-Through Rate PredictionACM Transactions on Information Systems10.1145/368857143:1(1-34)Online publication date: 12-Aug-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
WSDM '21: Proceedings of the 14th ACM International Conference on Web Search and Data Mining
March 2021
1192 pages
ISBN:9781450382977
DOI:10.1145/3437963
This work is licensed under a Creative Commons Attribution International 4.0 License.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 March 2021

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. ad serving
  2. deep acceleration
  3. fast inference
  4. lightweight models
  5. low memory
  6. preconditioner
  7. structural pruning

Qualifiers

  • Research-article

Conference

WSDM '21

Acceptance Rates

Overall Acceptance Rate 498 of 2,863 submissions, 17%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)371
  • Downloads (Last 6 weeks)45
Reflects downloads up to 25 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Cross Feature Engineering for Anti-Fraud Task in InsuranceArtificial Intelligence and Robotics Research10.12677/AIRR.2024.13204813:02(467-477)Online publication date: 2024
  • (2024)A case for server-scale photonic connectivityProceedings of the 23rd ACM Workshop on Hot Topics in Networks10.1145/3696348.3696856(290-299)Online publication date: 18-Nov-2024
  • (2024)CETN: Contrast-enhanced Through Network for Click-Through Rate PredictionACM Transactions on Information Systems10.1145/368857143:1(1-34)Online publication date: 12-Aug-2024
  • (2024)AdaGIN: Adaptive Graph Interaction Network for Click-Through Rate PredictionACM Transactions on Information Systems10.1145/368178543:1(1-31)Online publication date: 4-Nov-2024
  • (2024)SimCEN: Simple Contrast-enhanced Network for CTR PredictionProceedings of the 32nd ACM International Conference on Multimedia10.1145/3664647.3681203(2311-2320)Online publication date: 28-Oct-2024
  • (2024)Rethinking Machine Learning Collective Communication as a Multi-Commodity Flow ProblemProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672249(16-37)Online publication date: 4-Aug-2024
  • (2024)Low Rank Field-Weighted Factorization Machines for Low Latency Item RecommendationProceedings of the 18th ACM Conference on Recommender Systems10.1145/3640457.3688097(238-246)Online publication date: 8-Oct-2024
  • (2024)CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation ModelsProceedings of the ACM on Management of Data10.1145/36393062:1(1-28)Online publication date: 26-Mar-2024
  • (2024)MIFI: Combining Multi-Interest Activation and Implicit Feature Interaction for CTR PredictionsIEEE Transactions on Computational Social Systems10.1109/TCSS.2023.331362211:2(2889-2900)Online publication date: Apr-2024
  • (2024)PeNet: A feature excitation learning approach to advertisement click-through rate predictionNeural Networks10.1016/j.neunet.2024.106127172(106127)Online publication date: Apr-2024
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media