LLM Digest
Subscribe

Agent Know-How

Agent engineering · know-how

An agent's answer is only as good as what it retrieved — and whether it can prove it

🧱 Obstacle·grounding·active·28 entries·28 sources·updated 2026-10-06

A fluent agent answer isn't the same as a grounded one: the model will answer past what it actually retrieved unless the retrieval was current, the right slice, and cheap enough to fetch — and unless something checks that the answer is actually backed by what came back. Grounding is the retrieval and attribution problem underneath agent memory.

Latest updates
State of the art

Retrieval architecture is a per-job choice, not a default to embeddings. Production teams answer exact questions with plain SQL, use knowledge graphs for connected and provenance-heavy questions, and reserve vector search for the fuzzy slice. Gateways, self-hosted or managed, route across stores. The strongest production results credit a governed data layer underneath the agent, such as dbt and a semantic model, more than the retrieval method.

The retriever keeps improving under every architecture. Better text and multimodal embedders, structured extraction of charts, learned control of how much to search per query, and recovering a sufficient set of evidence rather than the top-ranked passages all raise recall without changing the store. Better retrieval also means fewer search calls, so it is a cost and latency lever.

What enters context is a budget. A raw web page can cost tens of thousands of tokens of boilerplate. Pre-compression, reusable compression views, and models hardened against distracting context all attack the same waste.

The open problem is evidence that is true but misleading. Reordered salience, true evidence for a nearby question, and poisoned embeddings that mimic benign entries all redirect agents without a single false claim or injected instruction. Published defenses cut attack success but do not transfer cleanly across datasets or attack types.

Attribution is becoming enforceable. Benchmarks score citation support, verifiers check per claim that an MCP agent cites the right source, runtime guards check actions against ground truth before they execute, and auditable domains split the decision (rules) from the explanation (RAG).

Why it matters for platform engineers

Grounding is the trust layer underneath every agent answer that cites a source or claims a fact: get it wrong and the agent is fluent but unverifiable, which is worse than an obvious failure because users don't know to distrust it. The engineering job splits three ways — pick the retrieval architecture (vector, graph, SQL, or a gateway spanning all three; see vector-kb), budget the token cost of fetching before it enters context (cross-ref cost), and measure attribution directly rather than assuming a fluent answer is a grounded one.

Developments 28

Picking the retrieval architecture: SQL, graph, gateway, or managed service

10 entries · latest Sep 18, 2026

Teams choose per job between exact SQL, knowledge graphs, self-hosted gateways, and managed search; production wins come from governed data layers more than retrieval tricks.

RAFT retrieves support cases by matching intermediate states, not whole documents

Standard RAG treats historical support cases as static documents. RAFT abstracts each closed case into a directed chain of timeline entries and retrieves at the entry level, surfacing past cases whose intermediate states match the active one and returning the parent case's trajectory.

For troubleshooting agents, the retrieval unit should mirror how the work unfolds. Pick the index structure for the job, as with SQL over embeddings.

Four knowledge-graph patterns for agentic RAG, including decision provenance

Cassie Shum's InfoQ talk lays out four patterns for building agents on a knowledge graph instead of basic RAG: context bundling, decision provenance, code as truth, and agent visibility. She demonstrates an engineering harness on a graph that shortens feedback loops and reduces token use.

Decision provenance puts attribution into the retrieval architecture itself rather than bolting it on as a separate scoring step.

KDDI built its consumer RAG app Buffmee on Google's ADK to balance quality and response time

KDDI, a major Japanese carrier, built Buffmee, a consumer RAG app that grounds answers in over 100 sources including books, magazines, and web media, on Google's Agent Development Kit. The design goal was high generation quality with fast responses across diverse media types.

At consumer scale the quality-versus-latency budget drives the retrieval architecture itself. See agent latency for the serving side.

Show 7 earlier entries

Cloudflare AI Search runs crawl, parse, embed, and retrieve as one hosted service with an MCP endpoint

Cloudflare AI Search provides a ready-made search engine over custom data: crawl, parse, embed, and retrieve behind one search endpoint, with multimodal search, a "discover" mode that indexes pages without a sitemap, and public /mcp and /search endpoints agents can query directly.

It is the gateway pattern as a managed service: faster setup, less control over chunking, embedding, and ranking than a self-hosted stack.

OneAdvanced self-hosts Llama 4 and a pgvector RAG pipeline for 50+ UK-sovereign agents

