AIBearisharXiv – CS AI · May 297/10
🧠Researchers introduce SafeSearch, an automated red-teaming framework that identifies critical vulnerabilities in LLM-based search agents by testing them against 300 adversarial cases spanning misinformation, prompt injection, and other risks. The study reveals that current search agents achieve attack success rates up to 90.5%, with common defenses like reminder prompting providing minimal protection.
🧠 GPT-4
AIBullisharXiv – CS AI · Mar 177/10
🧠Researchers have introduced OpenSeeker, the first fully open-source search agent that achieves frontier-level performance using only 11,700 training samples. The model outperforms existing open-source competitors and even some industrial solutions, with complete training data and model weights being released publicly.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers propose Credit-Attenuated Privileged Feedback (CAPF), a training mechanism that guides LLM search agents by providing verifier feedback during training to improve learning on difficult problems. The approach improves performance on open-domain QA benchmarks by leveraging information already available in reinforcement learning systems, increasing exact-match accuracy from 44.7% to 48.5% on Qwen3-4B.
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers introduce Harness-1, a 20B parameter search agent that separates semantic decision-making from state management by externalizing working memory to a stateful harness environment. The system achieves 73% average curated recall across eight retrieval benchmarks, outperforming comparable open-source searchers by 11.4 points while generalizing well to held-out transfer tasks.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers introduce COMPASS, a safety alignment framework for LLM-powered search agents that prevents harmful outcomes from seemingly innocent multi-step queries. The method combines cognitive tree exploration and step-wise alignment to achieve robust safety while maintaining utility, requiring less training data than existing approaches.
AINeutralarXiv – CS AI · May 296/10
🧠Researchers introduce GrepSeek, an AI search agent that interacts directly with text corpora using shell commands rather than traditional retrieval indexes. The system combines supervised learning with reinforcement optimization to achieve state-of-the-art results on question-answering benchmarks while operating at scale through parallel execution techniques.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers introduce VibeSearchBench, a new benchmark that exposes significant gaps between LLM agent performance on existing search tasks and real-world user satisfaction. The benchmark uses multi-turn dialogue and schema-free evaluation across 200 bilingual tasks, revealing that even frontier models achieve only 30.30% F1 scores, indicating fundamental deficiencies in long-context reasoning and intent elicitation.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce PiCA (Pivot-Based Credit Assignment), a novel reinforcement learning mechanism that improves how LLM-based search agents learn from long sequences of actions. By identifying key pivot steps and anchoring rewards to final task outcomes, PiCA addresses critical challenges in credit assignment, delivering 15.2% performance gains on knowledge-intensive QA tasks.
AIBullisharXiv – CS AI · May 116/10
🧠Researchers introduce HyperEyes, a parallel multimodal search agent that processes multiple entities concurrently rather than sequentially, achieving 9.9% higher accuracy with 5.3x fewer tool calls than comparable systems. The system combines visual grounding and retrieval into atomic actions and uses dual-level reinforcement learning to optimize both accuracy and inference efficiency, addressing a gap in existing multimodal AI benchmarks that ignore computational cost.
AIBullisharXiv – CS AI · Apr 156/10
🧠Researchers propose Cycle-Consistent Search (CCS), a novel framework for training search agents using reinforcement learning without requiring gold-standard labeled data. The method leverages question reconstructability as a reward signal, using information bottlenecks to ensure agents learn from genuine search quality rather than surface-level linguistic patterns.
AIBullisharXiv – CS AI · Apr 76/10
🧠Researchers developed a new training approach that makes small language models more effective search agents by teaching them to consistently use search tools rather than relying on internal knowledge. The method achieved significant performance improvements of 17.3 points on Bamboogle and 15.3 points on HotpotQA, reaching large language model-level results while maintaining lower computational costs.
AIBullisharXiv – CS AI · Mar 37/108
🧠Researchers propose a training-free paradigm for empowering Vision-Language Models with multi-modal search capabilities through cross-modal model merging. The approach uses Optimal Brain Merging (OBM) to combine text-based search agents with base VLMs without requiring expensive supervised training or reinforcement learning.
AIBullishHugging Face Blog · Feb 46/107
🧠The article title suggests the open-sourcing of DeepResearch, a search agent technology, potentially making advanced AI search capabilities more accessible to developers and researchers. This could democratize AI-powered search tools and accelerate innovation in the space.
