{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:09:00Z","timestamp":1755907740692,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200103136"],"award-info":[{"award-number":["DP200103136"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,26]]},"DOI":"10.1145\/3624918.3625316","type":"proceedings-article","created":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T08:49:17Z","timestamp":1700729357000},"page":"185-194","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Lossy Compression Options for Dense Index Retention"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7992-4633","authenticated-orcid":false,"given":"Joel","family":"Mackenzie","sequence":"first","affiliation":[{"name":"The School of Electrical Engineering and Computer Science, The University of Queensland, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6638-0232","authenticated-orcid":false,"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[{"name":"The School of Computing and Information Systems, The University of Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611537"},{"key":"e_1_3_2_1_2_1","volume-title":"MS MARCO: A human generated MAchine Reading COmprehension dataset. arXiv:1611.09268v3","author":"Bajaj D.","year":"2018","unstructured":"[2] P.\u00a0Bajaj, D.\u00a0Campos, N.\u00a0Craswell, L.\u00a0Deng, J.\u00a0Gao, X.\u00a0Liu, R.\u00a0Majumder, A.\u00a0McNamara, B.\u00a0Mitra, T.\u00a0Nguyen, M.\u00a0Rosenberg, X.\u00a0Song, A.\u00a0Stoica, S.\u00a0Tiwary, and T.\u00a0Wang. MS MARCO: A human generated MAchine Reading COmprehension dataset. arXiv:1611.09268v3, 2018."},{"key":"e_1_3_2_1_3_1","first-page":"1626","volume-title":"Proc. ICML","author":"Chen L.","year":"2020","unstructured":"[3] T.\u00a0Chen, L.\u00a0Li, and Y.\u00a0Sun. Differentiable product quantization for end-to-end embedding compression. In Proc. ICML, pages 1617\u20131626, 2020."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32180-1_8"},{"key":"e_1_3_2_1_5_1","volume-title":"A memory efficient baseline for open domain question answering. arXiv:2012.15156","author":"Izacard F.","year":"2020","unstructured":"[5] G.\u00a0Izacard, F.\u00a0Petroni, L.\u00a0Hosseini, N.\u00a0D. Cao, S.\u00a0Riedel, and E.\u00a0Grave. A memory efficient baseline for open domain question answering. arXiv:2012.15156, 2020."},{"key":"e_1_3_2_1_6_1","volume-title":"Trans. Mach. Learn. Res.","author":"Izacard M.","year":"2022","unstructured":"[6] G.\u00a0Izacard, M.\u00a0Caron, L.\u00a0Hosseini, S.\u00a0Riedel, P.\u00a0Bojanowski, A.\u00a0Joulin, and E.\u00a0Grave. Unsupervised dense information retrieval with contrastive learning. Trans. Mach. Learn. Res., 2022."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_10_1","first-page":"48","volume-title":"Proc. SIGIR","author":"Khattab M.","year":"2020","unstructured":"[10] O.\u00a0Khattab and M.\u00a0Zaharia. ColBERT: Efficient and effective passage search via contextualized late interaction over BERT. In Proc. SIGIR, pages 39\u201348, 2020."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463238"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00369"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.227"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/560324"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"key":"e_1_3_2_1_16_1","volume-title":"Techniques for inverted index compression. ACM Comp. Surv., 53(6):125.1\u2013125.36","author":"Pibiri R.","year":"2021","unstructured":"[16] G.\u00a0E. Pibiri and R.\u00a0Venturini. Techniques for inverted index compression. ACM Comp. Surv., 53(6):125.1\u2013125.36, 2021."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.272"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. NeurIPS (Datasets and Benchmarks)","author":"Thakur N.","year":"2021","unstructured":"[18] N.\u00a0Thakur, N.\u00a0Reimers, A.\u00a0R\u00fcckl\u00e9, A.\u00a0Srivastava, and I.\u00a0Gurevych. BEIR: Heterogenous benchmark for zero-shot evaluation of information retrieval models. In Proc. NeurIPS (Datasets and Benchmarks), 2021."},{"key":"e_1_3_2_1_19_1","volume-title":"Domain adaptation for memory-efficient dense retrieval. arXiv:2205.11498","author":"Thakur N.","year":"2022","unstructured":"[19] N.\u00a0Thakur, N.\u00a0Reimers, and J.\u00a0Lin. Domain adaptation for memory-efficient dense retrieval. arXiv:2205.11498, 2022."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-1023"},{"key":"e_1_3_2_1_21_1","first-page":"7695","volume-title":"Proc. NeurIPS","author":"Wang J.","year":"2018","unstructured":"[21] N.\u00a0Wang, J.\u00a0Choi, D.\u00a0Brand, C.-Y. Chen, and K.\u00a0Gopalakrishnan. Training deep neural networks with 8-bit floating point numbers. In Proc. NeurIPS, pages 7686\u20137695, 2018."},{"issue":"4","key":"e_1_3_2_1_22_1","first-page":"20","article-title":"A similarity measure for indefinite rankings","volume":"28","author":"Webber A.","unstructured":"[22] W.\u00a0Webber, A.\u00a0Moffat, and J.\u00a0Zobel. A similarity measure for indefinite rankings. ACM Trans. Inf. Sys., 28(4):20.1\u201320.38, 2010.","journal-title":"ACM Trans. Inf. Sys."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. ICLR","author":"Xiong C.","year":"2021","unstructured":"[23] L.\u00a0Xiong, C.\u00a0Xiong, Y.\u00a0Li, K.-F. Tang, J.\u00a0Liu, P.\u00a0N. Bennett, J.\u00a0Ahmed, and A.\u00a0Overwijk. Approximate nearest neighbor negative contrastive learning for dense text retrieval. In Proc. ICLR, 2021."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-short.123"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3239571"},{"key":"e_1_3_2_1_26_1","volume-title":"The hidden power of pure 16-bit floating-point neural networks","author":"Yun B.","year":"2023","unstructured":"[26] J.\u00a0Yun, B.\u00a0Kang, and Z.\u00a0Fu. The hidden power of pure 16-bit floating-point neural networks, 2023. arXiv:2301.12809."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482358"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.spanlp-1.5"}],"event":{"name":"SIGIR-AP '23: Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"SIGIR-AP '23"},"container-title":["Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624918.3625316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624918.3625316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T21:31:21Z","timestamp":1755898281000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624918.3625316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"references-count":29,"alternative-id":["10.1145\/3624918.3625316","10.1145\/3624918"],"URL":"https:\/\/doi.org\/10.1145\/3624918.3625316","relation":{},"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"2023-11-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}