{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:40:28Z","timestamp":1781908828514,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"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":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467345","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:05Z","timestamp":1628748725000},"page":"1339-1347","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Simple Yet Efficient Algorithms for Maximum Inner Product Search via Extreme Order Statistics"],"prefix":"10.1145","author":[{"given":"Ninh","family":"Pham","sequence":"first","affiliation":[{"name":"University of Auckland, Auckland, New Zealand"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.12"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-7637-6_6"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_2_4_1","first-page":"1225","volume-title":"NIPS","author":"Andoni A.","year":"2015","unstructured":"A. Andoni , P. Indyk , T. Laarhoven , I. P. Razenshteyn , and L. Schmidt . Practical and optimal LSH for angular distance . In NIPS , pages 1225 -- 1233 , 2015 . A. Andoni, P. Indyk, T. Laarhoven, I. P. Razenshteyn, and L. Schmidt. Practical and optimal LSH for angular distance. In NIPS, pages 1225--1233, 2015."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.56"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645741"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_2_8_1","first-page":"12339","volume-title":"NeurIPS","author":"Chen B.","year":"2019","unstructured":"B. Chen , Y. Xu , and A. Shrivastava . Fast and accurate stochastic gradient estimation . In NeurIPS , pages 12339 -- 12349 , 2019 . B. Chen, Y. Xu, and A. Shrivastava. Fast and accurate stochastic gradient estimation. In NeurIPS, pages 12339--12349, 2019."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212559"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212912"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219971"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"e_1_3_2_2_14_1","first-page":"487","volume-title":"SIGKDD","author":"A.","year":"2015","unstructured":"A. Kab\u00e1 n. Improved bounds on the dot product under random projection and random sign projection . In SIGKDD , pages 487 -- 496 , 2015 . A. Kab\u00e1 n. Improved bounds on the dot product under random projection and random sign projection. In SIGKDD, pages 487--496, 2015."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798347177"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"e_1_3_2_2_18_1","volume-title":"ECML\/PKDD","author":"Lorenzen S. S.","year":"2020","unstructured":"S. S. Lorenzen and N. Pham . Revisiting wedge sampling for budgeted maximum inner product search . In ECML\/PKDD , 2020 . S. S. Lorenzen and N. Pham. Revisiting wedge sampling for budgeted maximum inner product search. In ECML\/PKDD, 2020."},{"key":"e_1_3_2_2_19_1","first-page":"4726","volume-title":"NeurIPS","author":"Morozov S.","year":"2018","unstructured":"S. Morozov and A. Babenko . Non-metric similarity graphs for maximum inner product search . In NeurIPS , pages 4726 -- 4735 , 2018 . S. Morozov and A. Babenko. Non-metric similarity graphs for maximum inner product search. In NeurIPS, pages 4726--4735, 2018."},{"key":"e_1_3_2_2_20_1","first-page":"2587","volume-title":"ICML","author":"Mussmann S.","year":"2016","unstructured":"S. Mussmann and S. Ermon . Learning and inference via maximum inner product search . In ICML , pages 2587 -- 2596 , 2016 . S. Mussmann and S. Ermon. Learning and inference via maximum inner product search. In ICML, pages 2587--2596, 2016."},{"key":"e_1_3_2_2_21_1","first-page":"1926","volume-title":"ICML","author":"Neyshabur B.","year":"2015","unstructured":"B. Neyshabur and N. Srebro . On symmetric and asymmetric LSHs for inner product search . In ICML , pages 1926 -- 1934 , 2015 . B. Neyshabur and N. Srebro. On symmetric and asymmetric LSHs for inner product search. In ICML, pages 1926--1934, 2015."},{"key":"e_1_3_2_2_22_1","first-page":"2321","volume-title":"NIPS","author":"Shrivastava A.","year":"2014","unstructured":"A. Shrivastava and P. Li . Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS) . In NIPS , pages 2321 -- 2329 , 2014 . A. Shrivastava and P. Li. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). In NIPS, pages 2321--2329, 2014."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098035"},{"key":"e_1_3_2_2_24_1","volume-title":"Cambridge Series in Statistical and Probabilistic Mathematics","author":"Wainwright M. J.","year":"2019","unstructured":"M. J. Wainwright . Basic tail and concentration bounds, pages 21--57 . Cambridge Series in Statistical and Probabilistic Mathematics . Cambridge University Press , 2019 . M. J. Wainwright. Basic tail and concentration bounds, pages 21--57. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 2019."},{"key":"e_1_3_2_2_25_1","first-page":"2956","volume-title":"NeurIPS","author":"Yan X.","year":"2018","unstructured":"X. Yan , J. Li , X. Dai , H. Chen , and J. Cheng . Norm-ranging LSH for maximum inner product search . In NeurIPS , pages 2956 -- 2965 , 2018 . X. Yan, J. Li, X. Dai, H. Chen, and J. Cheng. Norm-ranging LSH for maximum inner product search. In NeurIPS, pages 2956--2965, 2018."},{"key":"e_1_3_2_2_26_1","first-page":"5459","volume-title":"NIPS","author":"Yu H.","year":"2017","unstructured":"H. Yu , C. Hsieh , Q. Lei , and I. S. Dhillon . A greedy approach for budgeted maximum inner product search . In NIPS , pages 5459 -- 5468 , 2017 . H. Yu, C. Hsieh, Q. Lei, and I. S. Dhillon. A greedy approach for budgeted maximum inner product search. In NIPS, pages 5459--5468, 2017."}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","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 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467345","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:23Z","timestamp":1750191503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":26,"alternative-id":["10.1145\/3447548.3467345","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467345","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}