Home · Writing · Research

Agent Research 2023–2026: What Held up in Production

A practitioner's audit of the agent research literature since ReAct, sorted by what actually shows up in production systems today versus what remained a benchmark artefact, with the specific reasons each idea did or did not travel.

TLDR

  1. A practitioner's audit of the agent research literature since ReAct, sorted by what actually shows up in production systems today versus what remained a benchmark artefact, with the specific reasons each idea did or did not travel.
  2. Between early 2023 and the middle of 2026, agent research produced many prompting patterns, scaffolds and multi-agent protocols with benchmark gains.
  3. Yao et al.'s ReAct paper proposed interleaving reasoning, action and observation rather than reasoning silently or acting without a visible rationale.
  4. Open-ended loops in the style of AutoGPT and BabyAGI are largely absent from regulated production.
  5. The first failure mode is adopting a paper's reference implementation without checking whether its benchmark resembles the production workload.
Figure 1Research claim to bounded production releaseCausal and control schematic
Research claim to bounded production release10 declared states connected by 4 authored relations. The figure supports the section The production-transfer test. L0L1L2 01
Research claim
02
Matches a measured failure
03
Archive for later
04
Build smallest faithful prototype
05
Matched-resource comparison
06
Stable on material slices
07
Restrict scope or reject
08
Shadow operation
09
Quality, cost, latency and evidence pass
10
Bounded production release
Reading. The authored topology makes 4 declared relations across 10 states inspectable. Read it as the control structure for “The production-transfer test”, not as measured performance. Schematic derived from the paper's authored topology; no measured quantities.
On this page

The gap between a paper and a production system

Between early 2023 and the middle of 2026, agent research produced many prompting patterns, scaffolds and multi-agent protocols with benchmark gains. A smaller set appears in recognisable form in production systems. This analysis sorts the two without dismissing sound research. A benchmark result can fail to travel because production adds latency budgets, unit economics, audit requirements and impatient users.

The pattern is consistent: ideas travel when they add structure and auditability. They fade when they add computational cost without enough user or risk benefit to pay for it. Benchmark gains are not fake. The production objective is simply different from the benchmark objective.

React and the reasoning-then-acting pattern

Yao et al.'s ReAct paper proposed interleaving reasoning, action and observation rather than reasoning silently or acting without a visible rationale. The idea has been absorbed widely into production practice. LangGraph patterns, the Agent Development Kit and bespoke orchestrators all use variants of this loop.

The reason is operational. A recorded rationale can become an audit artefact. It is not a guaranteed causal account of the model's internal computation, so a reviewer must not treat it as one. Even with that limitation, it is more useful than a bare action. Production systems therefore preserve step records as first-class telemetry rather than discard them as scratch output.

ReAct did not survive unchanged. Production systems constrain the action space to a typed and validated tool registry rather than permit free-form action generation. Many also limit the length and structure of the rationale. A scoped step is less likely to carry speculation into the next action.

Chain of thought and self-consistency

Wei et al. studied chain-of-thought prompting, while Wang et al. extended the idea through self-consistency over multiple samples. Their production forms differ from the paper descriptions. Reasoning-tuned models can produce extended internal computation without few-shot elicitation. The engineering problem has shifted from inducing reasoning to managing its cost, latency, observability and disclosure.

Self-consistency is rarer because it multiplies inference cost by the sample count. A single structured pass followed by deterministic checks often wins on economics: does the number reconcile, and is the class permitted? When sampling does earn a place, it is usually confined to one consequential decision point rather than applied across a long trajectory.

Technique Benchmark era claim Production presence by 2026
ReAct interleaved reasoning Improved task completion via visible reasoning Near universal, now valued primarily for auditability
Chain of thought prompting Improved multi-step arithmetic and logic accuracy Largely absorbed into model post-training defaults
Self-consistency voting Improved accuracy via majority vote over samples Rare, used only at isolated high-stakes decision points
Tree of Thoughts search Improved planning via explicit search over reasoning branches Almost absent, cost prohibitive at production latency budgets
Multi-agent debate Improved accuracy via adversarial cross-examination between models Rare outside offline evaluation and red-teaming

Tool use and function calling, from toy APIs to real ones

