Error-Propagation Modeling for Failure Attribution in LLM-Based Multi-Agent Systems

An agent looks good in demos, but you cannot tell which product tasks it fails.

What you would change

Use the study's evaluation idea to inspect a small set of tasks with human-checked answers.

Use the study's evaluation idea to inspect a small set of tasks with human-checked answers.

Compare against

Your current evaluator and a manually reviewed reference set.

1. Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.
2. Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.
3. Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
4. Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test.

What to measure

Agreement with human review, missed failures, false alarms, and evaluation cost per task.

When to keep it

Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation.

recommendation

test

research area

agent evaluation

technical change

Propagation-aware failure attribution for multi-agent LLM systems

published

2026-10-08

Teams running multi-agent systems in production need failure attribution for debugging, and this method is implementable with API access and modest compute, but its benefit must be validated on the reader's own trajectories since gains are reported on a single benchmark and counterfactual verification adds per-incident LLM cost.

1. claim 01Paperraft inference
   Read the brief interpretation

   EMFA replaces heuristic suspicious-step identification and prompt-only failure analysis with a structured trajectory representation that models cascading error propagation and persistent loops, followed by propagation-aware candidate screening and counterfactual verification of the decisive agent-step pair. The cost is additional LLM calls for candidate screening and counterfactual re-execution per failed trajectory, plus engineering to log structured agent-step interactions, making it an offline diagnostic expense rather than a runtime overhead. It can fail when counterfactual verification is itself unreliable (non-deterministic agents or tool environments), when the decisive error definition does not match the team's debugging needs, or on domains unlike the Who&When benchmark where its accuracy gains are unverified.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source
2. claim 02Paperraft inference

   Improves previous best step-level attribution accuracy by 3.45 and 4.40 percentage points on the Hand-Crafted and Algorithm-Generated subsets of the Who&When benchmark; competitive at agent level.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source