The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Ad click prediction: a view from the trenches
Open accessAbstract
Predicting ad click-through rates (CTR) is a massive-scale learning problem that is central to the multi-billion dollar online advertising industry. We present a selection of case studies and topics drawn from recent experiments in the setting of a deployed CTR prediction system. These include improvements in the context of traditional supervised learning based on an FTRL-Proximal online learning algorithm (which has excellent sparsity and convergence properties) and the use of per-coordinate learning rates.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1990) · Choice Reviews Online · doi:10.5860/choice.27-3338 · Cited by 35,305
An introduction to ROC analysis
Fawcett, T. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.10.010 · Cited by 21,879
Hosmer, D. W., & Lemeshow, S. (2000) · doi:10.1002/0471722146 · Cited by 20,302
(2010) · Cited by 8,261
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Improving neural networks by preventing co-adaptation of feature detectors
Hinton, G. E., Srivastava, N., Krizhevsky, A., Sutskever, I., & Salakhutdinov, R. R. (2012) · arXiv · doi:10.48550/arxiv.1207.0580 · Cited by 6,382
Large Scale Distributed Deep Networks
Dean, J. B., Corrado, G. S., Monga, R., Chen, K., Devin, M., Mao, M., Ranzato, M., Senior, A., Tucker, P. A., Yang, K., et al. (2012) · neural information processing systems · Cited by 4,489
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
Advances in Neural Information Processing Systems 20
Bonilla, E. V., Chai, K. M. A., & Williams, C. K. I. (2008) · neural information processing systems · Cited by 2,846
Predicting good probabilities with supervised learning
Niculescu-Mizil, A., & Caruana, R. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102430 · Cited by 1,884
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
(2003) · Cited by 1,733
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
Feature hashing for large scale multitask learning
Weinberger, K., Dasgupta, A., Langford, J., Smola, A., & Attenberg, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553516 · Cited by 906
Dual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
(2010) · Cited by 444
Overlapping experiment infrastructure: more, better, faster experimentation
Tang, D., Agarwal, A., O'Brien, D., & Meyer, M. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835810 · Cited by 312
Scaling up machine learning: parallel and distributed approaches
Bekkerman, R., Bilenko, M., & Langford, J. (2011) · Proceedings of the 17th ACM SIGKDD International Conference Tutorials · doi:10.1145/2107736.2107740 · Cited by 282
Sample Selection Bias Correction Theory
Cortes, C., Mohri, M., Riley, M., & Rostamizadeh, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87987-9_8 · Cited by 272
Beating the hold-out: bounds for K-fold and progressive cross-validation
Blum, A., Kalai, A., & Langford, J. (1999) · Proceedings of the twelfth annual conference on Computational learning theory · doi:10.1145/307400.307439 · Cited by 265
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization
McMahan, H. B. (2011) · International Conference on Artificial Intelligence and Statistics · Cited by 265
Self-citationAdaptive bound optimization for online convex optimization
McMahan, H. B., & Streeter, M. (2010) · arXiv · doi:10.48550/arxiv.1002.4908 · Cited by 227
Self-citationScaling up Machine Learning: Parallel and Distributed Approaches
(2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139042918 · Cited by 194
Sparse Online Learning via Truncated Gradient
Langford, J. C., Li, L., & Zhang, T. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.4686 · Cited by 184
Spatio-temporal models for estimating click-through rate
Agarwal, D., Chen, B.-C., & Elango, P. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526713 · Cited by 157
Photon: fault-tolerant and scalable joining of continuous data streams
Ananthanarayanan, R., Basker, V., Das, S. K., Gupta, A., Jiang, H., Qiu, T., Reznichenko, A., Ryabkov, D., Singh, M., & Venkataraman, S. (2013) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2463676.2465272 · Cited by 154
Efficient Learning using Forward-Backward Splitting
Singer, Y., & Duchi, J. C. (2009) · neural information processing systems · Cited by 116
Improving ad relevance in sponsored search
Hillard, D., Schroedl, S., Manavoglu, E., Raghavan, H., & Leggetter, C. (2010) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1718487.1718532 · Cited by 110
A novel click model and its applications to online advertising
Allen-Zhu, Z., Chen, W., Minka, T., Zhu, C., & Chen, Z. (2010) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1718487.1718528 · Cited by 102
Less Regret via Online ConditioningPreprint
Streeter, M., & McMahan, H. B. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1002.4862 · Cited by 99
Self-citationExploitation and exploration in a performance based contextual advertising system
Li, W., Wang, X., Zhang, R., Cui, Y. D., Mao, J., & Jin, R. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835811 · Cited by 95
Efficient regularized isotonic regression with application to gene–gene interaction search
Luss, R., Rosset, S., & Shahar, M. (2012) · The Annals of Applied Statistics · doi:10.1214/11-aoas504 · Cited by 59
Large-Scale Learning with Less RAM via RandomizationPreprint
Golovin, D., Sculley, D., McMahan, H. B., & Young, M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.4664 · Cited by 20
Self-citationOn Calibrated Predictions for Auction Selection MechanismsPreprint
McMahan, H. B., & Muralidharan, O. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.3955 · Cited by 1
Self-citation
Cited by
DeepFM: A Factorization-Machine based Neural Network for CTR Prediction
Guo, H., TANG, R., Ye, Y., Li, Z., & He, X. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/239 · Cited by 2,538
Deep Interest Network for Click-Through Rate Prediction
Zhou, G., Zhu, X., Song, C., Fan, Y., Zhu, H., Ma, X., Yan, Y., Jin, J., Li, H., & Gai, K. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219823 · Cited by 2,128
xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems
Lian, J., Zhou, X., Zhang, F., Chen, Z., Xie, X., & Sun, G. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220023 · Cited by 1,040
Scaling distributed machine learning with the parameter server
Li, M., Andersen, D. G., Park, J. W., Smola, A. J., Ahmed, A. A., Josifovski, V., Long, J. E., Shekita, E. J., & Su, B.-Y. (2014) · Operating Systems Design and Implementation · doi:10.5555/2685048.2685095 · Cited by 1,021
Scaling Distributed Machine Learning with the Parameter Server
Li, M. (2014) · Proceedings of the 2014 International Conference on Big Data Science and Computing · doi:10.1145/2640087.2644155 · Cited by 979
Metadata
- Authors
- McMahan, H. B., Holt, G., Sculley, D., Young, M., Ebner, D., Grady, J., Nie, L., Phillips, T., Davydov, E., Golovin, D., Chikkerur, S., Liu, D., Wattenberg, M., Hrafnkelsson, A. M., Boulos, T., & Kubica, J.
- Venue
- Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2013-08-11
- Pages
- 1222-1230
- OpenAlex
- W2074694452
- Cited by
- 867
- References
- 34
- FWCI
- 66.59
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.