Schick et al.'s Toolformer and the function-calling literature established that a model could learn when and how to invoke external tools. The idea survived so completely that tool use is no longer separate from agent architecture. In production terms, an agent is a model working through typed, validated functions and a runtime that executes them.

The production difference is the interface discipline. Research benchmarks often use a curated set of well-documented APIs. An enterprise estate may expose dozens of tools across multiple domains with overlapping names. Production teams therefore review tool descriptions like user-facing documentation, namespace functions and retrieve only the subset relevant to the current context. The exact candidate limit must be measured for the chosen model and tool schemas rather than assumed from a general rule.

The long-context-versus-retrieval debate, settled by cost, not capability

Larger context windows repeatedly revived the claim that retrieval would become unnecessary because a model could ingest the whole corpus. Needle-in-a-haystack evaluations showed that models could locate a planted fact in long context. That capability does not settle the production architecture. The constraint is often economic rather than technical.

Sending a large corpus on every query multiplies input tokens and processing time whether or not the answer needs them. Retrieval narrows the working set first, so unit cost depends on the selected evidence rather than the entire corpus. A long-context-only design makes per-query cost grow with corpus size.

Long context still has a clear role after retrieval, particularly when the selected object is itself long: a contract, investigation file or policy set. That is different from using the entire corpus as the query context. A benchmark can be technically correct and still offer incomplete architectural guidance once cost is a first-class constraint.

Multi-agent debate and reflection, the ideas that mostly did not travel

Multi-agent debate and Reflexion attracted substantial attention because critique can improve output. They remain uncommon in live enterprise paths. Multiple full model passes add cost and latency, while a deterministic rule or source reconciliation may deliver the needed check more cheaply. Use debate when its measured incremental benefit exceeds those alternatives, not because adversarial language sounds rigorous.

Debate and reflection often work better offline. They can generate harder test cases or probe failure modes in a red-team exercise without taxing every live request. The online-versus-offline distinction is central to production economics even when it is irrelevant to a benchmark result.

Tree of Thoughts frames reasoning as search over intermediate states with backtracking. It influenced the way practitioners think about planning, but literal tree search is costly in a live path. Graph orchestration can provide explicit branches through deterministic code. The model reasons only where the branch condition genuinely requires it.

Retrieval augmented generation, survived but transformed

Lewis et al.'s original RAG paper predates this period but remains foundational. Its central idea survived in a form more elaborate than dense-retrieve-then-generate. Dense retrieval is a reasonable starting point, not a universal production end state. Curated question-answering corpora do not reproduce the identifiers, tables, versions and mixed formats of an enterprise document estate.

Production systems added sparse retrieval, reciprocal-rank fusion, reranking and query rewriting. No single addition owns the result; the gain comes from accumulated engineering discipline. The durable idea is to ground generation in retrieved evidence rather than parametric memory alone.

Constrained decoding and structured output, a quiet success story

A less celebrated research line, grammar-constrained decoding and structured output generation, has had a production impact disproportionate to its profile. Early agent systems often prompted for JSON and relied on best-effort parsing. The worked range in this analysis assumes malformed output requiring retries on 3 to 7 percent of calls. That range illustrates the volume effect; a production team should measure its own failure rate by model, schema and prompt.

Constrained decoding restricts the output to tokens consistent with a target schema. It addresses malformed structure by construction rather than by more persuasive prompting. The production need maps closely to the mechanism: return parseable structured output or fail explicitly.

The contrast is useful. Constrained decoding solves a narrow question that can be verified mechanically: does the output conform to the schema? Debate addresses the broader question of whether reasoning is sound by adding another probabilistic process. The more specific and verifiable the target problem, the more cleanly the technique tends to travel.

What died quietly

Open-ended loops in the style of AutoGPT and BabyAGI are largely absent from regulated production. Their defining freedom conflicts with the need for an explicit, reviewable decision structure. Voyager-style skill acquisition is elegant in simulated environments but has no direct fit with closed enterprise workflows that reward bounded execution rather than open exploration.

CAMEL- and MetaGPT-style autonomous teams have travelled in a narrower form. A supervisor may route among specialist agents whose authority has been reviewed, but that is different from an unsupervised team producing an entire artefact. Regulated production favours typed tools, explicit routes and grounded evidence over autonomy gained by removing structure.

