Daily AI Paper

Daily AI Paper

2026-10-13

Archived
2026-10-13

RATED: Reliability-Aware AI Agent Tool Retrieval via Execution Dynamics

Weiliang Chen, Song Liao

arXiv:2610.13889v1

Large language models are very good at producing text, but by themselves they cannot actually do things in the world. That is why modern AI agents connect an LLM to external tools and APIs: databases, workflow systems, search endpoints, and other services that can carry out actions. Once you build that kind of agent, the bottleneck changes. The key question is no longer only, “Can the model understand the request?” It becomes, “Can the agent retrieve the right tool from a large and messy tool catalog, and can it still do so when some tools are broken or unavailable?” That second part matters a lot in practice. The paper points out that existing tool retrieval methods mostly optimize semantic match: they try to rank tools based on how well the tool description matches the user query. That is useful, but it assumes the tool repository is basically static and reliable. Real tool ecosystems are not like that. The authors crawled tool catalogs from LangChain, CrewAI, LlamaIndex, and n8n, and they found that over half of these tools have serious issues such as broken links or missing authentication. So two tools may look equally relevant in text, but only one actually works at runtime. If your retriever ignores that, the agent may keep selecting failing tools. This paper proposes RATED, which stands for Reliability-Aware Tool Retrieval via Execution Dynamics. The core idea is to combine two things that are usually treated separately. First, you want strong semantic retrieval, so the system can find the right candidate tools from text. Second, you want a lightweight mechanism that learns from execution feedback, so the system can quickly stop favoring tools that are failing right now. The authors argue that contextual bandits are a good fit for this because they update online from each individual outcome, rather than waiting for large batches or retraining the whole retriever. To support this, the paper introduces EcoAgent, a benchmark built specifically for tool retrieval under reliability concerns. EcoAgent has two parts. EcoAgent-Syn is a synthetic training set, and EcoAgent-Real is a real-world evaluation set. Altogether the benchmark covers 5,172 real-world tools and more than 210,000 query-tool pairs. The tools come from the four open-source platforms I mentioned earlier, and their metadata are normalized into a common schema with names, functional descriptions, endpoints, and authentication fields. The benchmark also assigns each tool an automated reliability score from catalog metadata, not from manual human ratings. Those signals include name-description consistency, source credibility, and documentation quality. Tools with scores of at least 0.8 are treated as reliable, and that identifies 2,940 tools, or 56.8% of the repository. For training, they generate synthetic queries with Gemma-3-1b. For each tool, the model sees the tool name, description, and metadata, and then produces 10 to 20 task-oriented queries. The authors remove near-duplicates to keep the query set diverse, and they add hard negatives from SBERT retrieval as well as random negatives. That gives the semantic retriever a more realistic contrastive learning signal. For evaluation, they build EcoAgent-Real from ToolBench queries, then semi-automatically map those queries to tools in their repository. They use a first-pass retriever, filter out weak matches, and then have Gemma-3-1b verify the remaining pairs. A human review of 200 sampled queries agreed with the verifier on 94% of cases, which gives some confidence in the labeling pipeline. Methodologically, RATED has two stages. The first stage is a semantic perception module. This is a dual-encoder retriever based on DRAGON, with separate encoders for queries and tools. The model is fine-tuned on EcoAgent-Syn using a contrastive objective, specifically an in-batch InfoNCE loss with hard negatives. After training, the encoders are frozen at deployment. That is important because it means the semantic side stays stable and cheap to use. New tools can be added by encoding their documentation, without retraining the whole system. The second stage is the reliability-aware reranker. This is where the execution dynamics come in. After the semantic retriever produces a top-K candidate set, RATED reranks those candidates using a contextual bandit. The context is the query embedding. The action is the selected tool. The reward is binary: success or failure after execution. Only the chosen tool gets feedback, which is exactly the kind of partial feedback bandits are designed for. The bandit starts with a prior based on tool metadata. That prior is built from the same catalog signals used in benchmark construction: name-description consistency, source credibility, and documentation quality. This helps with cold start, when a tool has little or no execution history. Then, at runtime, the system uses a discounted LinUCB-style update with a separate linear model per tool. The discounting is the key non-stationary element: older observations are down-weighted so that recent failures matter more. In other words, if a tool suddenly starts timing out because of an outage, the model can move away from it quickly instead of averaging that failure away. The final ranking score blends semantic relevance, the bandit’s reliability estimate, and the metadata prior. The weights are tuned on validation data and fixed for testing. Operationally, the system retrieves top-K tools by semantic score, reranks them by the final score, executes the top choice, and then updates the bandit from the observed result. That creates a closed loop between retrieval and execution. The experiments are designed to test both standard retrieval quality and behavior under failure. The authors run everything on a single NVIDIA GeForce RTX 5070 GPU with 12 GB of VRAM. They fine-tune DRAGON for one epoch on EcoAgent-Syn, using a batch size of 8, a learning rate of 1e-5, warmup, and mixed precision. At inference, they retrieve the top 10 tools semantically and rerank them. The bandit uses a relatively small exploration parameter and a discount factor of 0.95, with 2,000 warm-up pairs. For the dynamic tests, they simulate 10,000 sequential selections and inject persistent outages by marking a fraction of tools as failing before the run begins. The failure set stays fixed throughout the experiment, so this tests how well the system adapts once some tools become unavailable. On offline retrieval, they evaluate with MRR, Recall@1, and Recall@5. The headline result is that RATED improves retrieval quality substantially over the ToolLLM API retriever on real-world queries, with a 52.2% relative MRR improvement. That tells us the semantic-plus-reliability design is not just helping in failure scenarios; it is also improving ranking quality in the ordinary retrieval setting. The most striking results come from the dynamic reliability experiments. Under a severe outage scenario with a 30% failure rate, RATED reduces the fault selection rate from 86.2% to 2.9%. That is a huge difference. It means the system is not just slightly better at ranking; it is learning to avoid broken tools almost entirely, even when a large fraction of the repository is compromised. The paper also says RATED keeps fault selection below 3% and recovers under both tested failure rates, which suggests the bandit update is reacting quickly enough to real execution feedback. Another important result is efficiency. The authors report negligible latency overhead: less than 1 ms over encode-only inference, specifically 0.172 ms per step. That matters because a reliability layer is only useful in practice if it does not make the agent sluggish. Here, the additional decision logic is lightweight enough to be compatible with real-time use. So what do these results actually show? First, semantic retrieval alone is not enough when the tool environment is unreliable. Second, a frozen retriever plus an online bandit is a practical way to separate stable language understanding from fast-changing operational reliability. Third, metadata can be useful not just for documentation, but as a real signal for cold-start reliability. And fourth, you can get these gains without expensive retraining or obvious latency penalties. There are still limitations to keep in mind. The paper’s dynamic evaluation relies on simulated failure injection, so while it is realistic in spirit, it is still a controlled simulation rather than a full production deployment. The reliability scores are automatically derived from metadata, which is elegant and scalable, but they are still proxies for actual runtime behavior. The system also only observes feedback for the selected tool, so adaptation depends on enough execution traffic to learn from. And because the semantic encoders are frozen, RATED can adapt quickly to changing reliability, but it will not itself learn deeper changes in tool semantics unless retrained. Even with those caveats, the main contribution is clear. RATED reframes tool retrieval as a problem of both meaning and operational trustworthiness. In a world where tool catalogs are large, noisy, and constantly changing, that is a very practical way to think about agent reliability. The benchmark, EcoAgent, is also a useful contribution on its own, because it gives the community a way to study tool retrieval under realistic failure conditions rather than only clean offline ranking.

