Auditing Search Query Suggestion Bias Through Recursive Algorithm Interrogation

• URL: http://arxiv.org/abs/2601.02962v1
• Date: Tue, 06 Jan 2026 12:13:39 GMT
• Title: Auditing Search Query Suggestion Bias Through Recursive Algorithm Interrogation
• Abstract summary: This work presents a new, alternative approach to search query bias identification.<n>It includes less high-level suggestions to deepen the data basis of bias analyses.<n>Based on these suggestions, we investigate topical group bias in person-related searches in the political domain.
• Score: 5.490018587818889
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Despite their important role in online information search, search query suggestions have not been researched as much as most other aspects of search engines. Although reasons for this are multi-faceted, the sparseness of context and the limited data basis of up to ten suggestions per search query pose the most significant problem in identifying bias in search query suggestions. The most proven method to reduce sparseness and improve the validity of bias identification of search query suggestions so far is to consider suggestions from subsequent searches over time for the same query. This work presents a new, alternative approach to search query bias identification that includes less high-level suggestions to deepen the data basis of bias analyses. We employ recursive algorithm interrogation techniques and create suggestion trees that enable access to more subliminal search query suggestions. Based on these suggestions, we investigate topical group bias in person-related searches in the political domain.

Related papers

• Diagnosing Search Behavior and Failure Modes in Long-Horizon Search Agents [63.2133766267587]
  Deep search agents answer difficult information-seeking questions by iteratively issuing search queries to gather supporting evidence.<n>We study these questions through a trajectory-level diagnosis of long-horizon search agents.<n>We evaluate the evidence retrieved at each search step and separate two stages of agent behavior: what evidence an agent retrieves and how effectively it uses that evidence.
  arXiv  Detail & Related papers  (2026-08-03T08:46:48Z)
• R$^2$-Searcher: Calibrating Retrieval and Reasoning Boundaries for Agentic Search [59.034878430183305]
  R$2$-Searcher explicitly explores and calibrates the retrieval and reasoning boundaries.<n>We show that R$2$-Searcher significantly outperforms state-of-the-art agentic search methods in answer accuracy and retrieval-reasoning quality.
  arXiv  Detail & Related papers  (2026-06-26T19:44:34Z)
• SmartSearch: Process Reward-Guided Query Refinement for Search Agents [63.46067892354375]
  Large language model (LLM)-based search agents have proven promising for addressing knowledge-intensive problems.<n>Existing works largely focus on optimizing the reasoning paradigms of search agents, yet the quality of intermediate search queries during reasoning remains overlooked.<n>We introduce SmartSearch, a framework built upon two key mechanisms to mitigate this issue.
  arXiv  Detail & Related papers  (2026-01-08T12:39:05Z)
• Adaptive Retrieval for Reasoning-Intensive Retrieval [60.30588731127791]
  Bridge documents are those that contribute to the reasoning process but are not directly relevant to the initial query.<n>Existing reasoning-based reranker pipelines attempt to surface these documents in ranking, they suffer from bounded recall.<n>We propose a framework that bridges this gap by repurposing reasoning plans as dense feedback signals for adaptive retrieval.
  arXiv  Detail & Related papers  (2026-01-08T05:46:50Z)
• Perception-Aware Bias Detection for Query Suggestions [5.490018587818889]
  This paper adds on the bias detection pipeline for bias detection in query suggestions of person-related search.<n>The sparseness and lack of contextual metadata of query suggestions make them a difficult subject for bias detection.
  arXiv  Detail & Related papers  (2026-01-07T09:21:59Z)
• AdaSearch: Balancing Parametric Knowledge and Search in Large Language Models via Reinforcement Learning [61.974530499621274]
  Overreliance on search introduces unnecessary cost and risks exposure to noisy or malicious content.<n>We propose a two-stage, outcome-driven RL framework that disentangles problem solving from the decision of whether to invoke search.<n>AdaSearch substantially improves knowledge-boundary awareness, reduces unnecessary search calls, preserves strong task performance, and offers more transparent, interpretable decision behaviors.
  arXiv  Detail & Related papers  (2025-12-18T18:50:01Z)