OneAdvanced, a UK enterprise software provider, built a UK-sovereign AI platform on AWS: Llama 4 Maverick and Llama Guard 4 self-hosted on SageMaker AI, a RAG pipeline on pgvector, and more than 50 agents built with the Strands Agents SDK on ECS.

Here data residency, not cost or latency, drove the self-hosted retrieval stack, and the model choice and retrieval architecture were decided together.

LangChain's trusted data agent rests on dbt, a semantic layer, and observability, and scaled self-service 40x

LangChain built its internal data agent on Hex, dbt, semantic models, and observability tooling, and reports a 40x increase in self-service analysis.

The governed semantic layer under the agent, not a better retrieval trick on top, is what made answers trustworthy. Grounding a data agent is a data-engineering investment. See agent observability for the tracing side.

For enterprise data integration, agentic RAG buys accuracy that naive RAG lacks, at a cost to measure

A vision paper on LLM-driven data integration finds naive RAG keeps hitting accuracy and cost limits in enterprise settings because of a persistent knowledge gap. It argues for knowledge-grounded agents in an agentic RAG loop that retrieves, checks, and re-queries, with integration decisions backed by retrieved evidence.

The paper frames agentic RAG as a trade to measure against the naive baseline, not an automatic upgrade: each extra loop buys accuracy with more calls.

OpenWiki 0.2 adopts OKF so agents can filter codebase docs by metadata instead of searching

OpenWiki 0.2 generates codebase wikis in OKF, a proposed open format that adds YAML front matter (tags, categories, timestamps), changelogs, and directory index files to doc pages.

An agent can filter to "every doc tagged billing" directly instead of running an open-ended search. It is the structured-recall argument applied to the docs coding agents ground their answers on.

Postgres for agents: assemble context with plain SQL first, vectors only for the fuzzy slice

Gwen Shapira's InfoQ talk shows teams delivering deterministic and semantic context from one Postgres: JSONB and plain SQL for what can be looked up exactly ("how would a human solve this?"), HNSW vector indexing for genuinely fuzzy matches, and vector quantization for roughly 4x faster queries.

Deterministic retrieval is a live alternative to embedding everything. Reach for similarity search only when an exact query cannot express the question.

Orbit packages file RAG, multi-backend vector RAG, and NL-to-query into one self-hosted gateway

Orbit is an open-source toolkit for retrieval-based inference that bundles file RAG, vector RAG across Chroma, Qdrant, Pinecone, Weaviate, pgvector, and FAISS, and natural-language-to-query translation over SQL, NoSQL, and REST sources.

"Which store, which query language" becomes a routing decision inside one gateway instead of a separate integration per source. That is the build-it-yourself end of the gateway pattern.

Better retrievers and smarter search effort

6 entries · latest Sep 20, 2026

Stronger and multimodal embedders, structured chart extraction, learned per-query search depth, and set-sufficiency recovery each raise recall without changing the store.

For coding agents, recover a sufficient evidence set, not the top-ranked passages: 73.0% vs 61.4%

A coding agent mid-task has already read much of what a retriever ranks highest, and a ranker can fill its budget with variants of one fact. MSS-Complement conditions on the agent's captured state and uses three semantic calls to propose a jointly sufficient set, find what is missing, and return 4-8 source units within budget.

On SERBench (500 held-out states from 45 repositories) it recovers a complete evidence set 73.0% of the time at five items, versus 61.4% for embedding-based reranking.

Databricks' Adaptive Instructed-Retriever learns per query how hard to search, at half the latency

Databricks' retriever takes enterprise schemas and custom instructions as input and uses reinforcement learning (CISPO) to decide when one parallel search pass is enough and when a question needs sequential multi-hop search, with search cost in the reward.

It matches Claude Sonnet 5 and GPT-5.6 Luna answer quality at about 5.8s end-to-end, roughly half the latency, and the vendor reports it dominates their quality-vs-cost curves across the retrieval budget. Search effort becomes a learned per-query decision, not a fixed step count.

Tencent's WeMM-Embedding-9B embeds text, images, video, and documents in one space

Tencent released WeMM-Embedding-9B on Hugging Face. Built on Qwen3.5, it embeds text, images, video, and visual documents into one 4,096-dimension space. It scores 80.6 average on MMEB-v2 (78 datasets), ahead of Qwen3-VL-Embedding's 77.8, and 59.5 on the harder MMEB-v3 (190 tasks).

A retriever that natively embeds slide decks and chart-heavy pages can reach multimodal evidence without a separate extraction pass.

Show 3 earlier entries

Embedding charts as structured JSON beats larger multimodal embedders on chart-heavy retrieval

