AI RESEARCH

Erase to Improve: Erasable Reinforcement Learning for Search-Augmented LLMs

arXiv CS.CL

ArXi:2510.00861v2 Announce Type: replace While search-augmented large language models (LLMs) exhibit impressive capabilities, their reliability in complex multi-hop reasoning remains limited. This limitation arises from three fundamental challenges: decomposition errors, where tasks are incorrectly broken down; retrieval missing, where key evidence fails to be retrieved; and reasoning errors, where flawed logic propagates through the reasoning chain. A single failure in any of these stages can derail the final answer.