Benchmarks, what production teams actually kept

AgentBench, WebArena, SWE-bench, ToolBench and GAIA standardized evaluation across web navigation, software engineering and tool use. Their tasks rarely resemble a bank's internal workflow closely enough to serve as release evidence. The production workload is narrower, domain-specific and bound to data and tools that a public benchmark cannot reproduce.

What survives is the methodology: a held-out labelled set, explicit success criteria and recurring runs against representative traffic. A regulated deployment needs its own domain equivalent of a benchmark, built from adjudicated historical cases and expanded as new edge cases appear. The number of cases follows the risk, heterogeneity and statistical power required; it should not be copied from another programme.

A public model leaderboard is not production-readiness evidence for a specific workload. General model capability and the performance of an agent with this corpus, these tools and these cases are different measurements. Model risk and business sponsors need the second.

Failure modes of adopting research too early

The first failure mode is adopting a paper's reference implementation without checking whether its benchmark resembles the production workload. A debate pattern may improve offline classification yet add enough model passes to breach the response-time budget. An offline benchmark with no waiting user cannot reveal abandonment caused by latency.

The second is treating a reported accuracy figure as portable across domains. Open-domain retrieval and a specialist legal corpus have different document and query distributions. Revalidate on the target population before using the benchmark number in a business case.

The third is underestimating a technique whose cost scales with samples or explored branches. A small evaluation set can hide the multiplier. Model the production traffic distribution, retries and peak concurrency before committing to the pattern.

The production-transfer test

A paper earns an engineering trial when its mechanism addresses a measured failure in the target workflow. Novelty is not a selection criterion. The review starts with the operating problem: a retrieval miss, an unsafe tool choice, an expensive escalation or an unacceptably slow answer. The team then writes the cheapest plausible intervention beside the paper-inspired intervention. That second column prevents a sophisticated method from competing only with the status quo.

I use five gates. Mechanism fit asks whether the intervention acts on the observed failure rather than a proxy. Matched resources holds model, data access and compute as constant as the comparison permits. Slice stability checks that the average gain does not conceal regressions in a material customer or risk segment. Operational fit adds tail latency, failure recovery and human workload. Evidence fit asks whether a reviewer can reconstruct why the system took the action.

The prototype should preserve the paper's causal idea, not necessarily its code. A search paper may be testing whether branching helps when partial states can be scored. The faithful enterprise prototype is therefore a bounded candidate generator plus an independent scorer. Copying the reference repository, including its benchmark-specific prompt and data loader, would preserve the implementation while losing the mechanism.

Transfer gate Question for the review Evidence artefact Reject or restrict when
mechanism fit Which observed failure should this change? failure taxonomy and trace examples no direct path links method to failure
matched resources Does it beat the simplest alternative at equal spend? paired test with token, tool and latency budget gain disappears under matched compute
slice stability Who benefits and who regresses? confidence intervals by consequence and population a protected or high-risk slice deteriorates
operational fit Can the service recover inside its SLO? load, timeout and replay results tail behaviour overwhelms the mean gain
evidence fit Can a reviewer reconstruct the action? versioned trace, sources, policy and tool result the method improves output but obscures control

From paper taxonomy to control architecture

The useful distinction is not agent versus non-agent. It is where uncertainty enters and where it can be removed. Retrieval uncertainty belongs at the evidence boundary. Tool-selection uncertainty belongs before authority is exercised. Planning uncertainty belongs before a long or costly trajectory begins. Output uncertainty belongs before a person or system relies on the result. A paper becomes more valuable when its proposed mechanism can be attached to one of those boundaries.

Figure 2Intent and case state to verify outcome against system of recordCausal and control schematic
Intent and case state to verify outcome against system of record12 declared states connected by 5 authored relations. The figure supports the section From paper taxonomy to control architecture. L0L1L2 01
Intent and case state
02
Retrieve evidence
03
Retrieval sufficient
04
Broaden search or ask for evidence
05
Plan bounded steps
06
Plan preconditions valid
07
Repair or route to human
08
Select typed tool
09
Authority and arguments valid
10
Deterministic deny
11
Execute
12
Verify outcome against system of record
Reading. The authored topology makes 5 declared relations across 12 states inspectable. Read it as the control structure for “From paper taxonomy to control architecture”, not as measured performance. Schematic derived from the paper's authored topology; no measured quantities.

