Applied & Human-Centered · Computer Science & AI
Information Retrieval
The newest papers in Information Retrieval that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
979 papers, from 4 September 2026 to 5 November 2026: 979 arXiv preprints.
Get the few papers worth your time in Information Retrieval every morning.
Follow Information Retrieval and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 14
UAE GovTrust Scope Filtering Gains and Routing Failures in Bilingual Public Service Retrieval
Public-service queries can mention several locations while only one controls the requested service.From archive to resource: bringing legacy data back to life at scale with large language models
Pharmaceutical companies maintain vast archives of legacy preclinical study reports that contain study-context details, such as fasting, anesthesia, and laboratory instrumentation, that are rarely…Every Edge Needs a Quote: Building a Quote-Grounded Knowledge Graph of Healthcare Software Adoption with Language-Model Agents
Hospitals regularly buy software that clinicians and patients depend on.Knowledge Distillation across Item and Code Spaces for Parallel Generative Recommendation
Generative recommendation with semantic IDs represents each item as a sequence of discrete codes derived from its semantic representation and predicts these codes to generate recommendations.Separating Thinking from Spelling for Efficient Generative Recommendation
Generative recommenders retrieve items by writing their semantic IDs (SIDs) code by code under trie-constrained beam search, an approach now deployed on large web platforms.How Much Fresh Data Should CTR Recalibration Use? A Temporal Evaluation of Post-hoc Calibration
Offline evaluation of click-through rate (CTR) models still defaults to random splits, although deployed models score future traffic and downstream systems consume calibrated probabilities.Holo-NN: Holographic Nearest Neighbor Search via Compressive Sensing
In the age of AI, privacy-preserving approximate nearest neighbor (ANN) search over high-dimensional embeddings has emerged as a critical yet frustratingly challenging domain, dominated by tradeoffs…Reinforcement Learning for Controller Parameters in the Auto-Bidding System at Pinterest
Auto-bidding systems in online advertising must balance competing objectives-maximizing budget delivery while minimizing cost per action-across heterogeneous campaigns under non-stationary market…Better Reasoning, Not Just Bigger Models: A Structure-Grounded Framework for Efficient and Reliable Inference
Scaling large language models has substantially improved linguistic fluency, yet reliable autonomous agents require more than fluent generation.The Fusion Tax: A Diagnostic Analysis of When Hybrid Retrieval Hurts
Hybrid retrieval, which fuses a sparse lexical retriever with a dense neural one, is widely recommended in the software documentation surveyed in September 2026, usually with reciprocal rank fusion…Compiling Autoregressive LLM Control into Policy-Exact Parallel Inference for Hierarchical RAG
Large language models increasingly act as controllers in structured decision pipelines, yet their decisions are still executed by autoregressive text decoding.OneLatent: Latent Reasoning for Efficient Foundation Recommendation Models
Large language models (LLMs) have demonstrated strong reasoning capabilities, motivating their use as the backbone of foundation recommendation models (FRMs).Lychee: Certified Screening of Inverted Lists for High-Recall Vector Search
Nearest-neighbor search over embedding vectors matches faces against watchlists, transactions against known fraud patterns, and medical images against confirmed cases, where a missed neighbor is a…Automated Enrichment Analysis with GraphRAG: Efficient Multi-Database ORA Extraction and Biological Interpretation
Over-representation analysis (ORA) is widely used to interpret gene-expression studies, but its outputs are often fragmented across gene-set databases and presented as flat term lists that obscure…Bezier-Guided Adaptive Flow for Cross-domain Sequential Recommendation
Cross-domain sequential recommendation aims to alleviate data sparsity and cold-start problems by transferring useful preference knowledge across domains.Lean Finder V2: Semantic Search for Mathlib That Disambiguates User Queries
We introduce Lean Finder V2, a semantic search framework for Mathlib that disambiguates user queries through complementary model-level adversarial training and input-level query rewriting.UserArena: Benchmarking Interactive User Simulation for Long-Horizon Shopping Agents
Agentic recommendation pursues shopper goals through sequences of context-dependent decisions.PAIR: Preference-Aligned Intent Retrieval for Premium People Recommendation at LinkedIn
General-purpose embeddings trained on profile similarity often misrank candidates in professional networks, where relevance is inherently complementary rather than symmetric.Formal-Informal Mathematical Alignment through and beyond Human Annotations
Formalized mathematics libraries such as Lean's \texttt{mathlib} provide machine-verifiable representations of mathematical knowledge, including definitions, theorems, and their relationships.Chunk Recomputation under Real Document Revisions: Measuring Update Cost and Retrieval Quality of Fixed, Recursive, and Content-Defined Chunking
Chunking strategies for retrieval-augmented generation are almost always evaluated on a static snapshot, yet the documents underlying a knowledge base continue to change.