mlsanityData to 7 Oct 2026

Improving Content Retrievability in Search with Controllable Query Generation

arXiv 2303.11648 ↗First posted 21 Mar 2023cs.IR cs.CL cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

An important goal of online platforms is to enable content discovery, i.e. allow users to find a catalog entity they were not familiar with. A pre-requisite to discover an entity, e.g. a book, with a search engine is that the entity is retrievable, i.e. there are queries for which the system will surface such entity in the top results. However, machine-learned search engines have a high retrievability bias, where the majority of the queries return the same entities. This happens partly due to the predominance of narrow intent queries, where users create queries using the title of an already known entity, e.g. in book search 'harry potter'. The amount of broad queries where users want to discover new entities, e.g. in music search 'chill lyrical electronica with an atmospheric feeling to it', and have a higher tolerance to what they might find, is small in comparison. We focus here on two factors that have a negative impact on the retrievability of the entities (I) the training data used for dense retrieval models and (II) the distribution of narrow and broad intent queries issued in the system. We propose CtrlQGen, a method that generates queries for a chosen underlying intent-narrow or broad. We can use CtrlQGen to improve factor (I) by generating training data for dense retrieval models comprised of diverse synthetic queries. CtrlQGen can also be used to deal with factor (II) by suggesting queries with broader intents to users. Our results on datasets from the domains of music, podcasts, and books reveal that we can significantly decrease the retrievability bias of a dense retrieval model when using CtrlQGen. First, by using the generated queries as training data for dense models we make 9% of the entities retrievable (go from zero to non-zero retrievability). Second, by suggesting broader queries to users, we can make 12% of the entities retrievable in the best case.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 19 of its 67 references that are in the map. First posted on arXiv 21 Mar 2023.

Builds on

19 of 67 references.

References · 19

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  4. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
  5. 2020MPNet: Masked and Permuted Pre-training for Language Understandingcited by 973
  6. 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 266
  7. 2022Promptagator: Few-shot Dense Retrieval From 8 Examplescited by 233
  8. 2019Document Expansion by Query Predictioncited by 225
  9. 2021GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrievalcited by 119
  10. 2022Bridging the Gap Between Indexing and Retrieval for Differentiable Search Index with Query Generationcited by 47
  11. 2021Evaluating the Robustness of Retrieval Pipelines with Query Variation Generatorscited by 33
  12. 2020Declarative Experimentation in Information Retrieval using PyTerriercited by 29
7 more
  1. 2020Embedding-based Zero-shot Retrieval through Query Generationcited by 24
  2. 2021TREC 2020 Podcasts Track Overviewcited by 13
  3. 2018One Deep Music Representation to Rule Them All? : A comparative analysis of different representation learning strategiescited by 7
  4. 2018Boosting Search Performance Using Query Variationscited by 2
  5. 2021Exposing Query Identification for Search Transparencycited by 2
  6. 2013Discovering Latent Patterns from the Analysis of User-Curated Movie Listscited by 1
  7. 2022Studying Retrievability of Publications and Datasets in an Integrated Retrieval Systemcited by 1

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 3; 2025: 1.

6 papers.