{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:50:18Z","timestamp":1777614618283,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","funder":[{"name":"Ningbo Yongjiang Talent Introduction Programme","award":["2022A-237-G"],"award-info":[{"award-number":["2022A-237-G"]}]},{"name":"zhejiang Province?s ?Lingyan? R&D Project","award":["2024C01259"],"award-info":[{"award-number":["2024C01259"]}]},{"name":"NSFC","award":["62025206,U23A20296"],"award-info":[{"award-number":["62025206,U23A20296"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,13]]},"DOI":"10.1145\/3726302.3730088","type":"proceedings-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T01:18:36Z","timestamp":1752455916000},"page":"2341-2350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Stitching Inner Product and Euclidean Metrics for Topology-aware Maximum Inner Product Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5635-9326","authenticated-orcid":false,"given":"Tingyang","family":"Chen","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3624-6665","authenticated-orcid":false,"given":"Cong","family":"Fu","sequence":"additional","affiliation":[{"name":"Shopee Pte. Ltd., Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8082-7398","authenticated-orcid":false,"given":"Xiangyu","family":"Ke","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3816-8450","authenticated-orcid":false,"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7535-8125","authenticated-orcid":false,"given":"Yabo","family":"Ni","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3869-5357","authenticated-orcid":false,"given":"Anxiang","family":"Zeng","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"1998. MNIST. http:\/\/yann.lecun.com\/exdb\/mnist\/."},{"key":"e_1_3_2_1_2_1","unstructured":"2009. Color3M. http:\/\/cophir.isti.cnr.it\/."},{"key":"e_1_3_2_1_3_1","unstructured":"2021. Text-to-Image. https:\/\/research.yandex.com\/blog\/benchmarks-for-billionscale-similarity-search."},{"key":"e_1_3_2_1_4_1","unstructured":"2024. faiss. https:\/\/github.com\/facebookresearch\/faiss."},{"key":"e_1_3_2_1_5_1","unstructured":"2024. OpenAI-1536. https:\/\/huggingface.co\/datasets\/KShivendu\/dbpedia-entitiesopenai-1M."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Amin Ahmad Noah Constant Yinfei Yang and Daniel Cer. 2019. ReQA: An Evaluation for End-to-End Answer Retrieval Models. In EMNLP. 137.","DOI":"10.18653\/v1\/D19-5819"},{"key":"e_1_3_2_1_7_1","first-page":"41","article-title":"Retrieval-based language models and applications","author":"Asai Akari","year":"2023","unstructured":"Akari Asai, Sewon Min, Zexuan Zhong, and Danqi Chen. 2023. Retrieval-based language models and applications. In ACL. 41-46.","journal-title":"ACL."},{"key":"e_1_3_2_1_8_1","volume-title":"ANN Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. IS 87","author":"Aum\u00fcller Martin","year":"2020","unstructured":"Martin Aum\u00fcller, Erik Bernhardsson, and Alexander Faithfull. 2020. ANN Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. IS 87 (2020), 101374."},{"key":"e_1_3_2_1_9_1","first-page":"257","article-title":"Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces","author":"Bachrach Yoram","year":"2014","unstructured":"Yoram Bachrach, Yehuda Finkelstein, Ran Gilad-Bachrach, Liran Katzir, Noam Koenigstein, Nir Nice, and Ulrich Paquet. 2014. Speeding up the xbox recommender system using a euclidean transformation for inner-product spaces. In RecSys. 257-264.","journal-title":"RecSys."},{"key":"e_1_3_2_1_10_1","unstructured":"Frank Bowman. 1958. Introduction to Bessel functions."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Charles E Brown. 1998. Coefficient of variation. In Applied multivariate statistics in geohydrology and related sciences. 155-157.","DOI":"10.1007\/978-3-642-80328-4_13"},{"key":"e_1_3_2_1_12_1","first-page":"3225","article-title":"Finger: Fast inference for graph-based approximate nearest neighbor search","author":"Chen Patrick","year":"2023","unstructured":"Patrick Chen, Wei-Cheng Chang, Jyun-Yu Jiang, Hsiang-Fu Yu, Inderjit Dhillon, and Cho-Jui Hsieh. 2023. Finger: Fast inference for graph-based approximate nearest neighbor search. In WWW. 3225-3235.","journal-title":"WWW."},{"key":"e_1_3_2_1_13_1","volume-title":"Maximum Inner Product is Query-Scaled Nearest Neighbor. arXiv preprint arXiv:2503.06882","author":"Chen Tingyang","year":"2025","unstructured":"Tingyang Chen, Cong Fu, Kun Wang, Xiangyu Ke, Yunjun Gao, Wenchao Zhou, Yabo Ni, and Anxiang Zeng. 2025. Maximum Inner Product is Query-Scaled Nearest Neighbor. arXiv preprint arXiv:2503.06882 (2025)."},{"key":"e_1_3_2_1_14_1","first-page":"430","article-title":"A note on the theory of moment generating functions","volume":"13","author":"Curtiss John H","year":"1942","unstructured":"John H Curtiss. 1942. A note on the theory of moment generating functions. AMS 13, 4 (1942), 430-433.","journal-title":"AMS"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5333"},{"key":"e_1_3_2_1_16_1","first-page":"4974","article-title":"Residual Multi-Task Learner for Applied Ranking","author":"Fu Cong","year":"2024","unstructured":"Cong Fu, Kun Wang, Jiahua Wu, Yizhou Chen, Guangda Huzhang, Yabo Ni, Anxiang Zeng, and Zhiming Zhou. 2024. Residual Multi-Task Learner for Applied Ranking. In SIGKDD. 4974-4985.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_1_18_1","first-page":"482","article-title":"Quantization based fast inner product search","author":"Guo Ruiqi","year":"2016","unstructured":"Ruiqi Guo, Sanjiv Kumar, Krzysztof Choromanski, and David Simcha. 2016. Quantization based fast inner product search. In AISTATS. 482-490.","journal-title":"AISTATS."},{"key":"e_1_3_2_1_19_1","first-page":"3887","article-title":"Accelerating large-scale inference with anisotropic vector quantization","author":"Guo Ruiqi","year":"2020","unstructured":"Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. In ICML. 3887-3896.","journal-title":"ICML."},{"key":"e_1_3_2_1_20_1","first-page":"2553","article-title":"Embeddingbased retrieval in facebook search","author":"Huang Jui-Ting","year":"2020","unstructured":"Jui-Ting Huang, Ashish Sharma, Shuying Sun, Li Xia, David Zhang, Philip Pronin, Janani Padmanabhan, Giuseppe Ottaviano, and Linjun Yang. 2020. Embeddingbased retrieval in facebook search. In SIGKDD. 2553-2561.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_21_1","first-page":"9459","article-title":"Retrieval-augmented generation for knowledge-intensive NLP tasks","author":"Lewis Patrick","year":"2020","unstructured":"Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich K\u00fcttler, Mike Lewis,Wen-tau Yih, Tim Rockt\u00e4schel, et al. 2020. Retrieval-augmented generation for knowledge-intensive NLP tasks. In NeurIPS. 9459-9474.","journal-title":"NeurIPS."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5344"},{"key":"e_1_3_2_1_23_1","first-page":"4671","article-title":"Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree","author":"Ma Hengzhao","year":"2024","unstructured":"Hengzhao Ma, Jianzhong Li, and Yong Zhang. 2024. Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree. In ICDE. 4671-4684.","journal-title":"ICDE."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_2_1_25_1","first-page":"521","article-title":"Jensen's inequality","volume":"43","author":"McShane EJ","year":"1937","unstructured":"EJ McShane. 1937. Jensen's inequality. AMS 43, 8 (1937), 521-527.","journal-title":"AMS"},{"key":"e_1_3_2_1_26_1","first-page":"4726","article-title":"Non-metric similarity graphs for maximum inner product search","author":"Morozov Stanislav","year":"2018","unstructured":"Stanislav Morozov and Artem Babenko. 2018. Non-metric similarity graphs for maximum inner product search. In NeurIPS. 4726-4735.","journal-title":"NeurIPS."},{"key":"e_1_3_2_1_27_1","volume-title":"International Conference on Machine Learning. PMLR","author":"Neyshabur Behnam","year":"2015","unstructured":"Behnam Neyshabur and Nathan Srebro. 2015. On symmetric and asymmetric lshs for inner product search. In International Conference on Machine Learning. PMLR, 1926-1934."},{"key":"e_1_3_2_1_28_1","first-page":"1","article-title":"Efficient approximate nearest neighbor search in multi-dimensional databases","volume":"1","author":"Peng Yun","year":"2023","unstructured":"Yun Peng, Byron Choi, Tsz Nam Chan, Jianye Yang, and Jianliang Xu. 2023. Efficient approximate nearest neighbor search in multi-dimensional databases. SIGMOD 1, 1 (2023), 1-27.","journal-title":"SIGMOD"},{"key":"e_1_3_2_1_29_1","first-page":"7803","article-title":"Graph-based nearest neighbor search: From practice to theory","author":"Prokhorenkova Liudmila","year":"2020","unstructured":"Liudmila Prokhorenkova and Aleksandr Shekhovtsov. 2020. Graph-based nearest neighbor search: From practice to theory. In ICML. 7803-7813.","journal-title":"ICML."},{"key":"e_1_3_2_1_30_1","first-page":"8748","article-title":"Learning transferable visual models from natural language supervision","author":"Radford Alec","year":"2021","unstructured":"Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al. 2021. Learning transferable visual models from natural language supervision. In ICML. 8748-8763.","journal-title":"ICML."},{"key":"e_1_3_2_1_31_1","first-page":"8748","article-title":"Learning Transferable Visual Models From Natural Language Supervision","author":"Radford Alec","year":"2021","unstructured":"Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, Gretchen Krueger, and Ilya Sutskever. 2021. Learning Transferable Visual Models From Natural Language Supervision. In ICML. 8748-8763.","journal-title":"ICML."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"e_1_3_2_1_33_1","first-page":"4430","article-title":"Real-time open-domain question answering with dense-sparse phrase index","author":"Seo Minjoon","year":"2019","unstructured":"Minjoon Seo, Jinhyuk Lee, Tom Kwiatkowski, Ankur Parikh, Ali Farhadi, and Hannaneh Hajishirzi. 2019. Real-time open-domain question answering with dense-sparse phrase index. In ACL. 4430-4441.","journal-title":"ACL."},{"key":"e_1_3_2_1_34_1","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS). In NIPS. 2321-2329.","journal-title":"NIPS."},{"key":"e_1_3_2_1_35_1","first-page":"812","article-title":"Improved asymmetric locality sensitive hashing (ALSH) for Maximum Inner Product Search (MIPS)","author":"Shrivastava Anshumali","year":"2015","unstructured":"Anshumali Shrivastava and Ping Li. 2015. Improved asymmetric locality sensitive hashing (ALSH) for Maximum Inner Product Search (MIPS). In UAI. 812-821.","journal-title":"UAI."},{"key":"e_1_3_2_1_36_1","first-page":"1619","article-title":"ProMIPS: Efficient high dimensional C-approximate maximum inner product search with a lightweight index","author":"Song Yang","year":"2021","unstructured":"Yang Song, Yu Gu, Rui Zhang, and Ge Yu. 2021. ProMIPS: Efficient high dimensional C-approximate maximum inner product search with a lightweight index. In ICDE. 1619-1630.","journal-title":"ICDE."},{"key":"e_1_3_2_1_37_1","first-page":"3189","article-title":"SOAR: improved indexing for approximate nearest neighbor search","author":"Sun Philip","year":"2023","unstructured":"Philip Sun, David Simcha, Dave Dopson, Ruiqi Guo, and Sanjiv Kumar. 2023. SOAR: improved indexing for approximate nearest neighbor search. In NeurIPS. 3189-3204.","journal-title":"NeurIPS."},{"key":"e_1_3_2_1_38_1","first-page":"1552","article-title":"Norm adjusted proximity graph for fast inner product retrieval","author":"Tan Shulong","year":"2021","unstructured":"Shulong Tan, Zhaozhuo Xu, Weijie Zhao, Hongliang Fei, Zhixin Zhou, and Ping Li. 2021. Norm adjusted proximity graph for fast inner product retrieval. In SIGKDD. 1552-1560.","journal-title":"SIGKDD."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2812802"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"e_1_3_2_1_41_1","first-page":"4747","article-title":"Must: An effective and scalable framework for multimodal search of target modality","author":"Ke Xiangyu","year":"2024","unstructured":"MengzhaoWang, Xiangyu Ke, Xiaoliang Xu, Lu Chen, Yunjun Gao, Pinpin Huang, and Runkai Zhu. 2024. Must: An effective and scalable framework for multimodal search of target modality. In ICDE. IEEE, 4747-4759.","journal-title":"ICDE. IEEE"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"e_1_3_2_1_43_1","volume-title":"Det-lsh: a locality-sensitive hashing scheme with dynamic encoding tree for approximate nearest neighbor search. arXiv preprint arXiv:2406.10938","author":"Wei Jiuqi","year":"2024","unstructured":"Jiuqi Wei, Botao Peng, Xiaodong Lee, and Themis Palpanas. 2024. Det-lsh: a locality-sensitive hashing scheme with dynamic encoding tree for approximate nearest neighbor search. arXiv preprint arXiv:2406.10938 (2024)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371778"},{"key":"e_1_3_2_1_45_1","first-page":"1365","article-title":"Deep learning for matching in search and recommendation","author":"Xu Jun","year":"2018","unstructured":"Jun Xu, Xiangnan He, and Hang Li. 2018. Deep learning for matching in search and recommendation. In SIGIR. 1365-1368.","journal-title":"SIGIR."},{"key":"e_1_3_2_1_46_1","first-page":"2956","article-title":"Norm ranging LSH for maximum inner product search","author":"Yan Xiao","year":"2018","unstructured":"Xiao Yan, Jinfeng Li, Xinyan Dai, Hongzhi Chen, and James Cheng. 2018. Norm ranging LSH for maximum inner product search. In NeurIPS. 2956-2965.","journal-title":"NeurIPS."},{"key":"e_1_3_2_1_47_1","first-page":"593","article-title":"Large scale multi-label learning with missing labels","author":"Yu Hsiang-Fu","year":"2014","unstructured":"Hsiang-Fu Yu, Prateek Jain, Purushottam Kar, and Inderjit Dhillon. 2014. Large scale multi-label learning with missing labels. In ICML. 593-601.","journal-title":"ICML."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3579075.3579084"},{"key":"e_1_3_2_1_49_1","first-page":"8218","article-title":"M\u00f6bius transformation for fast inner product search on graph","author":"Zhou Zhixin","year":"2019","unstructured":"Zhixin Zhou, Shulong Tan, Zhaozhuo Xu, and Ping Li. 2019. M\u00f6bius transformation for fast inner product search on graph. In NeurIPS. 8218-8229.","journal-title":"NeurIPS."}],"event":{"name":"SIGIR '25: The 48th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Padua Italy","acronym":"SIGIR '25","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726302.3730088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T18:32:21Z","timestamp":1755887541000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726302.3730088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":49,"alternative-id":["10.1145\/3726302.3730088","10.1145\/3726302"],"URL":"https:\/\/doi.org\/10.1145\/3726302.3730088","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}