GenCRF: Generative Clustering and Reformulation Framework for Enhanced Intent-Driven Information Retrieval

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Seo, Wonduk, Zhang, Haojie, Zhang, Yueyang, Zhang, Changhao, Duan, Songyao, Su, Lixin, Shi, Daiting, Zhao, Jiashu, Yin, Dawei
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910607115026432
author Seo, Wonduk
Zhang, Haojie
Zhang, Yueyang
Zhang, Changhao
Duan, Songyao
Su, Lixin
Shi, Daiting
Zhao, Jiashu
Yin, Dawei
author_facet Seo, Wonduk
Zhang, Haojie
Zhang, Yueyang
Zhang, Changhao
Duan, Songyao
Su, Lixin
Shi, Daiting
Zhao, Jiashu
Yin, Dawei
contents Query reformulation is a well-known problem in Information Retrieval (IR) aimed at enhancing single search successful completion rate by automatically modifying user's input query. Recent methods leverage Large Language Models (LLMs) to improve query reformulation, but often generate limited and redundant expansions, potentially constraining their effectiveness in capturing diverse intents. In this paper, we propose GenCRF: a Generative Clustering and Reformulation Framework to capture diverse intentions adaptively based on multiple differentiated, well-generated queries in the retrieval phase for the first time. GenCRF leverages LLMs to generate variable queries from the initial query using customized prompts, then clusters them into groups to distinctly represent diverse intents. Furthermore, the framework explores to combine diverse intents query with innovative weighted aggregation strategies to optimize retrieval performance and crucially integrates a novel Query Evaluation Rewarding Model (QERM) to refine the process through feedback loops. Empirical experiments on the BEIR benchmark demonstrate that GenCRF achieves state-of-the-art performance, surpassing previous query reformulation SOTAs by up to 12% on nDCG@10. These techniques can be adapted to various LLMs, significantly boosting retriever performance and advancing the field of Information Retrieval.
format Preprint
id arxiv_https___arxiv_org_abs_2409_10909
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle GenCRF: Generative Clustering and Reformulation Framework for Enhanced Intent-Driven Information Retrieval
Seo, Wonduk
Zhang, Haojie
Zhang, Yueyang
Zhang, Changhao
Duan, Songyao
Su, Lixin
Shi, Daiting
Zhao, Jiashu
Yin, Dawei
Information Retrieval
Artificial Intelligence
Computation and Language
Query reformulation is a well-known problem in Information Retrieval (IR) aimed at enhancing single search successful completion rate by automatically modifying user's input query. Recent methods leverage Large Language Models (LLMs) to improve query reformulation, but often generate limited and redundant expansions, potentially constraining their effectiveness in capturing diverse intents. In this paper, we propose GenCRF: a Generative Clustering and Reformulation Framework to capture diverse intentions adaptively based on multiple differentiated, well-generated queries in the retrieval phase for the first time. GenCRF leverages LLMs to generate variable queries from the initial query using customized prompts, then clusters them into groups to distinctly represent diverse intents. Furthermore, the framework explores to combine diverse intents query with innovative weighted aggregation strategies to optimize retrieval performance and crucially integrates a novel Query Evaluation Rewarding Model (QERM) to refine the process through feedback loops. Empirical experiments on the BEIR benchmark demonstrate that GenCRF achieves state-of-the-art performance, surpassing previous query reformulation SOTAs by up to 12% on nDCG@10. These techniques can be adapted to various LLMs, significantly boosting retriever performance and advancing the field of Information Retrieval.
title GenCRF: Generative Clustering and Reformulation Framework for Enhanced Intent-Driven Information Retrieval
topic Information Retrieval
Artificial Intelligence
Computation and Language
url https://arxiv.org/abs/2409.10909