Min Pan , Shuting Zhou , Jinguang Chen , Ellen Anne Huang , Jimmy X. Huang
{"title":"A semantic framework for enhancing pseudo-relevance feedback with soft negative sampling and contrastive learning","authors":"Min Pan , Shuting Zhou , Jinguang Chen , Ellen Anne Huang , Jimmy X. Huang","doi":"10.1016/j.ipm.2024.104058","DOIUrl":null,"url":null,"abstract":"<div><div>In the field of information Retrieval (IR), Pseudo-relevance feedback (PRF) and Query Expansion (QE) techniques have garnered significant attention for their efficacy in enhancing retrieval effectiveness. However, traditional PRF approaches predominantly concentrate solely on pseudo-relevant documents identified during the initial retrieval stage, neglecting the rich semantic information embedded within non-pseudo-relevant documents. This paper introduces an innovative PRF model that integrates soft negative samples and contrastive learning to address this limitation, aiming for a more comprehensive capture and representation of semantics. First, we employ the BM25 algorithm as the baseline retrieval mechanism to accurately pinpoint pseudo-relevant documents from the first stage retrieval and assign weights to their terms. Second, a contrastive learning strategy is introduced to distill semantic features from all documents globally, further refining the semantic weights of terms. To mitigate the risk of information loss associated with soft negative samples, we ingeniously leverage the statistical properties of kernel function to precisely gauge the co-occurrence frequencies between terms, ensuring the preservation of core information and thus obtaining kernel function term co-occurrence weights. Third, we select semantically related terms highly relevant to the query for creating an optimized query by balancing these three weight distributions. Extensive empirical analyses conducted on several TREC datasets demonstrate the practical feasibility of our proposed model. It outperforms baseline models and state-of-the-art technologies on core evaluation metrics such as MAP, P@10, NDCG, and MRR. Deeper comparative experiments and case studies reveal that the expansion terms generated by our model exhibits a deeper level of semantic coherence with the original query, underscoring the dual advantages of the model in both theory and practice. In summary, the model presented herein not only opens a new path at the technical level, but also provides a more accurate and efficient solution for real-world applications in IR.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 3","pages":"Article 104058"},"PeriodicalIF":7.4000,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324004175","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In the field of information Retrieval (IR), Pseudo-relevance feedback (PRF) and Query Expansion (QE) techniques have garnered significant attention for their efficacy in enhancing retrieval effectiveness. However, traditional PRF approaches predominantly concentrate solely on pseudo-relevant documents identified during the initial retrieval stage, neglecting the rich semantic information embedded within non-pseudo-relevant documents. This paper introduces an innovative PRF model that integrates soft negative samples and contrastive learning to address this limitation, aiming for a more comprehensive capture and representation of semantics. First, we employ the BM25 algorithm as the baseline retrieval mechanism to accurately pinpoint pseudo-relevant documents from the first stage retrieval and assign weights to their terms. Second, a contrastive learning strategy is introduced to distill semantic features from all documents globally, further refining the semantic weights of terms. To mitigate the risk of information loss associated with soft negative samples, we ingeniously leverage the statistical properties of kernel function to precisely gauge the co-occurrence frequencies between terms, ensuring the preservation of core information and thus obtaining kernel function term co-occurrence weights. Third, we select semantically related terms highly relevant to the query for creating an optimized query by balancing these three weight distributions. Extensive empirical analyses conducted on several TREC datasets demonstrate the practical feasibility of our proposed model. It outperforms baseline models and state-of-the-art technologies on core evaluation metrics such as MAP, P@10, NDCG, and MRR. Deeper comparative experiments and case studies reveal that the expansion terms generated by our model exhibits a deeper level of semantic coherence with the original query, underscoring the dual advantages of the model in both theory and practice. In summary, the model presented herein not only opens a new path at the technical level, but also provides a more accurate and efficient solution for real-world applications in IR.
期刊介绍:
Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing.
We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.