{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:44Z","timestamp":1750221284002,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T00:00:00Z","timestamp":1502668800000},"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":[[2017,8,14]]},"DOI":"10.1145\/3124749.3124751","type":"proceedings-article","created":{"date-parts":[[2017,11,29]],"date-time":"2017-11-29T14:01:41Z","timestamp":1511964101000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Cost-sensitive Learning for Utility Optimization in Online Advertising Auctions"],"prefix":"10.1145","author":[{"given":"Flavian","family":"Vasile","sequence":"first","affiliation":[{"name":"Criteo, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Lefortier","sequence":"additional","affiliation":[{"name":"Facebook, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Chapelle","sequence":"additional","affiliation":[{"name":"Criteo, Palo Alto, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Digital advertising spend in 2015. http:\/\/www.statista.com\/statistics\/237974\/online-advertising-spending-worldwide\/. (????). Accessed: 2015-10-15.  Digital advertising spend in 2015. http:\/\/www.statista.com\/statistics\/237974\/online-advertising-spending-worldwide\/. (????). Accessed: 2015-10-15."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835834"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623634"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742566"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2532128"},{"key":"e_1_3_2_2_7_1","unstructured":"Corinna Cortes Yishay Mansour and Mehryar Mohri. 2010. Learning bounds for importance weighting. In Advances in neural information processing systems. 442--450.  Corinna Cortes Yishay Mansour and Mehryar Mohri. 2010. Learning bounds for importance weighting. In Advances in neural information processing systems. 442--450."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648589"},{"key":"e_1_3_2_2_9_1","volume-title":"Loss functions for predicted click through rates in auctions for online advertising. Preprint","author":"Hummel Patrick","year":"2013","unstructured":"Patrick Hummel and R Preston McAfee . 2013. Loss functions for predicted click through rates in auctions for online advertising. Preprint , Google Inc ( 2013 ). Patrick Hummel and R Preston McAfee. 2013. Loss functions for predicted click through rates in auctions for online advertising. Preprint, Google Inc (2013)."},{"key":"e_1_3_2_2_11_1","volume-title":"Online importance weight aware updates. arXiv preprint arXiv:1011.1576","author":"Karampatziakis Nikos","year":"2010","unstructured":"Nikos Karampatziakis and John Langford . 2010. Online importance weight aware updates. arXiv preprint arXiv:1011.1576 ( 2010 ). Nikos Karampatziakis and John Langford. 2010. Online importance weight aware updates. arXiv preprint arXiv:1011.1576 (2010)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788582"},{"key":"e_1_3_2_2_13_1","volume-title":"On the limited memory BFGS method for large scale optimization. Mathematical programming 45, 1--3","author":"Liu Dong C","year":"1989","unstructured":"Dong C Liu and Jorge Nocedal . 1989. On the limited memory BFGS method for large scale optimization. Mathematical programming 45, 1--3 ( 1989 ), 503--528. Dong C Liu and Jorge Nocedal. 1989. On the limited memory BFGS method for large scale optimization. Mathematical programming 45, 1--3 (1989), 503--528."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2488200"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0572855-7"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501040.2501980"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Halifax NS Canada","acronym":"KDD '17"},"container-title":["Proceedings of the ADKDD'17"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3124749.3124751","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3124749.3124751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:23Z","timestamp":1750212683000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3124749.3124751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,14]]},"references-count":15,"alternative-id":["10.1145\/3124749.3124751","10.1145\/3124749"],"URL":"https:\/\/doi.org\/10.1145\/3124749.3124751","relation":{},"subject":[],"published":{"date-parts":[[2017,8,14]]},"assertion":[{"value":"2017-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}