arXiv AI By Minho Kim

When Should LLMs Search? Counterfactual Supervision for Search Routing

Read the original on arXiv AI →

arXiv:2607. 05752v1 Announce Type: cross Abstract: Search-augmented language models can use external evidence to compensate for limitations in parametric knowledge, but search is not uniformly beneficial: models may call search for questions they can already answer, or rely on noisy evidence when correction, clarification, or abstention would be more appropriate.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Sep 25

The Fellowship of the Query: Learning Retrieval Actions

The paper investigates how trajectory fine‑tuning can enhance small language models (SLMs) as next‑action controllers in retrieval‑augmented question answering. By building a seven‑way action‑prediction task from teacher search traces, the authors fine‑tune SLMs and cross‑lingual SLMs (xSLMs) using LoRA and evaluate on 1,646 held‑out examples, achieving a macro‑F1 of 0.6536 with Granite 4.1 3B. In an end‑to‑end controller/generator swap experiment on 149 trajectories, the fine‑tuned model improves Exact Match from 0.7530 to 0.7946 and token F1 from 0.7783 to 0.8295, demonstrating that trajectory supervision boosts action prediction and evidence‑recording behavior.

By Mohammed Al-Maamari, Saber Zerhoudi, Michael Granitzer, Jelena Mitrovi\'c
arXiv AI
Sep 25

Search-Aware Reinforcement Learning for Multi-Component Query Understanding in Roblox Game Search

The paper introduces a search‑aware reinforcement learning framework for multi‑component query understanding in Roblox game search. It first uses teacher‑student supervised fine‑tuning to create a schema‑compliant policy, then applies reinforcement learning that optimizes each query‑understanding component with component‑specific rewards derived from live search engine interactions. Experiments show that this approach improves per‑component utility and overall search quality, raising NDCG@20 by 8.9 points over the supervised baseline and 3.5 points over a single end‑to‑end reward strategy.

By Nayoung Choi, Shengjian Chen, Xiaokai Wei, Wenzheng Zhang, Daiyao Yi, Rachit Pareek, Vincent Su, Michelle Gong, Jinho D. Choi