This mapping changes how research is funded. A team does not purchase “reflection.” It funds a verifier at one named boundary and tests whether a second pass corrects a known error class. It does not deploy “multi-agent debate.” It separates evidence collection, policy interpretation and decision authority, then checks whether independent roles reduce correlated error. Roles matter only when they change information, incentives or authority. Different system prompts over the same context rarely provide genuine independence.

Online, offline and counterfactual uses

Some techniques fail as live architecture and succeed as assurance tooling. Debate is a good example. Running two or three models on every case is usually expensive. Running them overnight against yesterday's sampled traces can expose ambiguous policies, retrieval gaps and brittle prompts. Reflection can generate candidate repairs for a failed trajectory without granting the live system permission to rewrite itself. Tree search can expand a small number of severe incidents into counterfactual paths for the regression suite.

Figure 3Live production traces to reworkCausal and control schematic
Live production traces to rework10 declared states connected by 8 authored relations. The figure supports the section Online, offline and counterfactual uses. L0L1L2L3L4 01
Live production traces
02
Risk-weighted sampling
03
Offline critique or debate
04
Failure hypotheses
05
Human adjudication
06
Golden and adversarial cases
07
CI evaluation
08
Release decision
09
New version
10
Rework
Reading. The authored topology makes 8 declared relations across 10 states inspectable. Read it as the control structure for “Online, offline and counterfactual uses”, not as measured performance. Schematic derived from the paper's authored topology; no measured quantities.

The distinction also protects evidence quality. A live self-critique is generated by the system under review and may repeat its blind spot. An offline critique can be compared with a frozen trace, an independent evidence set and a human disposition. The first is a behavioural feature. The second can become part of an assurance process.

A portfolio view of research adoption

An enterprise architecture group needs a portfolio, not a stream of isolated proofs of concept. I divide candidates into three queues. The production queue contains mechanisms with a direct failure target, a measurable comparator and a likely control owner. The evaluation queue contains methods better suited to red-teaming, test generation or trace review. The watch queue contains promising results whose verifier, economics or operational boundary is still missing.

Figure 4Research intake to shared evidence registerCausal and control schematic
Research intake to shared evidence register9 declared states connected by 7 authored relations. The figure supports the section A portfolio view of research adoption. L0L1L2 01
Research intake
02
Primary value
03
Production queue
04
Evaluation queue
05
Watch queue
06
Shadow then bounded release
07
Offline assurance workflow
08
Revisit on new evidence
09
Shared evidence register
Reading. The authored topology makes 7 declared relations across 9 states inspectable. Read it as the control structure for “A portfolio view of research adoption”, not as measured performance. Schematic derived from the paper's authored topology; no measured quantities.

Each item receives an expiry date. If no owner can name the production failure after two review cycles, the item returns to the watch queue. This small discipline prevents a literature review from becoming an innovation backlog whose age is mistaken for importance. The unit of adoption is a controlled change to a workflow, not a paper title.

What the monthly research review should decide

The review is an architecture and evidence meeting, not a paper club. Product brings the cost of the current failure. Engineering brings traces and the simplest intervention. Risk brings the consequence classification and minimum evidence. Research brings the mechanism, boundary conditions and contrary results. Finance brings the production-volume multiplier. One person owns the decision record.

For every candidate, the group makes one of four decisions: run a time-boxed offline test, move to shadow operation, restrict to assurance use or return to the watch queue. “Continue exploring” is not a decision unless it names the missing evidence and a date. A small board that makes explicit stops is more useful than a large community that accumulates experiments.

The decision record should distinguish negative evidence from implementation failure. If the method loses under matched compute on representative cases, that is useful negative evidence. If the test used the wrong tool schema or a contaminated set, the result says little about the method. Both outcomes can stop the current experiment, but only the first should reduce confidence in the underlying mechanism.

The board also watches for correlated bets. Three teams may appear to be testing different frameworks while all depend on the same assumption: that a generated critique is a reliable verifier. Group investments by causal dependency, not vendor or paper name. Otherwise one weak verifier can quietly sit beneath an entire innovation portfolio.