Databricks parses chart figures into structured JSON with ai_parse_document and embeds that enriched chunk instead of the caption alone, using a 300M-parameter embedding model. On chart-heavy ViDoRe V3 (310 questions) it reaches 75.9% answer correctness from the top-3 retrieved images, and 75.1% on a synthetic Chart-RAG set.

It beats four larger multimodal embedding baselines while passing the agent fewer images: a small model over structured content can out-retrieve a bigger one over raw pixels.

Sentence Transformers adds off-the-shelf multi-vector (late-interaction) embedding models

Sentence Transformers now supports multi-vector, late-interaction (ColBERT-style) models: a query is matched against several token-level vectors per document instead of one pooled vector.

Self-hosted retrieval stacks get a packaged path to an architecture that was mostly confined to specialized research code. Expect larger indexes in exchange for finer-grained matching.

TALRanker decides per document when reranking should call a search tool

The Tool-Adaptive LLM Reranker (TALRanker) targets hallucinated relevance judgments on queries beyond the model's own knowledge. Calling a search tool for every document during reranking fixes accuracy but adds prohibitive latency, so TALRanker frames pointwise relevance scoring as an agentic decision process that invokes external tools only where needed.

It adds a middle option to the rerank stage between a purely parametric reranker and a tool call per candidate.

Also relevant to External knowledge base: vector and graph retrieval

Cutting what retrieval puts into context

4 entries · latest Sep 16, 2026

Raw fetched pages waste tens of thousands of tokens; pre-compression, reusable compression views, and distraction-resistant models shrink or harden the retrieved context.

REVA reuses past attention traces to compress RAG context 5-15x faster than per-query compressors

REVA treats RAG compression as data mining: it aggregates a generator's historical query-document attention into a document-keyed, budget-agnostic score store, then renders plain-text views at any budget while keeping document order and the standard RAG interface.

The authors show existing compressors gain unstably over simple truncation and can add latency. REVA improves quality 1.0-5.8 points over them, cuts compression overhead 5.3x-15.6x, and adds under 40ms.

SCoNE makes RAG less distractible by strengthening context-aware neurons, with no fine-tuning

When retrieved documents mix useful and irrelevant context, models get distracted and hallucinate. SCoNE is a training-free edit: it finds context-aware FFN neurons with high attribution and high cross-input variability, then strengthens only those.

It needs a small mining sample, no fine-tuning, and no inference-time overhead, and reports consistent gains over baseline RAG methods on several knowledge-intensive QA benchmarks and two backbones. It applies to self-hosted open-weight models only.

AWS TAKC pre-compresses a whole knowledge base into task-specific tiers ahead of query time

AWS describes task-aware knowledge compression (TAKC) for analytical questions that span hundreds of documents, where plain RAG hits a ceiling. It pre-compresses the knowledge base into task-specific representations, caches them at multiple fidelity tiers, and routes each query to the right tier. An open-source implementation is included.

It trades an up-front compression pass for a smaller, denser context at answer time, instead of retrieving and re-reading raw pages per query.

Show 1 earlier entry

A raw Wikipedia page costs an agent 68,240 tokens before it can ground on anything

A Claude Code user measured page costs: an average Wikipedia article is 68,240 tokens of raw HTML and Nike's homepage 353,000. Claude Code's WebFetch summarizes Wikipedia to about 950 tokens, but returns nothing on JS-rendered and some anti-bot pages, and the agent then dumps raw HTML into context. A stealth-browser fetch tool that converts to markdown brings the page to roughly 3,000-5,000 tokens.

Most of the raw page is boilerplate the model must read before reaching the relevant part. Budget the fetch layer, not just the model call. See agent cost.

Evidence that misleads without being false

4 entries · latest Sep 5, 2026

Truthful but reordered, nearby, or embedding-mimicking evidence redirects agents; defenses normalize presentation or screen documents, and none transfers cleanly yet.

Lazy Grounding: true evidence for a nearby question cuts search-agent accuracy up to 17.3 points

Lazy Grounding shows a search agent can be misled without any false document. Using answer-changing rewrites of benchmark questions, each injected document truthfully supports a nearby question but surfaces for the original one, and agents adopt the nearby answer.

Accuracy drops 5.9 points on average and up to 17.3 points across 12 model-benchmark combinations. Fact-checking retrieved text will not catch it; the check has to be whether the evidence answers this question.

An Evaluation Agent screens retrieved documents for poisoning with NLI checks and a Trust Index

