{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:22:27Z","timestamp":1760314947185,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032079589","type":"print"},{"value":"9783032079596","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-07959-6_17","type":"book-chapter","created":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T09:22:16Z","timestamp":1760260936000},"page":"231-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Retrieval Performance via\u00a0LLM Hard-Negative Filtering"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9466-7846","authenticated-orcid":false,"given":"Danil","family":"Tirskikh","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8992-9654","authenticated-orcid":false,"given":"Olesia","family":"Koroteeva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7010-1585","authenticated-orcid":false,"given":"Yuri","family":"Matveev","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6364-5445","authenticated-orcid":false,"given":"Ekaterina","family":"Brovkina","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8268-8918","authenticated-orcid":false,"given":"Larisa","family":"Gonchar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"issue":"6","key":"17_CR1","first-page":"1016","volume":"24","author":"SM Masliukhin","year":"2024","unstructured":"Masliukhin, S.M., Posokhov, P.A., Skrylnikov, S.S., Makhnytkina, O.V., Ivanovskaia, T.I.: Prompt-based multi-task learning for robust text retrieval. J. Sci. Tech. Inf. Technol. Mech. Opt. 24(6), 1016\u20131023 (2024)","journal-title":"J. Sci. Tech. Inf. Technol. Mech. Opt."},{"key":"17_CR2","first-page":"18661","volume":"33","author":"P Khosla","year":"2020","unstructured":"Khosla, P., et al.: Supervised contrastive learning. Adv. Neural. Inf. Process. Syst. 33, 18661\u201318673 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Sheng, X.-R., et al.: Joint optimization of ranking and calibration with contextualized hybrid model. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 4813\u20134822 (2023)","DOI":"10.1145\/3580305.3599851"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Karpukhin, V., et al.: Dense passage retrieval for open-domain question answering. In: EMNLP (1), pp. 6769\u20136781 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"17_CR5","unstructured":"Zhan, J., Mao, J., Liu, Y., Zhang, M., Ma, S.: RepBERT: contextualized text embeddings for first-stage retrieval. arXiv preprint arXiv:2006.15498 (2020)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., Ma, S.: Optimizing dense retrieval model training with hard negatives. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1503\u20131512 (2021)","DOI":"10.1145\/3404835.3462880"},{"key":"17_CR7","first-page":"8765","volume":"33","author":"C-Y Chuang","year":"2020","unstructured":"Chuang, C.-Y., Robinson, J., Lin, Y.-C., Torralba, A., Jegelka, S.: Debiased contrastive learning. Adv. Neural. Inf. Process. Syst. 33, 8765\u20138775 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Qu, Y., et al.: RocketQA: an optimized training approach to dense passage retrieval for open-domain question answering. arXiv preprint arXiv:2010.08191 (2020)","DOI":"10.18653\/v1\/2021.naacl-main.466"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Zhou, K., et al.: SimANS: simple ambiguous negatives sampling for dense text retrieval. arXiv preprint arXiv:2210.11773 (2022)","DOI":"10.18653\/v1\/2022.emnlp-industry.56"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Yang, Z., Shao, Z., Dong, Y., Tang, J.: TriSampler: a better negative sampling principle for dense retrieval. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 9269\u20139277 (2024)","DOI":"10.1609\/aaai.v38i8.28779"},{"key":"17_CR11","unstructured":"Gabriel de Souza, P.M., Osmulski, R., Xu, M., Ak, R., Schifferer, B., Oldridge, E.: NV-retriever: improving text embedding models with effective hard-negative mining. arXiv preprint arXiv:2407.15831 1 (2024)"},{"key":"17_CR12","unstructured":"Izacard, G., et al.: Unsupervised dense information retrieval with contrastive learning. arXiv preprint arXiv:2112.09118 (2021)"}],"container-title":["Lecture Notes in Computer Science","Speech and Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07959-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T09:22:20Z","timestamp":1760260940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07959-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,13]]},"ISBN":["9783032079589","9783032079596"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07959-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,13]]},"assertion":[{"value":"13 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPECOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Speech and Computer","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Szeged","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"specom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/specom.inf.u-szeged.hu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}