Query-aware Tip Generation for Vertical Search

• URL: http://arxiv.org/abs/2010.09254v1
• Date: Mon, 19 Oct 2020 06:48:40 GMT
• Title: Query-aware Tip Generation for Vertical Search
• Abstract summary: Existing work on tip generation does not take query into consideration, which limits the impact of tips in search scenarios. This paper proposes a query-aware tip generation framework, integrating query information into encoding and subsequent decoding processes. The framework consistently outperforms the competing methods on both public and real-world industrial datasets.
• Score: 42.83771233373902
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As a concise form of user reviews, tips have unique advantages to explain the search results, assist users' decision making, and further improve user experience in vertical search scenarios. Existing work on tip generation does not take query into consideration, which limits the impact of tips in search scenarios. To address this issue, this paper proposes a query-aware tip generation framework, integrating query information into encoding and subsequent decoding processes. Two specific adaptations of Transformer and Recurrent Neural Network (RNN) are proposed. For Transformer, the query impact is incorporated into the self-attention computation of both the encoder and the decoder. As for RNN, the query-aware encoder adopts a selective network to distill query-relevant information from the review, while the query-aware decoder integrates the query information into the attention computation during decoding. The framework consistently outperforms the competing methods on both public and real-world industrial datasets. Last but not least, online deployment experiments on Dianping demonstrate the advantage of the proposed framework for tip generation as well as its online business values.

Related papers

• Hypencoder Revisited: Reproducibility and Analysis of Non-Linear Scoring for First-Stage Retrieval [12.49873774352119]
  The Hypencoder is a retrieval framework that replaces the fixed inner-product scoring function used in standard bi-encoders with a query-specific neural network.<n>We conduct a study of the Hypencoder and extend the original analysis in three directions.
  arXiv  Detail & Related papers  (2026-04-29T17:05:53Z)
• OneSearch-V2: The Latent Reasoning Enhanced Self-distillation Generative Search Framework [41.83974943844478]
  Generative Retrieval (GR) has emerged as a promising paradigm for modern search systems.<n>OneSearch, as a representative industrial-scale deployed generative search framework, has brought significant commercial and operational benefits.<n>We propose textbfOneSearch-V2, a latent reasoning enhanced self-distillation generative search framework.
  arXiv  Detail & Related papers  (2026-03-25T15:33:34Z)
• Rethinking Deep Research from the Perspective of Web Content Distribution Matching [86.90255285277256]
  We propose WeDas, a Web Content Distribution Aware framework that incorporates search-space structural characteristics into the agent's observation space.<n>We introduce a few-shot probing mechanism that iteratively estimates the Query-Result Alignment Score.<n>As a plug-and-play module, WeDas consistently improves sub-goal completion and accuracy across four benchmarks.
  arXiv  Detail & Related papers  (2026-03-07T14:51:17Z)
• Hypencoder: Hypernetworks for Information Retrieval [20.173669986209024]
  We use a small neural network that acts as a learned query-specific relevance function. We show that our model is able to retrieve from a corpus of 8.8M documents in under 60 milliseconds.
  arXiv  Detail & Related papers  (2025-02-07T22:31:38Z)
• Unsupervised Query Routing for Retrieval Augmented Generation [64.47987041500966]
  We introduce a novel unsupervised method that constructs the "upper-bound" response to evaluate the quality of retrieval-augmented responses. This evaluation enables the decision of the most suitable search engine for a given query. By eliminating manual annotations, our approach can automatically process large-scale real user queries and create training data.
  arXiv  Detail & Related papers  (2025-01-14T02:27:06Z)
• Improving Retrieval in Sponsored Search by Leveraging Query Context Signals [6.152499434499752]
  We propose an approach to enhance query understanding by augmenting queries with rich contextual signals. We use web search titles and snippets to ground queries in real-world information and utilize GPT-4 to generate query rewrites and explanations. Our context-aware approach substantially outperforms context-free models.
  arXiv  Detail & Related papers  (2024-07-19T14:28:53Z)