Finally, publish the rejected methods internally. The record should state the workload, comparator, budget and reason. That prevents a new team from repeating the same trial six months later under a new label. It also preserves the option to revisit a method when the constraint changes. A cheaper model, stronger verifier or new business consequence can turn an earlier rejection into a rational new test.

Keep the research inventory linked to production telemetry. When a new incident class appears, the owner can search mechanisms already reviewed against that failure boundary. When a paper claims a better verifier or lower-compute search, the team can identify the rejected trials whose constraint has changed. This is more valuable than a chronological reading list because it makes research retrievable by operational need. The literature then behaves like an engineering asset: versioned, tested, connected to evidence and honest about where it did not transfer.

A worked case, adopting react, then abandoning multi-agent debate

The worked case starts with a ReAct-style agent for claims triage. It retrieves policy details, claim history and known risk indicators. A team then adds an adversarial reviewer inspired by multi-agent debate. The figures below are scenario inputs for comparing the designs, not results from a named client pilot.

Figure 5Claim intake to finalise triageCausal and control schematic
Claim intake to finalise triage6 declared states connected by 4 authored relations. The figure supports the section A worked case, adopting react, then abandoning multi-agent debate. L0L1L2L3 01
Claim intake
02
Triage agent, ReAct loop
03
Adversarial reviewer agent
04
Reviewer disagrees
05
Second triage pass
06
Finalise triage
Reading. The authored topology makes 4 declared relations across 6 states inspectable. Read it as the control structure for “A worked case, adopting react, then abandoning multi-agent debate”, not as measured performance. Schematic derived from the paper's authored topology; no measured quantities.

In the worked comparison, debate lifts triage accuracy from 82.0 to 84.3 percent. It also increases latency from 4.2 to 7.9 seconds and inference cost by 85 percent. At the assumed volume, the extra model pass costs more than the manual rework it avoids. The conclusion depends on those inputs, so an institution should repeat the calculation with its own error cost and traffic.

Figure 6Single agent baseline to debate pattern abandonedCausal and control schematic
Single agent baseline to debate pattern abandoned4 declared states connected by 1 authored relations. The figure supports the section A worked case, adopting react, then abandoning multi-agent debate. L0L1 01
Single agent baseline
02
Debate pattern
03
Cost benefit review
04
Debate pattern abandoned
Reading. The authored topology makes 1 declared relations across 4 states inspectable. Read it as the control structure for “A worked case, adopting react, then abandoning multi-agent debate”, not as measured performance. Schematic derived from the paper's authored topology; no measured quantities.

The alternative is a deterministic cross-check over known high-risk indicators: claim amount, policy age and claimant history. Only the flagged subset reaches a reviewer. In the scenario, that rule layer captures most of the accuracy gain at negligible model cost. The point is not that debate never works. It is that an honestly measured improvement may have a simpler source.

Notes for practitioners

Treat every reported result as a claim about a benchmark under stated conditions, not a portable guarantee. Revalidate on representative production work before adopting the technique. Prefer typed tools, explicit graphs and evidence-grounded retrieval when they deliver the measured outcome with a clearer decision trail.

Calculate the cost of sampling, debate and tree search at production volume rather than pilot volume. When a technique improves quality, test whether a validation rule, retrieval constraint or narrower tool can capture most of the benefit. Reach for another full model pass only when it wins that comparison.

A production-transfer matrix

Research idea Travels when Fails when Cheapest decisive test
ReAct-style loop tools are typed and steps are bounded rationale is mistaken for faithful cognition tool-selection accuracy by task slice
self-consistency error cost exceeds extra sampling cost easy tasks receive the same budget marginal accuracy per additional sample
reflection a verifier or observable outcome corrects the trace prose critiques merely reinforce the first error replay with seeded failure classes
multi-agent debate independent evidence or roles create diversity agents share the same blind spot compare against a deterministic cross-check
tree search partial states can be scored reliably value estimates are weak matched-compute baseline

A research gain must survive matched compute. A production gain must survive task slicing. An oversight claim must survive without treating generated rationales as internal truth. Those three tests remove much of the ambiguity around whether a technique travelled.

Selected papers