• Search Plurality [0.5076419064097734]
  We argue that the concept of prioritization warrants scrutiny, along with the consistent hierarchical ordering that underlies this lack of neutrality.<n>We introduce the term Search Plurality to encapsulate the idea of emphasizing the various means a query can be approached.<n>This is demonstrated in a design that prioritizes the display of categories over specific search items, helping users grasp the breadth of their search.
  arXiv  Detail & Related papers  (2025-01-02T00:28:33Z)
• Investigating Bias in Political Search Query Suggestions by Relative Comparison with LLMs [1.5356574175312299]
  bias in search query suggestions can lead to exposure to biased search results and can impact opinion formation. We use a multi-step approach to identify and quantify bias in English search query suggestions. We apply our approach to the U.S. political news domain and compare bias in Google and Bing.
  arXiv  Detail & Related papers  (2024-10-31T12:40:38Z)
• RethinkMCTS: Refining Erroneous Thoughts in Monte Carlo Tree Search for Code Generation [71.88883580383039]
  We propose RethinkMCTS, a framework that explores and refines the reasoning process for code generation.<n>Specifically, we employ MCTS to search for thoughts before code generation and integrate MCTS with a refinement mechanism called rethink.<n>We demonstrate that RethinkMCTS outperforms previous search-based and feedback-enhanced code generation baselines.
  arXiv  Detail & Related papers  (2024-09-15T02:07:28Z)
• Counterfactual Learning To Rank for Utility-Maximizing Query Autocompletion [40.31426350180036]
  We propose a new approach that explicitly optimize the query suggestions for downstream retrieval performance. We formulate this as a problem of ranking a set of rankings, where each query suggestion is represented by the downstream item ranking it produces. We then present a learning method that ranks query suggestions by the quality of their item rankings.
  arXiv  Detail & Related papers  (2022-04-22T21:40:51Z)
• Exposing Query Identification for Search Transparency [69.06545074617685]
  We explore the feasibility of approximate exposing query identification (EQI) as a retrieval task by reversing the role of queries and documents in two classes of search systems. We derive an evaluation metric to measure the quality of a ranking of exposing queries, as well as conducting an empirical analysis focusing on various practical aspects of approximate EQI.
  arXiv  Detail & Related papers  (2021-10-14T20:19:27Z)
• High Quality Related Search Query Suggestions using Deep Reinforcement Learning [0.15229257192293202]
  "High Quality Related Search Query Suggestions" task aims at recommending search queries which are real, accurate, diverse, relevant and engaging. We train a Deep Reinforcement Learning model to predict the query a user would enter next. The reward signal is composed of long-term session-based user feedback, syntactic relatedness and estimated naturalness of generated query.
  arXiv  Detail & Related papers  (2021-08-10T05:22:32Z)
• Searching for a Search Method: Benchmarking Search Algorithms for Generating NLP Adversarial Examples [10.993342896547691]
  We study the behavior of several black-box search algorithms used for generating adversarial examples for natural language processing (NLP) tasks. We perform a fine-grained analysis of three elements relevant to search: search algorithm, search space, and search budget.
  arXiv  Detail & Related papers  (2020-09-09T17:04:42Z)
• On the Social and Technical Challenges of Web Search Autosuggestion Moderation [118.47867428272878]
  Autosuggestions are typically generated by machine learning (ML) systems trained on a corpus of search logs and document representations. While current search engines have become increasingly proficient at suppressing such problematic suggestions, there are still persistent issues that remain. We discuss several dimensions of problematic suggestions, difficult issues along the pipeline, and why our discussion applies to the increasing number of applications beyond web search.
  arXiv  Detail & Related papers  (2020-07-09T19:22:00Z)
• Best-First Beam Search [78.71330480725668]
  We show that the standard implementation of beam search can be made up to 10x faster in practice. We propose a memory-reduced variant of Best-First Beam Search, which has a similar beneficial search bias in terms of downstream performance.
  arXiv  Detail & Related papers  (2020-07-08T05:56:01Z)

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.