Papers for

search engine teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Instruction following retrieval improves with natural hard negatives

Natural Hard-Negative Mining from Positives for Instruction-Following Retrieval

Abstract: Instruction-following information retrieval (IFIR) requires retrievers to rank documents by both a query and its instance-specific instructions, yet instruction-conditioned contrastive supervision remains scarce. Existing synthetic methods typically fix a positive passage and generate additional negatives, overlooking the hard-negative potential of the original positive. We propose Natural Hard-Negative Mining (NHNM), which promotes convertible negatives under query-compatible instructions and repurposes original positives as natural instruction hard negatives. Its automated Candidate Cleaning, Reversal Construction, and Geometry Filtering pipeline produces compact, high-contrast supervision aligned with the pretrained retrieval space. Applied to MSMARCO, NHNM yields NHNM-MARCO, an IFIR training set of nearly 7K instances. On InstructIR and FollowIR, models with 568M to 4B parameters fine-tuned on NHNM-MARCO achieve strong instruction-following performance and match or surpass substantially larger retrievers in several settings. Controlled analyses and ablations attribute these gains to natural hard-negative supervision rather than model scale or training-data volume.

Tue 27 OctArtificial Intelligence
The gist
Finding relevant documents based on specific instructions is hard because there are few ways to teach machines to distinguish subtle differences. The authors found that using original documents as tricky negative examples, rather than just generating synthetic ones, helps models learn better. They created an automated process to find these natural hard negatives and used it to produce a new training set. Models trained on this data performed better at following detailed search instructions, even competing with much larger systems.
Open → 2610.36900v1

New method improves image and long text matching by balancing key and background details

Mitigating Saliency Collapse: Robust Saliency-Aware Long-Text Image-Text Alignment

Abstract: Long-text image-text alignment is essential for fine-grained scene understanding, yet existing methods mainly focus on extending context length or improving local alignment. We identify an overlooked failure mode, saliency collapse, where models over-rely on text that features visual prominence while underutilizing non-salient context. Consequently, retrieval performance degrades sharply when salient content is reduced, despite that the non-salient context remains informative. To address this, we propose RoSA, a saliency-aware finetuning framework that decomposes image-text pairs into complementary salient and contextual views, enabling joint learning of prominent and contextual semantics. We propose a modality-independent decomposition strategy to combine object-level visual saliency estimation with LLM-based text decomposition to bridge vision and language. We employ auxiliary objectives to explicitly align these views, ensuring robust representation with both salient and contextual features. RoSA greatly improves long-text retrieval and demonstrates strong robustness to saliency collapse across benchmarks. Moreover, our auxiliary objectives are plug-and-play, bringing consistent gains to existing tuning methods. Code and checkpoints are available at: https://github.com/intelligolabs/RoSA

Thu 22 OctArtificial Intelligence
The gist
Matching images to long descriptions can be tricky because models often focus too much on the most obvious parts and ignore the less noticeable but still important details. This causes problems when those obvious parts change or disappear. The authors found this issue, which they call saliency collapse, and created a method named RoSA that teaches models to pay attention to both the standout and background information. RoSA uses a clever way to split images and text into important and contextual parts and aligns these parts together. This results in better match accuracy and more reliable performance even when obvious cues are missing.
Open → 2610.31005v1

Self credit improves learning in long tasks for AI agents

Self-Credit: Credit Assignment for Long-Horizon Agentic RL via Intra-group Rescaling

Abstract: LLM agents are commonly trained with RLVR, but the sparse nature of typical RLVR rewards makes credit assignment challenging, especially for long-horizon tasks. We propose Self-Credit, an end-to-end agentic RL method that creates dense supervision signals from sparse outcome rewards using self-generated credit assignment via intra-group rescaling. Self-Credit builds on group-based RL with three components. First, during its rollouts, the policy model generates summaries with citations to earlier turns containing critical evidence, which serve as self-generated credit. Second, we refine this model-generated credit with intra-group rescaling, which compares cited actions across successful and failed rollouts for the same prompt. This approach uses group-level agreement and disagreement to remove undeserved credit and further emphasize credit assigned to critical actions. Third, advantage reweighting uses the rescaled credit weights to update the advantages of the cited turns. On BrowseComp-Plus, Self-Credit improves over the base models by 37.0 and 36.2 points on Qwen3 8B and 32B respectively, and outperforms the strongest agentic RL baselines by 8.5 and 5.6 points, respectively. Self-Credit also improves over the strongest baselines by 4.9 points on GAIA and 4.7 points on xBench-DeepSearch. Analyses show that self-generated credit provides useful signals for selecting critical actions, and that intra-group rescaling, especially on failed rollouts, is important across model scales.

