{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:36:05Z","timestamp":1775666165346,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403181","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:15:22Z","timestamp":1597965322000},"page":"1285-1294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The NodeHopper: Enabling Low Latency Ranking with Constraints via a Fast Dual Solver"],"prefix":"10.1145","author":[{"given":"Anton","family":"Zhernov","sequence":"first","affiliation":[{"name":"DeepMind, London, United Kingdom"}]},{"given":"Krishnamurthy Dj","family":"Dvijotham","sequence":"additional","affiliation":[{"name":"DeepMind, London, United Kingdom"}]},{"given":"Ivan","family":"Lobov","sequence":"additional","affiliation":[{"name":"DeepMind, London, United Kingdom"}]},{"given":"Dan A.","family":"Calian","sequence":"additional","affiliation":[{"name":"DeepMind, London, United Kingdom"}]},{"given":"Michelle","family":"Gong","sequence":"additional","affiliation":[{"name":"DeepMind, Mountain View, CA, USA"}]},{"given":"Natarajan","family":"Chandrashekar","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}]},{"given":"Timothy A.","family":"Mann","sequence":"additional","affiliation":[{"name":"DeepMind, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2745398"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020435"},{"key":"e_1_3_2_1_3_1","volume-title":"Implementation of Interior-Point Methods for Large Scale Linear Programs","author":"Anderson Erling D.","unstructured":"Erling D. Anderson , Jacek Gondzio , Csaba M\u00e9sz\u00e1ros , and Xiaojie Xu. 1996. Implementation of Interior-Point Methods for Large Scale Linear Programs . Springer US , Boston, MA , 189--252. https:\/\/doi.org\/10.1007\/978--1--4613--3449--1_6 10.1007\/978--1--4613--3449--1_6 Erling D. Anderson, Jacek Gondzio, Csaba M\u00e9sz\u00e1ros, and Xiaojie Xu. 1996. Implementation of Interior-Point Methods for Large Scale Linear Programs .Springer US, Boston, MA, 189--252. https:\/\/doi.org\/10.1007\/978--1--4613--3449--1_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_1_5_1","volume-title":"Convex Optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe . 2004. Convex Optimization . Cambridge University Press , USA. Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization .Cambridge University Press, USA."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_7_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"15","author":"Celis L. Elisa","year":"2018","unstructured":"L. Elisa Celis , Damian Straszak , and Nisheeth K. Vishnoi . 2018. Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 28:1--28: 15 . https:\/\/doi.org\/10.4230\/LIPIcs.ICALP. 2018 .28 10.4230\/LIPIcs.ICALP.2018.28 L. Elisa Celis, Damian Straszak, and Nisheeth K. Vishnoi. 2018. Ranking with Fairness Constraints. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 28:1--28:15. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.28"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330675"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899358443"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.02.023"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.97"},{"key":"e_1_3_2_1_14_1","first-page":"11","article-title":"Recommender Systems - beyond Matrix","volume":"59","author":"Jannach Dietmar","year":"2016","unstructured":"Dietmar Jannach , Paul Resnick , Alexander Tuzhilin , and Markus Zanker . 2016 . Recommender Systems - beyond Matrix Completion. Commun. ACM , Vol. 59 , 11 (Oct. 2016), 94--102. https:\/\/doi.org\/10.1145\/2891406 10.1145\/2891406 Dietmar Jannach, Paul Resnick, Alexander Tuzhilin, and Markus Zanker. 2016. Recommender Systems - beyond Matrix Completion. Commun. ACM, Vol. 59, 11 (Oct. 2016), 94--102. https:\/\/doi.org\/10.1145\/2891406","journal-title":"Completion. Commun. ACM"},{"key":"e_1_3_2_1_15_1","volume-title":"Introduction to Information Retrieval","author":"Manning Christopher D.","unstructured":"Christopher D. Manning , Prabhakar Raghavan , and Hinrich Sch\u00fctze . 2008. Introduction to Information Retrieval . Cambridge University Press , USA. Christopher D. Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze. 2008. Introduction to Information Retrieval .Cambridge University Press, USA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1476589.1476628"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390255"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098025"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_2_1_20_1","unstructured":"Jaehyun Park Stephen Boyd. 2014. Lecture note on subgradient methods. Stanford university. https:\/\/web.stanford.edu\/class\/ee364b\/lectures\/subgrad_method_notes.pdf  Jaehyun Park Stephen Boyd. 2014. Lecture note on subgradient methods. Stanford university. https:\/\/web.stanford.edu\/class\/ee364b\/lectures\/subgrad_method_notes.pdf"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning -","volume":"70","author":"Zoghi Masrour","year":"2017","unstructured":"Masrour Zoghi , Tomas Tunys , Mohammad Ghavamzadeh , Branislav Kveton , Csaba Szepesvari , and Zheng Wen . 2017 . Online Learning to Rank in Stochastic Click Models . In Proceedings of the 34th International Conference on Machine Learning - Volume 70 (ICML'17). JMLR.org, Sydney, NSW, Australia, 4199--4208. Masrour Zoghi, Tomas Tunys, Mohammad Ghavamzadeh, Branislav Kveton, Csaba Szepesvari, and Zheng Wen. 2017. Online Learning to Rank in Stochastic Click Models. In Proceedings of the 34th International Conference on Machine Learning - Volume 70 (ICML'17). JMLR.org, Sydney, NSW, Australia, 4199--4208."}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","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 26th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:34Z","timestamp":1750195894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":21,"alternative-id":["10.1145\/3394486.3403181","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403181","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}