Previous daily papers

2026-10-15Latent Compaction with Test-Time Training2026-10-14Tev: Scaling Long-Horizon Agentic Environments with Dense Progress Rewards2026-10-14The Last Remote Sensing Model Built by Humans? Casting Any Earth Observation Task as Recursive Self-Improvement2026-10-14Hybrid Reasoning Agents2026-10-13AI Models Can Provably Hide Arbitrary Capabilities2026-10-13Designing Protein Structures from Natural Language2026-10-12RSI-Anything: Unlocking Recursive Self-Improvement with World Models2026-10-11A Balanced Data Diet: Addressing the Exploration Bottleneck in Mega-Scale RL for Robot Control2026-10-11FAITH: Feasibility-Aware Safety-Filtered RL for High-Dimensional Systems2026-10-11VioLA: Learning Generalist Humanoid Control Policies from Human Data2026-10-10FastBench: Can Streaming VLMs Perceive High-Dynamic Real-World Streams?2026-10-10Ecology of AI Agents: Collaboration Creates a Population Threshold for Takeoff2026-10-08Long-WAM: Scaling the Context of World-Action Models2026-10-08SciExam for ENSO: Can AI Agents Build Climate Models?2026-10-08RoboJEPA: Scaling Robotic Latent World Models2026-10-08RECAST: Learning to Compute the Right Context through Adaptive Evidence Routing2026-10-07WorldSonus: Bringing Sound to Worlds2026-10-07IdeaAnchor: Teaching LLMs to Turn Literature into Research Ideas2026-10-07Agent in a Bottle: Can LLM Agents Turn Their Capabilities Into Cheap, Scalable Artifacts?2026-10-06CLIFT: Conformal Self-Verification for Web Agent Training and Test-Time Scaling2026-10-06PlotGround: Grounding Plot Digitization in Real Scientific Figures and Their Source Data2026-10-06Base Models Can Reason By Taking a Cue From Training Data2026-10-05LESSER: Post-Training Data Selection with Output-Layer Gradients2026-10-05Language Models that Play Chess and Explain Their Moves2026-10-05Less Decoder is More Encoder: Geometric Representation Learning from Novel View Synthesis2026-10-04One Basis to Animate Them All: Gaussian Blendshape Distillation for Real-Time Avatars2026-10-04The Missing Primitive: Diagnosing and Repairing Mathematical Reasoning in Large Language Models2026-10-04DMAD: Distribution Matching as Adversarial Distillation for Fast Visual Generation2026-10-03VISTA: A Visual Harness for Reasoning in an Interactive World2026-10-01Looped Diffusion Transformer2026-10-01Scaling Laws for Looped Mixture of Experts2026-10-01EvoDuet: Bilevel Co-Evolution of Web Searching and Task Solving for Scientific Discovery2026-09-30Beyond the Timeline: Augmenting Long-Video Memory with Grounded Entity Biographies2026-09-30Thinking Before Thinking: Scaling Agentic Inference Through Meta-Reasoning2026-09-30Pretraining Latent Information Feedback Transformers with Teacher Supervision2026-09-29Unifying Distributional Training for One-Step Visual Generation2026-09-29Improving Test-Time Scaling with Adaptive Looped Transformers2026-09-29Telescopic Language Models2026-09-28Statistical attribute alignment for black-box generative AI via output post-processing2026-09-28User Model Extraction via Belief Self-Distillation2026-09-28Learning to Stop without Learning to Stop: Self-Supervised Confidence Training Improves Reasoning Efficiency2026-09-27TrackEverything: Long Horizon Dense Tracking via De-Duplicating 3D Scene Representations2026-09-27LLM Agents Can Easily Tamper With Their Own Traces2026-09-27Instrumental Monitor Evasion Emerges Under Ordinary Task Pressure2026-09-26PoEM: Predicting RL Outcomes from Existing Policies2026-09-24Frozen Flows Forget: Diagnosing and Restoring Lost Motion in a Latent-flow World Model2026-09-24StudentBench: AI and human tutoring yield equivalent GRE learning gains2026-09-24Agent-Editing World Model: Rethinking World Modeling for LLM Agents2026-09-23Grow the Harness, Not the Context: From Strategy-Free Scaffolds to Reusable Specialist Agents2026-09-23FleXray: Universal Clinical X-ray Segmentation2026-09-23SWE-Serve: Benchmarking Agentic Engineering For Production Inference Serving2026-09-22GameHorizon Suite: Multi-Horizon Data and Evaluation in Gameplay2026-09-22Emergent Collusion in Long-Horizon LLM Agent Interaction2026-09-22WorldCrafter: Consistent Video World Model with Implicit 3D-aware Memory2026-09-21Value-Sensitive Delegation in Everyday AI Agent Use: Evidence from OpenClaw2026-09-21Designer-RSI: Evolving Procedural Memory from User Traffic for Agentic Graphic Design2026-09-21CodeMidas: Scaling Agentic Coding RL Environments from Code Itself2026-09-20RetireOPD: Self-Retiring On-Policy Distillation for Agentic Reinforcement Learning2026-09-20Quantifying Overclaiming Propensity in Frontier LLM Agents