Tue 20 OctMachine Learning
The gist
Long tasks can be hard for AI agents to learn because rewards are rare and it’s unclear which actions caused success. The authors propose Self-Credit, a method where an AI agent marks which past actions contributed to later results by citing evidence within its own reasoning. Then, the method compares these citations across many attempts to better highlight truly important actions and reduce wrong attributions. This results in stronger learning signals, helping AI agents perform much better on long, complex tasks.
Open → 2610.28388v1

Generative engine optimization improves multi-turn conversations over time

Conversational Capture: A Trajectory-Level Framework for Evaluating Generative Engine Optimization in Multi-turn Human-Agent Interaction

Abstract: Generative Engine Optimization (GEO) shapes content to increase its likelihood of being cited by answer engines built on retrieval-augmented large language models. GEO is typically evaluated as a single-turn property: for a fixed query, an evaluator measures a source's visibility in one answer. We argue that the single answer is an inadequate unit of analysis. Human-agent information seeking forms a closed loop: the agent's answer changes the user's beliefs and therefore the next question, which in turn determines what the agent retrieves. We introduce conversational capture, a phenomenon in which a source cited early becomes substantially more likely to be cited again. Capture operates through a machine-side channel, history-conditioned retrieval, and a human-side channel, follow-up questions directed toward the captured source. We formalize the interaction as a two-layer closed-loop system and derive trajectory-level constructs: cumulative conversational visibility; a direct/feedback decomposition of trajectory gain; a nested split of the feedback term into machine-side and human-side channels; a capture coefficient; a compounding ratio; and a misranking diagnostic. Using reinforcement-process (Pólya-urn) theory, we prove that the feedback term is zero under single-turn evaluation and that GEO's cumulative payoff grows superlinearly with conversation length while capture develops. A model-derived illustration shows that the feedback term can exceed the direct term, the compounding ratio exceeds two within ten turns, and single-turn and trajectory rankings agree only weakly (Kendall's $τ= 0.4$). We connect the human channel to information foraging, trust calibration, and Bayesian persuasion, and discuss design implications for answer engines.

Wed 30 SeptHuman-Computer InteractionInformation Retrieval
The gist
Current ways to measure generative content in AI answer engines look only at single questions and answers, missing the bigger picture. The authors show that in a conversation, what the AI says early on strongly influences later questions and answers, causing repeated references to the same sources—a phenomenon they call conversational capture. They create a mathematical framework to measure how this happens over the whole chat, proving that benefits grow much more during longer conversations. This helps better understand and design AI systems that interact over multiple turns.
Open → 2609.40069v1

Retrieval augmented generation better triages query source risks

Query-Aware Source-Risk Triage for Retrieval-Augmented Generation

Abstract: Retrieval-augmented generation (RAG) pipelines may omit a source's material relationship to the query. We study a pre-generation triage layer that treats this relationship as query dependent. The method routes canonical query families for enhanced review and assigns retrieved pages to pass, contextualize, exclude, or review. It combines a four-dimension page score, rank-discounted family aggregation, intent-preserving query mutations, and a family-held-out router. A single-coded pilot of 200 real URLs supplies provisional calibration anchors; a 20,000-row scenario with synthetic domain identifiers supports controlled workload analysis. An oracle page gate defines a risk-coverage target for a future learned classifier. The evaluation shows why page-level frequency cannot substitute for family-level exposure and quantifies how calibration changes scenario activation. Annotation reliability remains unmeasured, and synthetic rankings omit real retrieval dynamics. The result is an auditable triage method and validation plan, not an estimate of deployed review workload, live-Web prevalence, or downstream answer-quality gains.

Tue 15 SeptArtificial Intelligence
The gist
Sometimes when computer systems answer questions by looking up information online, they might miss how the sources relate to the question. This paper studies a new method that checks how each retrieved page matches the type of question and treats these connections carefully before generating an answer. The method groups similar queries, scores pages in multiple ways, and decides whether to pass, explain, exclude, or review each page for accuracy. The authors tested their approach on real and simulated data to understand how well it works and how to improve future automated checks.
Open → 2609.16564v1