• Building Interpretable and Reliable Open Information Retriever for New Domains Overnight [67.03842581848299]
  Information retrieval is a critical component for many down-stream tasks such as open-domain question answering (QA) We propose an information retrieval pipeline that uses entity/event linking model and query decomposition model to focus more accurately on different information units of the query. We show that, while being more interpretable and reliable, our proposed pipeline significantly improves passage coverages and denotation accuracies across five IR and QA benchmarks.
  arXiv  Detail & Related papers  (2023-08-09T07:47:17Z)
• Improving Text Matching in E-Commerce Search with A Rationalizable, Intervenable and Fast Entity-Based Relevance Model [78.80174696043021]
  We propose a novel model called the Entity-Based Relevance Model (EBRM) The decomposition allows us to use a Cross-encoder QE relevance module for high accuracy. We also show that pretraining the QE module with auto-generated QE data from user logs can further improve the overall performance.
  arXiv  Detail & Related papers  (2023-07-01T15:44:53Z)
• When Search Meets Recommendation: Learning Disentangled Search Representation for Recommendation [56.98380787425388]
  We propose a search-Enhanced framework for the Sequential Recommendation (SESRec) SESRec disentangling similar and dissimilar representations within S&R behaviors. Experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2023-05-18T09:04:50Z)
• Noise-Robust Dense Retrieval via Contrastive Alignment Post Training [89.29256833403167]
  Contrastive Alignment POst Training (CAPOT) is a highly efficient finetuning method that improves model robustness without requiring index regeneration. CAPOT enables robust retrieval by freezing the document encoder while the query encoder learns to align noisy queries with their unaltered root. We evaluate CAPOT noisy variants of MSMARCO, Natural Questions, and Trivia QA passage retrieval, finding CAPOT has a similar impact as data augmentation with none of its overhead.
  arXiv  Detail & Related papers  (2023-04-06T22:16:53Z)
• Decoding a Neural Retriever's Latent Space for Query Suggestion [28.410064376447718]
  We show that it is possible to decode a meaningful query from its latent representation and, when moving in the right direction in latent space, to decode a query that retrieves the relevant paragraph. We employ the query decoder to generate a large synthetic dataset of query reformulations for MSMarco. On this data, we train a pseudo-relevance feedback (PRF) T5 model for the application of query suggestion.
  arXiv  Detail & Related papers  (2022-10-21T16:19:31Z)
• Featurized Query R-CNN [41.40318163261041]
  We present featurized object queries predicted by a query generation network in the Faster R-CNN framework. Our Featurized Query R-CNN obtains the best speed-accuracy trade-off among all R-CNN detectors, including the recent state-of-the-art Sparse R-CNN detector.
  arXiv  Detail & Related papers  (2022-06-13T15:40:19Z)
• Query Rewriting via Cycle-Consistent Translation for E-Commerce Search [13.723266150864037]
  We propose a novel deep neural network based approach to query rewriting. We formulate query rewriting into a cyclic machine translation problem. We introduce a novel cyclic consistent training algorithm in conjunction with state-of-the-art machine translation models.
  arXiv  Detail & Related papers  (2021-03-01T06:47:12Z)
• Incorporating Behavioral Hypotheses for Query Generation [3.5873361386290643]
  We propose a generic encoder-decoder Transformer framework to aggregate arbitrary hypotheses of choice for query generation. Our experimental results show that the proposed approach leads to significant improvements on top-$k$ word error rate and Bert F1 Score.
  arXiv  Detail & Related papers  (2020-10-06T12:38:02Z)
• Convolutional Hierarchical Attention Network for Query-Focused Video Summarization [74.48782934264094]
  This paper addresses the task of query-focused video summarization, which takes user's query and a long video as inputs. We propose a method, named Convolutional Hierarchical Attention Network (CHAN), which consists of two parts: feature encoding network and query-relevance computing module. In the encoding network, we employ a convolutional network with local self-attention mechanism and query-aware global attention mechanism to learns visual information of each shot.
  arXiv  Detail & Related papers  (2020-01-31T04:30:14Z)

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.