RAG systems trust whatever ranks as relevant, but relevance is not truth. This middleware combines NLI fact-checking, a five-signal poison detector, and a weighted Trust Index (0.4 factuality + 0.35 coherence + 0.25 (1 - poison)) with a dampener for heavily contaminated contexts.

  • On TruthfulQA it reaches 91% accuracy and 100% recall on instruction-injection attempts.
  • In-place edits such as entity swaps stay hard to catch.
  • On FEVER, thresholds need per-model recalibration rather than transferring as-is.

See prompt injection for the attack side.

DSPrompt defends multimodal RAG against poisoned embeddings that mimic benign entries

In multimodal RAG, attackers craft data whose embeddings align with benign entries in the vector space, so poisoned content is retrieved as if relevant. Existing query-time defenses (auxiliary detectors, similarity re-ranking, consistency checks) add inference overhead and generalize poorly. DSPrompt proposes a dynamic soft-prompt defense instead.

The attack targets the embedding space directly, so retriever ranking alone cannot be trusted as a relevance signal on untrusted corpora.

Show 1 earlier entry

Salience Induction redirects multi-hop RAG agents with only true facts, at 83.3% success

Salience Induction is a third attack channel beyond content poisoning and prompt injection: truth-preserving edits to fact position, emphasis, framing, and semantic proximity redirect a multi-hop agent's reasoning with no false claims and no instructions.

  • Across five model families (GPT, Claude, Gemini, DeepSeek, Qwen) and ReAct, Reflexion, and tool-calling agents, a 30% edit budget reaches 83.3% attack success.
  • The strongest baseline defense still lets 75.7% through.
  • The authors' Salience Normalization cuts it to 15.3% (23.6% under adaptive attacks).

Content filters will not catch this; the defense has to normalize how evidence is presented.

Proving the answer is backed by its source

4 entries · latest Sep 29, 2026

Attribution is now measured and enforced, with citation benchmarks, per-claim source verifiers for MCP agents, pre-execution checks against ground truth, and rule engines that decide while RAG explains.

ProvenanceGuard checks per claim that an MCP agent cites the source a fact actually came from

Multi-tool agents can state a true fact but attribute it to the wrong source, for example citing the account record for a fact that lives in the policy document. Pooled faithfulness scores miss this cross-source conflation.

ProvenanceGuard is a post-generation verifier that reads the captured tool trace with source IDs and never pools evidence. It splits the answer into claims, routes each to its likeliest source, checks support, compares that source with the one cited, and emits per-claim verdicts plus an allow/block decision, with no agent retraining.

ai-rete-rag: a Rete rule engine makes the decision, RAG only explains it

For decisions that must be auditable (lending, fraud, clinical triage), ai-rete-rag runs two systems in series. A pure-Python Rete engine evaluates YAML rules: same facts, same verdict, every time. Then RAG retrieves passages from the organization's policy documents and an LLM writes a plain-English explanation citing them, with no ability to change the verdict.

The explanation cannot drift from what actually decided, the way a model's post-hoc rationale can. See agent reliability.

ActionRail checks an agent's proposed action against ground-truth business data before it executes

ActionRail, an open-source framework from ToolJet, adds runtime value and action grounding: before an agent's proposed action or value executes, it is checked against ground-truth business data.

Grounding moves from a retrieval-quality score after the fact to a deployable guard in front of side effects, aimed at the value-poisoning failure benchmarks measure (see agent benchmarks).

Show 1 earlier entry

ResearchQA scores whether answers are backed by verifiable citations, not just correct

ResearchQA is a benchmark of 6,211 question-answer pairs from 494 open-access papers across eight domains and four question types (lookup, comprehension, multi-hop, adversarial). It allows multiple valid supporting passages per claim and rewards grounded refusal when the paper does not support an answer.

"Grounded or just fluent" becomes a measured number instead of a spot-check, and declining to answer counts as a correct outcome when the evidence is missing.

Also relevant to External knowledge base: vector and graph retrieval

From related topics
  1. Agents forget across steps and sessionsUTILMEM: strong recall scores don't predict whether an agent can use what it retrieved
  2. Agents forget across steps and sessionsCABLE: stored facts can still be unreachable through a bounded memory interface
  3. External knowledge base: vector and graph retrievalDynamoDB adds native vector search alongside application rows
  4. External knowledge base: vector and graph retrievalNVIDIA Nemotron 3 Embed ranks #1 on RTEB; its 1B model cuts its predecessor's error by 27%
Evidence · 28 sources
All sources behind this page