Query-oriented Data Augmentation for Session Search

• URL: http://arxiv.org/abs/2407.03720v1
• Date: Thu, 4 Jul 2024 08:08:33 GMT
• Title: Query-oriented Data Augmentation for Session Search
• Authors: Haonan Chen, Zhicheng Dou, Yutao Zhu, Ji-Rong Wen,
• Abstract summary: We propose query-oriented data augmentation to enrich search logs and empower the modeling. We generate supplemental training pairs by altering the most important part of a search context. We develop several strategies to alter the current query, resulting in new training data with varying degrees of difficulty.
• Score: 71.84678750612754
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Modeling contextual information in a search session has drawn more and more attention when understanding complex user intents. Recent methods are all data-driven, i.e., they train different models on large-scale search log data to identify the relevance between search contexts and candidate documents. The common training paradigm is to pair the search context with different candidate documents and train the model to rank the clicked documents higher than the unclicked ones. However, this paradigm neglects the symmetric nature of the relevance between the session context and document, i.e., the clicked documents can also be paired with different search contexts when training. In this work, we propose query-oriented data augmentation to enrich search logs and empower the modeling. We generate supplemental training pairs by altering the most important part of a search context, i.e., the current query, and train our model to rank the generated sequence along with the original sequence. This approach enables models to learn that the relevance of a document may vary as the session context changes, leading to a better understanding of users' search patterns. We develop several strategies to alter the current query, resulting in new training data with varying degrees of difficulty. Through experimentation on two extensive public search logs, we have successfully demonstrated the effectiveness of our model.

Related papers

• Aligning Query Representation with Rewritten Query and Relevance Judgments in Conversational Search [32.35446999027349]
  We leverage both rewritten queries and relevance judgments in the conversational search data to train a better query representation model. The proposed model -- Query Representation Alignment Conversational Retriever, QRACDR, is tested on eight datasets.
  arXiv  Detail & Related papers  (2024-07-29T17:14:36Z)
• Database-Augmented Query Representation for Information Retrieval [59.57065228857247]
  We present a novel retrieval framework called Database-Augmented Query representation (DAQu) DAQu augments the original query with various (query-related) metadata across multiple tables. We validate DAQu in diverse retrieval scenarios that can incorporate metadata from the relational database.
  arXiv  Detail & Related papers  (2024-06-23T05:02:21Z)
• Improving Topic Relevance Model by Mix-structured Summarization and LLM-based Data Augmentation [16.170841777591345]
  In most social search scenarios such as Dianping, modeling search relevance always faces two challenges. We first take queryd with the query-based summary and the document summary without query as the input of topic relevance model. Then, we utilize the language understanding and generation abilities of large language model (LLM) to rewrite and generate query from queries and documents in existing training data.
  arXiv  Detail & Related papers  (2024-04-03T10:05:47Z)
• SSP: Self-Supervised Post-training for Conversational Search [63.28684982954115]
  We propose fullmodel (model) which is a new post-training paradigm with three self-supervised tasks to efficiently initialize the conversational search model. To verify the effectiveness of our proposed method, we apply the conversational encoder post-trained by model on the conversational search task using two benchmark datasets: CAsT-19 and CAsT-20.
  arXiv  Detail & Related papers  (2023-07-02T13:36:36Z)
• Learning to Relate to Previous Turns in Conversational Search [26.931718474500652]
  An effective way to improve retrieval effectiveness is to expand the current query with historical queries. We propose a new method to select relevant historical queries that are useful for the current query.
  arXiv  Detail & Related papers  (2023-06-05T03:00:10Z)
• Automated Query Generation for Evidence Collection from Web Search Engines [2.642698101441705]
  It is widely accepted that so-called facts can be checked by searching for information on the Internet. This process requires a fact-checker to formulate a search query based on the fact and to present it to a search engine. We ask the question as to whether it is possible to automate the first step, that of query generation.
  arXiv  Detail & Related papers  (2023-03-15T14:32:00Z)
• CAPSTONE: Curriculum Sampling for Dense Retrieval with Document Expansion [68.19934563919192]
  We propose a curriculum sampling strategy that utilizes pseudo queries during training and progressively enhances the relevance between the generated query and the real query. Experimental results on both in-domain and out-of-domain datasets demonstrate that our approach outperforms previous dense retrieval models.
  arXiv  Detail & Related papers  (2022-12-18T15:57:46Z)
• UniKGQA: Unified Retrieval and Reasoning for Solving Multi-hop Question Answering Over Knowledge Graph [89.98762327725112]
  Multi-hop Question Answering over Knowledge Graph(KGQA) aims to find the answer entities that are multiple hops away from the topic entities mentioned in a natural language question. We propose UniKGQA, a novel approach for multi-hop KGQA task, by unifying retrieval and reasoning in both model architecture and parameter learning.
  arXiv  Detail & Related papers  (2022-12-02T04:08:09Z)
• From Easy to Hard: A Dual Curriculum Learning Framework for Context-Aware Document Ranking [41.8396866002968]
  We propose a curriculum learning framework for context-aware document ranking. We aim to guide the model gradually toward a global optimum. Experiments on two real query log datasets show that our proposed framework can improve the performance of several existing methods significantly.
  arXiv  Detail & Related papers  (2022-08-22T12:09:12Z)
• Progressive Learning for Image Retrieval with Hybrid-Modality Queries [48.79599320198615]
  Image retrieval with hybrid-modality queries, also known as composing text and image for image retrieval (CTI-IR) We decompose the CTI-IR task into a three-stage learning problem to progressively learn the complex knowledge for image retrieval with hybrid-modality queries. Our proposed model significantly outperforms state-of-the-art methods in the mean of Recall@K by 24.9% and 9.5% on the Fashion-IQ and Shoes benchmark datasets respectively.
  arXiv  Detail & Related papers  (2022-04-24T08:10:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.