{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:29:55Z","timestamp":1775471395645,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,8,11]]},"DOI":"10.1145\/2487575.2488200","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T12:31:21Z","timestamp":1376397081000},"page":"1222-1230","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":597,"title":["Ad click prediction"],"prefix":"10.1145","author":[{"given":"H. Brendan","family":"McMahan","sequence":"first","affiliation":[{"name":"Google, Seattle, WA, USA"}]},{"given":"Gary","family":"Holt","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]},{"given":"D.","family":"Sculley","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]},{"given":"Michael","family":"Young","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]},{"given":"Dietmar","family":"Ebner","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Julian","family":"Grady","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]},{"given":"Lan","family":"Nie","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Todd","family":"Phillips","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]},{"given":"Eugene","family":"Davydov","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Daniel","family":"Golovin","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]},{"given":"Sharat","family":"Chikkerur","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]},{"given":"Dan","family":"Liu","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Martin","family":"Wattenberg","sequence":"additional","affiliation":[{"name":"Google, Cambridge, MA, USA"}]},{"given":"Arnar Mar","family":"Hrafnkelsson","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Tom","family":"Boulos","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Jeremy","family":"Kubica","sequence":"additional","affiliation":[{"name":"Google, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526713"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465272"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139042918"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307439"},{"key":"e_1_3_2_1_6_1","volume-title":"AdML: 2012 ICML Workshop on Online Advertising","author":"Chapelle O.","year":"2012","unstructured":"O. Chapelle . Click modeling for display advertising . In AdML: 2012 ICML Workshop on Online Advertising , 2012 . O. Chapelle. Click modeling for display advertising. In AdML: 2012 ICML Workshop on Online Advertising, 2012."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87987-9_8"},{"key":"e_1_3_2_1_8_1","volume-title":"NIPS","author":"Dean J.","year":"2012","unstructured":"J. Dean , G. S. Corrado , R. Monga , K. Chen , M. Devin , Q. V. Le , M. Z. Mao , M. Ranzato , A. Senior , P. Tucker , K. Yang , and A. Y. Ng . Large scale distributed deep networks . In NIPS , 2012 . J. Dean, G. S. Corrado, R. Monga, K. Chen, M. Devin, Q. V. Le, M. Z. Mao, M. Ranzato, A. Senior, P. Tucker, K. Yang, and A. Y. Ng. Large scale distributed deep networks. In NIPS, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007607513941"},{"key":"e_1_3_2_1_10_1","volume-title":"COLT","author":"Duchi J.","year":"2010","unstructured":"J. Duchi , E. Hazan , and Y. Singer . Adaptive subgradient methods for online learning and stochastic optimization . In COLT , 2010 . J. Duchi, E. Hazan, and Y. Singer. Adaptive subgradient methods for online learning and stochastic optimization. In COLT, 2010."},{"key":"e_1_3_2_1_11_1","first-page":"495","volume-title":"Advances in Neural Information Processing Systems 22","author":"Duchi J.","year":"2009","unstructured":"J. Duchi and Y. Singer . Efficient learning using forward-backward splitting . In Advances in Neural Information Processing Systems 22 , pages 495 -- 503 . 2009 . J. Duchi and Y. Singer. Efficient learning using forward-backward splitting. In Advances in Neural Information Processing Systems 22, pages 495--503. 2009."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"e_1_3_2_1_14_1","volume-title":"ICML","author":"Golovin D.","year":"2013","unstructured":"D. Golovin , D. Sculley , H. B. McMahan , and M. Young . Large-scale learning with a small-scale footprint . In ICML , 2013 . To appear. D. Golovin, D. Sculley, H. B. McMahan, and M. Young. Large-scale learning with a small-scale footprint. In ICML, 2013. To appear."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3104322.3104326"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718532"},{"key":"e_1_3_2_1_17_1","volume-title":"Improving neural networks by preventing co-adaptation of feature detectors. CoRR, abs\/1207.0580","author":"Hinton G. E.","year":"2012","unstructured":"G. E. Hinton , N. Srivastava , A. Krizhevsky , I. Sutskever , and R. Salakhutdinov . Improving neural networks by preventing co-adaptation of feature detectors. CoRR, abs\/1207.0580 , 2012 . G. E. Hinton, N. Srivastava, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov. Improving neural networks by preventing co-adaptation of feature detectors. CoRR, abs\/1207.0580, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722146"},{"key":"e_1_3_2_1_19_1","volume-title":"ICML","author":"Koepke H. A.","year":"2012","unstructured":"H. A. Koepke and M. Bilenko . Fast prediction of new feature utility . In ICML , 2012 . H. A. Koepke and M. Bilenko. Fast prediction of new feature utility. In ICML, 2012."},{"key":"e_1_3_2_1_20_1","first-page":"10","article-title":"Sparse online learning via truncated gradient","author":"Langford J.","year":"2009","unstructured":"J. Langford , L. Li , and T. Zhang . Sparse online learning via truncated gradient . JMLR , 10 , 2009 . J. Langford, L. Li, and T. Zhang. Sparse online learning via truncated gradient. JMLR, 10, 2009.","journal-title":"JMLR"},{"key":"e_1_3_2_1_21_1","volume-title":"WINE","author":"Li S.-M.","year":"2010","unstructured":"S.-M. Li , M. Mahdian , and R. P. McAfee . Value of learning in sponsored search auctions . In WINE , 2010 . S.-M. Li, M. Mahdian, and R. P. McAfee. Value of learning in sponsored search auctions. In WINE, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835811"},{"key":"e_1_3_2_1_23_1","volume-title":"Efficient regularized isotonic regression with application to gene--gene interaction search. Ann. Appl. Stat., 6(1)","author":"Luss R.","year":"2012","unstructured":"R. Luss , S. Rosset , and M. Shahar . Efficient regularized isotonic regression with application to gene--gene interaction search. Ann. Appl. Stat., 6(1) , 2012 . R. Luss, S. Rosset, and M. Shahar. Efficient regularized isotonic regression with application to gene--gene interaction search. Ann. Appl. Stat., 6(1), 2012."},{"key":"e_1_3_2_1_24_1","volume-title":"AISTATS","author":"McMahan H. B.","year":"2011","unstructured":"H. B. McMahan . Follow-the-regularized-leader and mirror descent: Equivalence theorems and L1 regularization . In AISTATS , 2011 . H. B. McMahan. Follow-the-regularized-leader and mirror descent: Equivalence theorems and L1 regularization. In AISTATS, 2011."},{"key":"e_1_3_2_1_25_1","volume-title":"On calibrated predictions for auction selection mechanisms. CoRR, abs\/1211.3955","author":"McMahan H. B.","year":"2012","unstructured":"H. B. McMahan and O. Muralidharan . On calibrated predictions for auction selection mechanisms. CoRR, abs\/1211.3955 , 2012 . H. B. McMahan and O. Muralidharan. On calibrated predictions for auction selection mechanisms. CoRR, abs\/1211.3955, 2012."},{"key":"e_1_3_2_1_26_1","volume-title":"COLT","author":"McMahan H. B.","year":"2010","unstructured":"H. B. McMahan and M. Streeter . Adaptive bound optimization for online convex optimization . In COLT , 2010 . H. B. McMahan and M. Streeter. Adaptive bound optimization for online convex optimization. In COLT, 2010."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102430"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_29_1","volume-title":"Less regret via online conditioning. CoRR, abs\/1002.4862","author":"Streeter M. J.","year":"2010","unstructured":"M. J. Streeter and H. B. McMahan . Less regret via online conditioning. CoRR, abs\/1002.4862 , 2010 . M. J. Streeter and H. B. McMahan. Less regret via online conditioning. CoRR, abs\/1002.4862, 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835810"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"e_1_3_2_1_32_1","volume-title":"NIPS","author":"Xiao L.","year":"2009","unstructured":"L. Xiao . Dual averaging method for regularized stochastic learning and online optimization . In NIPS , 2009 . L. Xiao. Dual averaging method for regularized stochastic learning and online optimization. In NIPS, 2009."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718528"},{"key":"e_1_3_2_1_34_1","volume-title":"ICML","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . Online convex programming and generalized infinitesimal gradient ascent . In ICML , 2003 . M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 2003."}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois USA","acronym":"KDD' 13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2488200","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2488200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:29Z","timestamp":1750235969000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2488200"}},"subtitle":["a view from the trenches"],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":34,"alternative-id":["10.1145\/2487575.2488200","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2488200","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}