Jul 2026· Annual International ACM SIGIR Conference on Research and Development in Information Retrieval· pp. 5332-5335· 1 citation· 50 references
Computer Science
TL;DR
This tutorial first articulates a working definition of reasoning within the context of information retrieval and derives from it a unified analytical framework, which maps existing approaches along axes that reflect the core components of the definition.
Abstract
Information retrieval has long focused on ranking documents by semantic relatedness. Yet many real-world information needs demand more: enforcement of logical constraints, multi-step inference, and synthesis of multiple pieces of evidence. Addressing these requirements is, at its core, a problem of reasoning. Across AI communities, researchers are developing diverse solutions for the problem of reasoning, from inference-time strategies and post-training of LLMs, to neuro-symbolic systems, Bayesian and probabilistic frameworks, geometric representations, and energy-based models. These efforts target the same problem: to move beyond pattern-matching systems toward structured, verifiable inference. However, they remain scattered across disciplines, making it difficult for IR researchers to identify the most relevant ideas and opportunities. To help navigate the fragmented landscape of research in reasoning, this tutorial first articulates a working definition of reasoning within the context of information retrieval and derives from it a unified analytical framework. The framework maps existing approaches along axes that reflect the core components of the definition. By providing a comprehensive overview of recent approaches and mapping current methods onto the defined axes, we expose their trade-offs and complementarities, highlight where IR can benefit from cross-disciplinary advances, and illustrate how retrieval process itself can play a central role in broader reasoning systems. The tutorial will equip participants with both a conceptual framework and practical guidance for enhancing reasoning-capable IR systems, while situating IR as a domain that both benefits and contributes to the broader development of reasoning methodologies.
Large language models (LLMs) have transformed AI, yet they remain fundamentally limited by hallucination, unverifiable reasoning, and shallow evidence grounding. We argue that structure mining-rooted in decades of KDD research on taxonomy induction, ontology design, entity typing, and knowledge graph construction-is the key to overcoming these limitations. This tutorial presents a unified vision in which structuring serves as the enabling foundation for three pillars of next-generation LLM systems: (1) Structured Retrieval, where organizing corpora into ontology-guided multidimensional representations enables SQL-like queries that achieve substantially more precise and complete retrieval than similarity-based approaches; (2) Structured Reasoning, where grounding each inference step in typed, graph-structured evidence transforms opaque generation into auditable, verifiable reasoning chains; and (3) Structured Agent Memory, where multi-dimensional memory architectures bridge external corpus knowledge and experiential agent knowledge through a mutually enriching dual-memory design. Across all three pillars, we highlight how the cooperative interplay between classical KDD techniques and modern LLMs-where KDD defines structural schemas and quality constraints while LLMs execute flexible extraction and reasoning-creates systems that are more reliable, interpretable, and faithful. The tutorial covers both foundational methods and the latest advances (2024--2026), and concludes with open problems and future research directions at the intersection of data mining and LLMs.
Pengcheng Jiang, Jiashuo Sun, Wonbin Kweon et al.· Proceedings of the 32nd ACM...· 0 citations
For decades, search and recommendation systems have been optimized as distinct components within large-scale discovery platforms. The rise of generative AI is beginning to blur this boundary. At Spotify, we are exploring how large language models can evolve from tools that retrieve content into systems that reason over users, catalogs, and intent, while remaining steerable through natural language and user interaction. This talk presents lessons from deploying and studying generative retrieval and recommendation systems across Spotify's content ecosystem. I will describe how semantic identifiers enable language models to operate directly over large, heterogeneous catalogs, allowing search, recommendation, retrieval, explanation, and user understanding to be expressed within a common generative framework. I will discuss recent work on production-scale podcast discovery, language-steerable recommendation, and the NEO framework for unifying search, recommendation, and reasoning across multiple content types. These systems demonstrate how grounding language models in catalog entities and user behavior can improve discovery while preserving the flexibility of natural-language interaction. More broadly, they suggest a path toward discovery systems in which retrieval, recommendation, and reasoning are no longer separate stages, but capabilities of a shared generative model. Beyond model frameworks, I will discuss the emerging challenges of alignment and evaluation in discovery systems. Unlike traditional retrieval problems, generative recommendation often has many valid answers. I will present approaches for learning from large-scale behavioral signals, preference-aware optimization, and profile-aware LLM-as-a-judge evaluation, along with lessons from online experimentation at Spotify. These experiences suggest that future discovery systems will require new forms of personalization, controllability, and evaluation that extend beyond conventional ranking metrics. I will conclude with a research agenda for generative discovery systems, including language-steerable interfaces, unified retrieval-and-reasoning models, preference-aligned generation, and evaluation frameworks designed to measure user-specific relevance at scale. As search, recommendation, and conversational AI continue to converge, these directions point toward a new generation of discovery systems that can understand intent, reason over large catalogs, and help users navigate increasingly complex information spaces.
Paul N. Bennett· Proceedings of the 32nd ACM...· 0 citations
This work presents a novel framework that operationalizes explicit reasoning as a control mechanism for LLM-based relevance judgements and systematically quantifies its effects across evaluation settings, suggesting that its benefits depend on task context and complexity rather than being universally beneficial.
Louis Geiger, Danula Hettiachchi, Falk Scholer et al.· International Conference on...· 0 citations
Effective in-context learning (ICL) for complex reasoning relies on selecting the right demonstrations. Traditional retrieval methods based on surface similarity fail to capture the underlying problem-solving logic. Recent logic-based methods address this by matching predefined reasoning steps, but the rigid rules and exact-match criteria is improper to handle flexible or diverse reasoning processes. To address the problem, we propose SALA, a Semantic-Aware Logical Alignment framework. Instead of relying on a fixed inventory, SALA automatically learns task-specific reasoning operations. It then embeds these operations into a continuous semantic space and uses dynamic time warping (DTW) to align the reasoning sequences. This approach allows for soft, flexible matching of reasoning logic while remaining highly interpretable. Experiments across four reasoning benchmarks and three LLMs demonstrate that SALA outperforms existing demonstration selection methods. Further analysis confirms the roles of the operation induction and the logical semantic alignment.
Zhao-Jin Ji, Wenqing Chen, Zhi-Xuan Chu et al.· 0 citations
Modern LLMs excel at reasoning and instruction following, enabling users to express complex and diverse information needs. However, conventional retrievers largely rely on surface-level matching between queries and documents, resulting in a growing gap between how users express their needs and how retrievers interpret them. In this paper, we present GEM, a generative embedding model that augments retrieval through its own knowledge by explicitly reasoning about user intent and relevance criteria. GEM unifies generation and embedding within a single model: it first reasons over the query, then appends an embedding token to encode the enriched context for retrieval. Evaluated on reasoning-intensive and instruction-following retrieval tasks, GEM demonstrates the effectiveness of its reasoning-augmented retrieval, outperforming its non-reasoning variant and matching baselines using substantially larger models. Furthermore, GEM's generative nature allows test-time compute scaling via prompting to further enhance retrieval performance. Our code is available at: https://anonymous.4open.science/r/GEM.
Reasoning-intensive temporal retrieval requires matching a query to documents whose relevance depends on shared temporal reasoning rather than lexical overlap. Expanding a query into several reformulations that make its temporal intent explicit, and retrieving with each, supplies this reasoning, but fusing the resulting rankings with equal weights wastes accuracy: for any single query, only some reformulations are reliable. We propose query-difficulty-gated fusion of reasoning views. From each view we read an eight-dimensional signature of its score distribution, built from query-performance-prediction quantities such as softmax entropy, score gaps, and dispersion, and a gate of roughly one thousand parameters maps these signatures to per-query view weights. The fused ranking uses no relevance labels at inference, no re-ranking, and no fine-tuning of the retriever; the gate is trained leave-one-task-out. On the \textsc{Tempo} benchmark, the method improves all six retrievers we evaluate, from BERT encoders to 7B decoder retrievers, with the largest gains on the weaker backbones. The strongest retrievers reach $0.297$ and $0.303$ nDCG@10, and the per-query gain over the original query is significant under a paired bootstrap ($p<0.001$). A per-query oracle reaches $0.364$ against our realized $0.297$, exposing headroom that identifies per-query view selection as a concrete next step.
J. Holdcroft, Abdelrahman Abdallah, Adam Jatowt· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
