Contents
  1. Delegating decisions
    1. Locate the dynamic decision
    2. Define the permitted task
  2. Feedback and knowledge
    1. Feed results into the next choice
    2. Separate observations from state
  3. Architectural development
    1. A short history of agent architectures
    2. Language models enter the loop
  4. Planning and action selection
    1. Maintain an executable plan
      1. Planning horizon
      2. Commitment and reconsideration
      3. Selective revision
    2. Choose a useful next action
      1. Responding while other work continues
  5. Autonomy and intervention
    1. Constrain accumulated effects
    2. Request the right human decision
  6. Completion, stopping and recovery
    1. Establish the achieved outcome
    2. Decide whether to continue
    3. Repair the strategy from known effects
  7. Evidence for architectural choices
    1. Explain the consequential divergence
    2. Measure the value of discretion
  8. Check understanding
  9. Open questions
  10. Selected talks
  11. References
  12. Talk library
← All topics

Agent Engineering

Agent engineering designs systems that choose actions toward a goal, use the results to decide what to do next, and stop within defined limits. This is useful when the next step depends on information discovered during the task. Investigating a failed job, for example, may require inspecting logs, comparing configurations or checking a dependency, depending on the findings. The engineering challenge is to decide which choices to delegate, provide the observations needed to make them, and verify that the resulting work satisfies the task without exceeding its authority or budget.

Delegating decisions

Locate the dynamic decision

A workflow specifies operations and the rules governing transitions between them. Those rules can include branches, parallel work and repetition. A workflow that checks a result and follows a prescribed error branch is still a workflow; responding to observations does not by itself establish delegated discretion.

Here, an agent is a system given discretion to select some subsequent work toward a goal using observations. The distinction concerns who determines the next operation: application-defined transitions or a decision process that can choose among approaches. This is a narrower engineering convention than the broader artificial-intelligence definition, which also includes simple prescribed controllers.

A delegated investigation choice

Example

A model can choose the inspection while fixed code controls execution.

The model interprets the error report to choose its next inspection. Two possible choices are shown; both invoke fixed, authorized read operations.
Read the diagram as text
  • Read error report. Fixed entry operation.
  • Model selects an inspection. Discretion concerns which information to obtain next.
  • Inspect upstream job. Fixed, authorized read operation.
  • Compare schemas. Fixed, authorized comparison procedure.
  • Read error reportModel selects an inspection: observed failure details.
  • Model selects an inspectionInspect upstream job: missing-input hypothesis.
  • Model selects an inspectionCompare schemas: incompatible-field hypothesis.

Routine record conversion usually has known transitions: validate a record, convert supported fields, and reject invalid input. Investigating a failed job can require a less predictable sequence. A missing-file error may justify inspecting the producing job; an incompatible-field error may justify comparing schemas. These examples locate the design choice. Use dynamic selection where interpreting new information usefully changes the work, while accounting for additional latency, variable execution paths and opportunities for mistakes.

The boundary can be small. A prescribed incident workflow can delegate investigation to an agent, then require a structured finding before proceeding. Conversely, the agent can invoke a fixed diagnostic procedure as one tool. Agents vs Workflows: Why Not Both? illustrates this composition: an agent can occupy a workflow step, and a workflow can supply an agent capability. Tool count and model-call count do not identify where discretion lives.

Define the permitted task

Useful discretion requires something stable to pursue. A task specification states the required outcome, starting information, permitted effects and operating constraints. Keep these separate from a proposed procedure. An investigation may change its search strategy while preserving the same target and reporting obligation. Permission to investigate does not implicitly include permission to repair.

Write success conditions in terms that can later be examined. “Investigate thoroughly” leaves both action selection and completion ambiguous. “Identify the failed stage and support the diagnosis with relevant records, or explain what remains unresolved” gives the agent a target for its observations. Instructions communicate these requirements; Specify the intended task develops that interface.

An example specification for a read-only job investigation:
ElementRequirement
Target and starting informationThe identified job run, its error report and accessible diagnostic records.
Required outcomeAn evidence-supported diagnosis or a precise account of unresolved causes.
Permitted effectsRead authorized logs, configurations and dependency status; produce a report.
ConstraintsDo not restart jobs or modify data; finish within the assigned investigation allowance.
Clarification triggerMore than one run fits the request and the intended run cannot be established.
Optional procedureBegin with the error report, then choose further inspections from the findings.

Distinguish missing external facts from missing intent. A lookup can establish when a job ran; it cannot establish which of two plausible jobs the requester meant. DiscoBench's clarification-aware search tasks make this distinction explicit by withholding a distinguishing constraint that a simulated user can supply. Ask when resolving that ambiguity changes the target or acceptable action. An incidental choice within an already defined task need not reopen the delegation.

Feedback and knowledge

Feed results into the next choice

The environment comprises the external systems and conditions relevant to the task. A policy is the rule or model-based process that selects actions using observations and retained information. An action can inspect the environment or change it. The resulting observation then becomes input to a subsequent decision.

A tool call requests an operation exposed by the application. The model supplies the proposed operation and arguments; application code validates, authorizes and dispatches it, then associates the returned result with the call. A structurally valid request does not establish permission or successful execution. Data, requests and effects explains these boundaries.

Closed-loop execution uses observations of action results to guide later choices. A failed test can lead to inspecting a different function; a missing prerequisite can lead to obtaining it before continuing. This adaptation does not require further training. The model's weights, the numerical parameters learned during training, can remain fixed while each invocation receives new information. Changing inputs, keeping weights fixed explains this distinction.

Observations inform the next decision. Application software validates and authorizes proposed calls before execution; those controls are omitted from this overview. Feedback changes the next input, not the model’s trained parameters.

The distinction becomes concrete in What if the harness mattered more than the model?. An initial coding agent proposed a median-function fix without editing the file. After adding test execution and instructions to use feedback, the demonstrated agent ran the failing test, edited the file and reran the test successfully. Both the tools and prompt changed. The useful lesson is the completed feedback path, rather than an isolated claim about either intervention.

Decision-making and execution machinery have different responsibilities. The policy chooses work; the runtime carries out requests, returns observations and supports continuation. Agent Runtimes and Harness Engineering covers that machinery. Feedback also depends on timing: waiting for a complete tool response simplifies turn-taking but can delay reaction to a changing process. Generated code may itself inspect results and branch, so producing several instructions at once does not necessarily make their execution open-loop.

Separate observations from state

Partial observability means the agent receives only some of the information relevant to the task. The environment has a state; the agent has observations of that state and interpretations of them. Kaelbling, Littman and Cassandra's 1998 account of planning under partial observability formalizes this distinction and shows why an information-gathering action can be useful before committing to another action. A language-model transcript is not automatically the probabilistic belief state used in that formalism.

Maintain a working account that distinguishes an observed fact, an inferred explanation and an unresolved outcome. “The query returned no rows” is an observation. “The record does not exist” is a stronger conclusion that depends on the query's scope and freshness. Contradictory responses may concern different versions or moments. Before acting on them, identify what was inspected and when. Context as a selected view and State beyond the transcript explain how this account differs from the input supplied to one model call.

State changes before knowledge

Example

A completed operation may remain unresolved to its observer.

1 / 3 · Running is observed

The server is running A, and the agent receives that status.

The same operation persists. Server states describe reality; observation records describe what the agent has received. An earlier response remains historical evidence after a fresh response arrives.
Read the diagram as text
  • Operation A. Stable operation identity.
  • Server state: running.
  • Observation 1: running. Delivered to the agent.
  • Server state: completed. Not yet known to the agent when first introduced.
  • Observation 2: completed. A later delivered response.
  • Operation AServer state: running: external state.
  • Server state: runningObservation 1: running: observed earlier.
  • Operation AServer state: completed: external state.
  • Server state: completedObservation 2: completed: fresh observation.
  • Operation AObservation 1: running: historical response about A.
  1. Running is observed. The server is running A, and the agent receives that status. Active: Operation A, Server state: running, Observation 1: running. New: Operation A, Server state: running, Observation 1: running.
  2. Completion is not yet observed. The server completes A. Observation 1 is still the agent's latest information. Active: Operation A, Observation 1: running, Server state: completed. New: Server state: completed.
  3. A fresh response arrives. Observation 2 establishes reported completion. Observation 1 remains an earlier record. Active: Operation A, Observation 1: running, Server state: completed, Observation 2: completed. New: Observation 2: completed.

Consider a delayed operation whose last status response says running. The server subsequently completes the work, but the agent has not yet received another response. The correct working status is still “last observed running; current completion unresolved.” Google's long-running operation pattern provides a concrete interface for tracking such work through an operation reference and subsequent status requests.

Task records should therefore preserve pending outcomes and remaining dependencies alongside completed work. A self-maintained to-do list makes intended progress inspectable, but crossing off an item supplies no independent confirmation. Anthropic's long-running agent experiments used explicit feature requirements and tests before marking features complete, addressing premature completion and poorly documented partial work.

Architectural development

A short history of agent architectures

Planning anticipates dependencies, reaction responds to change, and commitment preserves useful decisions. Agent architectures developed ways to combine these needs long before language models. These turning points explain why the approaches still coexist.

Planning, reaction and commitment across agent architectures

  1. 1966–1972ShakeySRI completed an integrated robot system in 1969 and substantially improved it in 1971 during the broader Shakey research program.Sources & context

    Contributors: SRI Shakey team

    What changed: Made complex action sequences and recovery from execution errors concerns of an integrated working system.

  2. 1971STRIPSDescribes planning through an initial world description, a goal and actions with applicability conditions and modeled effects.Sources & context

    Contributors: Fikes and Nilsson, SRI

    What changed: Makes prerequisite ordering explicit while separating a planned operator from actual robot execution.

  3. September 1985 memo; March 1986 journal paperSubsumption architectureAsynchronous behavior layers coordinate through input suppression and output inhibition while lower layers keep running.Sources & context

    Contributors: Rodney Brooks

    What changed: Basic responses need not wait for higher-level work to finish.

  4. 1987Procedural Reasoning System (PRS)Selects procedures from beliefs and goals, retains adopted procedures as intentions and elaborates near-term steps as execution proceeds.Sources & context

    Contributors: Georgeff and Lansky, SRI

    What changed: Demonstrates goal-directed behavior that can respond to new observations without specifying every action in advance.

  5. 1988Resource-bounded commitmentAdopted plans focus subsequent reasoning and filter incompatible alternatives while remaining partial and revisable.Sources & context

    Contributors: Michael Bratman, David Israel and Martha Pollack

    What changed: Explains why retaining useful decisions matters when deliberation consumes time and conditions can change.

  6. 1995Belief–Desire–Intention (BDI)Connects belief–desire–intention theory to practical systems, with commitment rules governing when adopted plans should be abandoned.Sources & context

    Contributors: Rao and Georgeff

    What changed: Makes continuity and reconsideration explicit. OASIS was evaluated alongside airport operations using live radar data.

  7. May 17–21, 1999Remote Agent · Deep Space 1Deep Space 1 experiments integrated onboard planning, command execution, monitoring and diagnosis under operator-supplied goals and constraints.Sources & context

    Contributors: NASA Ames and JPL

    What changed: An injected fault prompted onboard replanning; a separate execution deadlock required ground intervention, demonstrating both capability and recovery limits.

  8. 2021WebGPTTrained GPT-3 to research answers through a text browser, choosing commands from the question and current browser state.Sources & context

    Contributors: Nakano, Hilton, Balaji and OpenAI collaborators

    What changed: Places language-model action selection inside prescribed browsing and answering phases with explicit limits.

  9. October 2022 preprint; March 2023 ICLR camera-ready revisionReActAlternates model-generated reasoning and task actions so returned observations can inform subsequent decisions.Sources & context

    Contributors: Shunyu Yao and colleagues

    What changed: Provides a reusable language-model feedback pattern for updating plans and responding to exceptions.

Follow how systems combine planning, responsive execution and retained commitments, then bring language models into action selection. These approaches coexist; spacing is not to scale.

Language models enter the loop

Reiichiro Nakano and OpenAI collaborators' WebGPT, 2021, trained GPT-3 to research answers through a text browser. The question and browser state guided commands to search, follow links, scroll and collect references. A model command or imposed limit ended browsing, followed by an answering phase. Language-based action selection thus worked within prescribed phases and bounds.

Shunyu Yao and colleagues' ReAct, submitted in October 2022 with an ICLR camera-ready revision in March 2023, made interleaved reasoning, action and observation a reusable pattern. New observations could change subgoals and subsequent actions. Studies covered question answering, fact verification and interactive decisions, but also found reasoning errors, uninformative searches and unproductive loops. This supplied a language-model mechanism for feedback; explicit dependencies, execution checks and stopping limits still required attention.

Planning and action selection

Maintain an executable plan

A plan is a proposed arrangement of actions and subgoals. A subgoal is an intermediate condition that helps satisfy the overall goal. Decomposition makes work easier to inspect, but each new subtask introduces another decision or handoff. Choose a level at which prerequisites and results are clear without turning one coherent operation into many unnecessary choices.

An action's preconditions specify what must hold before it is applicable; its effects describe the facts its modeled execution adds or removes. STRIPS uses these descriptions to make prerequisite ordering explicit, while distinguishing a modeled action from actual robot execution. A step can name the right operation yet occur too early. Valmeekam and colleagues' 2023 planning investigation tested models on tasks with explicit starting states, goals and action rules. The models often used permitted action names but produced sequences that an external validator rejected. Checking the actions in a plan is therefore different from checking whether their ordering can achieve the goal.

Repair one dependency

Example

A new method can preserve a completed prerequisite and the original acceptance requirement.

1 / 3 · Plan the primary route

Input checking is complete. Processing and outcome verification remain planned work.

Step through the plan as the primary service becomes unavailable and an alternative is confirmed. The checked input remains usable, and the required output stays the same. Processing and verification are still future work.
Read the diagram as text
  • Checked input. Completed prerequisite; its checked version remains valid across these steps.
  • Primary processing method. Planned action requiring the primary service to be available.
  • Primary service unavailable. New observation invalidating the primary route's availability assumption.
  • Alternative processing method. New planned action within the same permitted task.
  • Alternative capability confirmed. New observation supports the alternative's availability and required operation.
  • Required output. A planned result, not an artifact already produced.
  • Check task requirements. A planned verification step with unchanged acceptance conditions.
  • Checked inputPrimary processing method: required input.
  • Primary service unavailablePrimary processing method: blocks precondition.
  • Primary processing methodRequired output: expected only if executable.
  • Checked inputAlternative processing method: same required input.
  • Alternative capability confirmedAlternative processing method: supports precondition.
  • Alternative processing methodRequired output: expected result.
  • Required outputCheck task requirements: must exist before checking.
  1. Plan the primary route. Input checking is complete. Processing and outcome verification remain planned work. Active: Checked input, Primary processing method, Required output, Check task requirements. New: Checked input, Primary processing method, Required output, Check task requirements.
  2. Observe a blocked prerequisite. The primary service becomes unavailable. The input remains valid; processing cannot use this route. Active: Checked input, Primary processing method, Primary service unavailable, Required output, Check task requirements. New: Primary service unavailable.
  3. Add a supported continuation. A permitted alternative is confirmed. It can reuse the input and must satisfy the same output checks. Active: Checked input, Primary processing method, Primary service unavailable, Alternative processing method, Alternative capability confirmed, Required output, Check task requirements. New: Alternative processing method, Alternative capability confirmed.

Later models showed stronger planning capability, though results remained sensitive to how the task was represented. A September 2024 PlanBench study reported that o1-preview solved 587 of 600 Blocksworld tasks: rearranging blocks under specified action rules. These problems used three to five blocks and required solutions of two to sixteen steps. On a semantically equivalent set with renamed concepts, it solved 317 of 600. The improvement over earlier models and the difficulty with renamed tasks support separate conclusions: planning capability can improve, while executable-plan checks remain valuable.

Planning horizon

Planning depth determines which assumptions must remain valid before the next observation.
ApproachUseful roleMain obligation
Immediate reactionChoose the next step from the current situation.Retain enough task context to avoid locally attractive but unproductive actions.
Staged plan-and-executeExpose subgoals and dependencies before executing a stage.Check that later steps remain applicable when reached.
Short-horizon replanningPlan a continuation, execute a limited portion, then reconsider with fresh observations.Preserve useful commitments while updating invalid assumptions.

The last approach resembles receding-horizon planning in model predictive control: optimize a future sequence, execute its first input, obtain a new state estimate and solve again. The control-theory formulation requires predictive dynamics, objectives and constraints. Applying its pattern to language agents does not transfer its feasibility or stability results. Deliberation and search can help select the continuation; their computational tradeoffs belong in Reasoning and Test-Time Compute.

Commitment and reconsideration

A plan also saves work by settling choices provisionally. Michael Bratman, David Israel and Martha Pollack's 1988 account of resource-bounded practical reasoning explains how commitment focuses later decisions and filters incompatible alternatives. Reconsidering everything at every step consumes time while the environment continues changing. Plans should remain partial where future conditions are unknown, and revisable when new information invalidates them.

The Procedural Reasoning System made this balance operational: select procedures using current beliefs and goals, retain adopted procedures as intentions, and elaborate near-term steps while leaving later details open. New observations could activate another procedure or interrupt existing work. Its use with SRI's Flakey robot demonstrated this combination of goal-directed planning and reaction.

In belief–desire–intention architectures, beliefs represent information about the environment, desires represent objectives and priorities, and intentions retain the selected course of action. Commitment rules determine when to reconsider. Rao and Georgeff's OASIS example retained an aircraft arrival sequence until completion or until a relevant timing condition could no longer be met. It was evaluated alongside airport operations using live radar data; it did not establish operational control of traffic.

Selective revision

Sehoon Kim and colleagues' LLMCompiler, submitted in 2023 and published at ICML 2024, arranges tool calls proposed by a large language model into a dependency graph. Independent calls can execute together; a dependent call waits for the results it needs. Execution observations can return to the planner to produce another graph. This avoids requiring a model decision between every independent operation. FactSet's planning-agent adaptation separates a high-level workflow outline from detailed planning and execution, then combines task results before deciding whether to replan or finish.

When a prerequisite changes, revise the affected continuation. Suppose an input has been checked, but the intended processing service becomes unavailable. The input check can remain useful while the agent investigates another permitted method. The goal is blocked only if no feasible continuation remains. Rechecking everything wastes work; retaining every assumption ignores the new evidence. Monitored plan repair makes that distinction explicit.

PLANEX checked conditions needed by the remaining plan against its current world description. Observed progress could make planned steps unnecessary; a short recovery plan could restore conditions needed to resume the original plan. It requested replanning when no usable continuation remained. This separates repairing a prerequisite from replacing the whole strategy.

Choose a useful next action

The action space is the set of operations available to the policy. Choosing within it requires more than recognizing the appropriate function. The agent must supply suitable arguments, satisfy prerequisites and choose an operation useful at this point in the task. Choose a call or another response explains immediate selection; sequential selection adds the consequences for later work.

Value of information is the benefit of learning something before choosing a subsequent action. An inspection earns its cost when the expected improvement in subsequent decisions outweighs its cost and delay. Checking a dependency can distinguish “proceed” from “repair the prerequisite.” Another search that cannot change the chosen action adds delay without the same benefit. The metareasoning literature similarly evaluates computation through the decisions it can improve, including its cost and delay.

For a task with an unresolved prerequisite, compare candidate actions by what they enable. A state-changing action is considered only when the delegation permits it.
CandidateUseful whenReason to defer
Inspect the prerequisiteIts status determines whether the next operation can work.A sufficiently current, authoritative result is already available.
Change stateThe target, authority and prerequisites are established.The change may be premature or outside the task.
Check an earlier resultA pending outcome determines which work remains.The service cannot yet provide a more informative observation.
Ask for clarificationDifferent intended targets require different actions.The uncertainty concerns an externally discoverable fact.

Tool granularity determines how many choices the agent must make and what each choice reveals. John Yang, Carlos Jimenez and colleagues' SWE-agent, 2024, studied this through the commands and observations used to search, view and edit repositories. On 300 repository-repair tasks from SWE-bench Lite with GPT-4, an interface returning search summaries resolved 18% of tasks versus 12% for an iterative interface using next/previous commands. Repeated inspection sometimes exhausted the iterative interface's budget. The comparison held model weights fixed and changed the interface; its result supports evaluating action granularity for the task rather than assuming that finer control always helps.

The useful unit is an understandable operation with informative feedback. A task-oriented tool may combine a frequently repeated procedure, while an interactive terminal may need character-level control. Evaluate granularity against the actual task: too little feedback hides decisions, while unnecessary micro-operations multiply them.

Responding while other work continues

Responsiveness also depends on how behaviors share control. In Brooks's subsumption architecture, concurrent layers contain asynchronous finite-state modules that respond to inputs without advancing together. Suppression temporarily replaces a module's normal input with another signal. Inhibition temporarily blocks an output, discarding messages emitted during that interval. Lower layers keep running while higher layers intervene at selected connections.

Directed travel could suppress random wandering while obstacle avoidance remained active; wandering could also be inhibited during observation collection. These signal paths let basic behavior continue without waiting for higher-level results. The robot still had limitations around fast obstacles and clutter.

Brooks's 1991 exposition, Intelligence without representation, explained the broader architectural choice: build complete sensing-to-action behaviors incrementally instead of depending on separately developed modules meeting through an accurate central world model. This approach reduced dependence on that representation. It did not establish that planning was unnecessary; it identified a different way to organize responsive behavior.

Autonomy and intervention

Constrain accumulated effects

Bounded autonomy gives the agent freedom to select actions within an explicit task, authority and resource allowance. Delegated authority specifies the operations it may perform on particular resources for the requester. This boundary applies to the whole attempt. A collection of individually permitted operations can still accumulate excessive effects or move beyond the original goal.

Specify resource scope, allowed operations, cumulative change limits, elapsed time and action budgets separately. Ten inexpensive reads and ten large model requests do not consume equivalent resources. A count limit cannot substitute for every other limit, and keeping each call small does not bound total work. OWASP's unbounded-consumption guidance motivates accounting across inputs, repeated requests and downstream operations.

A documented AgentCore temporal-policy example counts requested amounts over five minutes within a session. Requests of 1000 amount units permit the first two; the third reaches the denied threshold of 3000. This counts requests, not confirmed transfers, and does not establish a limit across separately created sessions.

Behavioral instructions help the policy choose appropriately, but trusted code must enforce protected boundaries. The agent cannot grant itself more authority because a different action appears helpful. Enforce at protected boundaries develops the security principles. In a data-pipeline remediation example, a learned policy proposes a response while an external safety layer can override it and escalate critical or unknown cases.

Prompt injection occurs when untrusted material is interpreted as instructions that redirect the system. A log entry, retrieved page or tool response may contain such instructions, but receiving that content cannot enlarge the delegation. The application must continue to enforce access and action limits independently. When content becomes instructions explains the attack mechanism.

Request the right human decision

Human intervention can supply three different things: information about intent, permission to act, or responsibility for work the agent cannot complete. Mixed-initiative interaction means that people and software share control. Eric Horvitz's 1999 principles connect intervention to uncertainty about user goals, the consequences of a mistaken action and the cost of interrupting the person.

Choose the intervention according to the missing contribution.
InterventionPresent to the personWhat the response enables
ClarificationThe unresolved interpretation and the distinction that affects the task.Select the intended target or requirement.
ApprovalThe concrete action, target and significant parameters.Perform that reviewed operation if other requirements still hold.
HandoffThe unresolved work, evidence, attempted actions and proposed next owner.Transfer responsibility to someone able to continue.

Ask a focused clarification when its answer changes the plan. Request approval at the point where a reviewable consequential action is ready. A changed target or material payload needs renewed authorization; broad assent does not approve every later variation. See Approval has a scope. Enforcement must sit on the execution path, as illustrated by n8n's tool-interception workflow, rather than depending on the agent choosing an optional review tool.

A handoff also needs accepted ownership. PagerDuty's incident lifecycle distinguishes notification, acknowledgment and resolution: acknowledgment means a responder has claimed the still-unresolved issue. An agent that merely sends an escalation message should retain the fact that ownership is unconfirmed. Its remaining work must respect that waiting state and the original scope.

Review is fallible. In Duolingo researchers' 2025 fabricated-alert studies, reviewers accepted some erroneous alerts even after guidelines emphasized independent video evidence. The studies concerned exam review, not agent transaction approval, but demonstrate why a human checkpoint alone cannot establish correctness. Give reviewers the information needed for independent judgment, and account for their attention and workload. Review meaningful changes covers that presentation.

Completion, stopping and recovery

Establish the achieved outcome

The task's success conditions determine what must be checked after action. A postcondition is a required property of the resulting state after successful work. A verifier is a procedure checking a stated property. It may inspect an artifact, execute a test or read authoritative application state. The strength of the conclusion depends on what it actually checks; Checks and their limits explains that boundary.

For an example export operation, each observation supports a different claim.
ObservationSupported claimStill to establish
Model proposes the exportAn operation has been requested.Permission and execution.
Service returns an operation referenceThe service accepted trackable work.Successful completion.
Operation reports successful completionThe specified operation finished successfully.The result satisfies this task.
Result is retrieved and checkedThe inspected artifact satisfies the checked requirements.Any requirements outside those checks.

Match the check to the actual target and result. For the export, inspect the requested account, period and fields, and establish that the artifact can be used as required. Preserve the identity of the checked artifact; a check of an earlier version does not establish a later version's properties. Acceptance, readiness and task satisfaction are separate facts even when an API exposes them through similarly named statuses.

Use direct outcome evidence where possible. A tool-call record establishes what was requested; the resulting database state can establish whether the intended record exists. A passing unit test establishes its tested behavior, while an interactive workflow may require additional checks. Anthropic's coding experiments reported failures visible through browser interaction that simpler checks missed.

When direct verification is unavailable, identify the proxy and the judgment it leaves open. Resemblance to a trusted reference can help assess a document, but cannot establish suitability for every new situation. Report completion as a supported account of the artifact, scope, checks and unresolved work. What Does Done Even Mean? develops this view of completion as several claims rather than a single status flag.

Decide whether to continue

A termination condition ends the current attempt. Verified completion is one such condition; exhausted limits, cancellation or inability to proceed within scope are others. Waiting for useful information differs from ending the attempt. Define these dispositions explicitly so the system can distinguish work that is complete, deferred, blocked or merely no longer being pursued.

Progress detection asks whether observations establish movement toward unmet requirements. More calls, a longer report and a revised to-do list are weak substitutes. Repeating an action without obtaining new information suggests a stall; alternating between approaches without resolving their failure suggests oscillation. The next action should have a feasible reason to improve the task's position. Otherwise, revise the approach, seek intervention or end with an explicit account of what remains.

Microsoft's Magentic-One, 2024, provides a concrete pattern: a task ledger retains facts and a provisional plan, while a progress ledger checks completion, repetition and forward movement. Detected stalls can trigger strategic replanning. These remain model assessments, and independent attempt or time limits can terminate work with only a best guess available.

A limit bounds execution without establishing success. LangGraph's recursion limit counts graph super-steps, which need not equal model calls or tool calls. An application can exit gracefully with a partial result before reaching the limit. Absence of an exception therefore does not establish fulfillment of the original task.

Select the disposition from task evidence and remaining possibilities.
DispositionCondition
Finish successfullyRequired outcomes have supporting checks and relevant process requirements are satisfied.
Continue or replanA permitted, feasible action can advance an unmet requirement within the remaining allowance.
WaitA pending operation or external response can supply needed information.
Request interventionProgress requires missing intent, additional authority or another owner's judgment.
End incompleteThe attempt is cancelled, its allowance is exhausted, or no permitted continuation remains.

Record the stopping reason, task outcome and outstanding operations separately. Ending action selection does not stop an already running external process. Temporal's activity documentation, for example, describes cooperative cancellation that an activity can ignore. Agent Runtimes and Harness Engineering covers continuation and cancellation mechanics; the agent's report must preserve pending work until its status is resolved.

Repair the strategy from known effects

Recovery starts by distinguishing confirmed success, confirmed failure without an effect, and an unknown outcome. Recovery after execution introduces these cases. A timeout can leave the client uncertain even though the operation completed. Repeating the request under that uncertainty can create a second effect.

Reconciliation checks authoritative state against the intended operation. After a lost acknowledgment, retain the operation identifier and inspect its status before considering a potentially duplicating action. A confirmed effect preserves progress. Confirmed absence may permit another attempt. If the evidence remains inconclusive, keep the outcome unresolved and apply the remaining time and authority limits.

Unknown effects require reconciliation

Recovery branches on established effects, not merely an error response.

Confirmed success preserves progress. Confirmed absence of an effect allows consideration of a corrected or alternative attempt. Unknown effects first require authoritative inspection; unresolved uncertainty can require waiting or handoff.
Read the diagram as text
  • Classify known effect. Use the operation contract and available evidence.
  • Reconcile authoritative state. Retain the original operation identity.
  • Retain established progress. Continue only with work still required.
  • Assess correction or another method. Check prerequisites, authority and remaining allowance.
  • Begin bounded corrective attempt. An endpoint for a new execution cycle.
  • Wait or hand off unresolved work. Preserve pending effects and the reason further action is blocked.
  • Classify known effectRetain established progress: success confirmed.
  • Classify known effectAssess correction or another method: failure with no effect confirmed.
  • Classify known effectReconcile authoritative state: effect unknown.
  • Reconcile authoritative stateRetain established progress: intended effect confirmed.
  • Reconcile authoritative stateAssess correction or another method: no effect confirmed.
  • Reconcile authoritative stateWait or hand off unresolved work: still unknown.
  • Assess correction or another methodBegin bounded corrective attempt: feasible and permitted within limits.
  • Assess correction or another methodWait or hand off unresolved work: no permitted continuation.

Idempotency can make repeated requests represent one logical operation when the receiving API enforces that contract. A caller-provided identifier distinguishes a retry from a deliberate second operation with identical parameters. It is not an exactly-once guarantee for arbitrary tools. The implementation belongs in Agent Runtimes and Harness Engineering; strategically, duplicate protection and determining whether the task succeeded remain separate needs.

Once effects are known, match the repair to the obstacle. Correct a request rejected before execution. Obtain information missing from a decision. Refresh state whose assumptions no longer hold. Choose another method when the current one lacks a required capability. Repeating an infeasible approach consumes the allowance without repairing the plan. Retain completed work where it remains valid, and reconsider the dependent continuation.

The Remote Agent flight experiments illustrate two recovery boundaries. An injected camera-switch failure prompted onboard replanning. A separate real execution deadlock required ground investigation and termination of the first experiment; a later six-hour experiment completed validation. Operators had supplied goals and constraints, but remained responsible for a fault the onboard system could not resolve. Successful recovery from one disturbance did not establish autonomous recovery from every failure.

Compensation performs new actions to counter earlier effects. It differs from atomic rollback: another actor may have changed the state, cancellation may incur a cost, and an already observed message cannot be made unseen. Microsoft's compensating-transaction pattern therefore treats recovery as business-specific work that can itself fail. Any remedy requires its own applicable authority; an earlier mistake does not grant permission for unlimited corrective action.

Escalation is a legitimate recovery outcome. In the data-pipeline remediation design, deterministic checks establish incident facts, a bounded policy selects a response, and an external layer escalates unknown or high-risk cases. Measuring success only by avoidance of escalation would penalize intended behavior. The relevant question is whether the system made the best permitted progress and left unresolved work with a usable next step.

Evidence for architectural choices

Explain the consequential divergence

A trajectory is the ordered observations, selected actions and results from one task attempt. Examine both the final outcome and the decisions along the way. Several trajectories can satisfy the same task, so exact agreement with a reference path can reject useful alternatives. Conversely, reaching the right final state can conceal a prohibited intermediate action.

Locate the earliest consequential divergence rather than the first superficial difference. First establish whether the needed information reached the decision-maker. A fact absent from a diagnostic log may still have appeared in the effective model input; inspect the actual input boundary before attributing an information gap. If the observation was available, examine whether the selected action was justified by it. Record inputs, outputs and versions explains the recording requirements.

Consider two attempts given the same observation: a required input has not yet been produced. One inspects the upstream job; the other immediately starts the dependent operation, which rejects the missing input. Their action choices diverge under shared information. The second choice is inconsistent with the known prerequisite, but its trace alone does not establish whether the model ignored or misunderstood the observation.

Generated explanations are additional outputs, not direct access to the cause of a decision. Anthropic's reasoning-faithfulness experiments found cases where injected hints changed answers without being acknowledged in the generated reasoning. Such accounts can suggest hypotheses, but cannot by themselves prove that a particular observation caused the action.

Execution conditions can also explain the outcome. Anthropic's infrastructure-noise study varied resources while holding the model, harness and tasks fixed, changing both infrastructure failures and task success. A failed dependency installation could reflect a resource-heavy strategy interacting with a memory limit. Use Turn failures into hypotheses to test such explanations through controlled changes.

Across attempts, group paths by meaningful decisions and compare their outcomes. A recurring low-performing sequence can reveal a missing prerequisite or an unhelpful tool choice, but association is a lead for investigation. Preserve enough identifiers, outcomes and selected diagnostic fields to test that lead. Do not make unrestricted retention of prompts, retrieved documents or tool responses the price of debugging; OWASP's logging guidance requires protecting or excluding sensitive data.

Measure the value of discretion

Return to the original architectural choice with whole-task evidence. Compare credible alternatives: a prescribed procedure, a procedure containing one bounded dynamic stage, and broader model-directed execution where that design is plausible. Define each variant by the decisions it delegates. Restore starting states separately, and state tool access, time limits, retry allowances and human assistance. Tasks, attempts and outcomes and Baselines, budgets and repeated attempts establish the comparison method.

AI Agents That Matter, 2024, provides a narrow reason to take simple baselines seriously. Across 164 HumanEval function-generation tasks and five runs per system, a procedure that regenerated after test failure while increasing sampling temperature had no significant accuracy difference from the best-performing complex architecture, while costing less than several agents. This concerns short coding tasks, not open-ended investigations or human supervision costs.

τ-bench, 2024, broadened assessment to interactions among tools, agents and simulated users. It checks final database state and required user-facing information, and measures consistency across repeated trials. Its pass^k measure concerns all k independent trials succeeding, whereas pass@k requires at least one success. The paper explicitly warns that a successful final-state check can miss a trajectory violation such as acting without required confirmation.

Keep the consequences of discretion visible instead of hiding them inside a single score.
DimensionRecord for each design
Useful completionSatisfied task requirements, partial results and unresolved outcomes.
Prohibited effectsWrong targets, excessive changes and other explicitly forbidden outcomes.
Recovery and stoppingBehavior after blocked dependencies, changed observations and uncertain effects; appropriate deferral.
Resources and unnecessary workAction counts, repeated work, latency and total resource use per task attempt.
Human effortClarification, review, correction and accepted handoffs, including the person's time.

Separate task utility from unwanted consequences. AgentDojo uses explicit simulated application state and distinct checks for intended task success and attacker objectives. That design permits a satisfactory answer and an unwanted side effect to be recorded separately. Each checker still covers only its encoded conditions.

Exercise disturbances deliberately. ReliabilityBench combines repeated executions, task variations and injected tool failures with final-state predicates. For your application, include blocked prerequisites, stale information, unknown effects and exhausted allowances alongside ordinary completion. Distinguish an error injected before execution from an acknowledgment lost after a mutation; they require different recovery. Test-case coverage must reflect the intended users and operating conditions, as emphasized by NIST's measurement guidance.

A changed action needs a consistent continuation. Once a candidate takes a different branch, feeding it the old run's subsequent observations may describe a world its actions never produced. Recompute downstream state and observations through an appropriate executor or simulator. Offline, replay, shadow and live evidence explains this limit; RL Environments and Simulators covers the environment mechanics.

Simulator behavior also changes the difficulty. In Build Evals That Actually Matter, Lyft's initial simulated users patiently supplied unusually complete explanations. Evaluation became harder after the team incorporated production examples and trained the user simulator to resemble customer language. Lower scores alone did not prove production validity, but exposed how cooperative simulation could hide failures.

Use the comparison to change a specific delegation. If adaptive investigation improves acceptable completion but unrestricted repair adds unwanted effects or review burden, keep investigation dynamic and constrain repair. If a prescribed procedure handles the workload adequately, broader discretion needs another demonstrated benefit. The engineering result is a justified boundary around particular decisions, supported by outcomes under the conditions in which the system will operate.

Open questions

  1. The useful boundary of discretion remains workload-dependent. Broader planning can adapt to unfamiliar conditions while adding execution and supervision costs. Progress would mean matched comparisons that isolate delegated decisions and measure acceptable completion, unwanted effects and human correction effort together.

  2. Progress detection remains difficult when intermediate results are ambiguous or delayed. Model-written ledgers can preserve both useful commitments and mistaken assumptions. Better methods would detect consequential stalls early, without discarding valid work or repeatedly interrupting productive attempts.

  3. Human intervention must improve decisions within finite review capacity. Approval interfaces can encourage deference, while frequent interruptions consume attention. Progress would establish when clarification, independent review and handoff improve whole-task outcomes after accounting for the person's effort.

  4. Simulations must remain informative when agents choose unfamiliar paths. Consistent tool state is necessary, but realistic user behavior and disturbances are also difficult to reproduce. Progress would show that changes which improve simulated outcomes predict improvements under representative live conditions.

Follow the curated reading path through the speakers and demonstrations behind this entry.

Explore more talks

The rest of the library, beyond the curated path. Cited talks support this entry; reviewed transcripts were processed in full. Metadata candidates have not been reviewed as sources or verified as topic members.

727 matching talks

TalkSpeakerEventYear
Chip HuyenAI Engineer Summit 20252025
Dex HorthyAI Engineer World's Fair 20252025
Adam TerlsonAI Engineer Summit 20252025
Sayash KapoorAI Engineer Summit 20252025
Chau TranAI Engineer World's Fair 20252025
Jesse HuAI Engineer Code 20252025
Angus J. McLeanAI Engineer Europe 20262026
Roy DerksAI Engineer Summit 20252025
Leo PekelisAI Engineer World's Fair 20242024
Jim BennettAI Engineer World's Fair 20252025
Ornella Bahidika, Joel AllouAI Engineer World's Fair 20262026
Harnesses in AI: A Deep Dive

Transcript reviewed

Tejas KumarAI Engineer Europe 20262026
Leonie MonigattiAI Engineer Europe 20262026
Sally-Ann DeLuciaAI Engineer Europe 20262026
Gaurav MishraAI Engineer World's Fair 20262026
Zhou YuAI Engineer Summit 20252025
Hanna Lichtenberg, Aamir ShakirAI Engineer World's Fair 20262026
Vinoth GovindarajanAI Engineer World's Fair 20262026
Samuel ColvinAI Engineer Code 20252025
Eric AllamAI Engineer World's Fair 20252025
Security Firewall for Agents

Transcript reviewed

Ryan DahlAI Engineer World's Fair 20262026
Fouad MatinAI Engineer World's Fair 20252025
Angel Ortmann LeeAI Engineer World's Fair 20262026
Talha SheikhAI Engineer Europe 20262026
Mahmoud MabroukAI Engineer Europe 20262026
Fuzzing in the GenAI Era

Transcript reviewed

Leonard TangAI Engineer World's Fair 20252025
Darius EmraniAI Engineer World's Fair 20252025
Nishant GuptaAI Engineer World's Fair 20262026
Cornelia DavisAI Engineer Code 20252025
Sumaiya ShrabonyAI Engineer World's Fair 20262026
Sarmad QadriAI Engineer World's Fair 20252025
Yohei NakajimaAI Engineer World's Fair 20262026
Agents need more than a chat

Cited in this entry

Jacob LauritzenAI Engineer Europe 20262026
Ronak MaldeAI Engineer World's Fair 20262026
Michael AlbadaAI Engineer World's Fair 20252025
Divakar KumarAI Engineer World's Fair 20262026
Nishant GuptaAI Engineer World's Fair 20262026
Maxime Rivest, Isaac MillerAI Engineer World's Fair 20262026
Alex GavrilescuAI Engineer Code 20252025
fighting slop with slop

Transcript reviewed

Vaibhav GuptaAI Engineer World's Fair 20262026
How to Kill the Code Review

Transcript reviewed

Ankit JainAI Engineer World's Fair 20262026
Ilan BigioAI Engineer Summit 20252025
Misha Kaletsky, Jonas TemplesteinAI Engineer Europe 20262026
Thor Schaeff, Philipp SchmidAI Engineer Europe 20262026
Joel Allou, Ornella BahidikaAI Engineer World's Fair 20262026
Cornelia DavisAI Engineer World's Fair 20262026
Eno ReyesAI Engineer World's Fair 20242024
Elizabeth Fuentes LeoneAI Engineer World's Fair 20262026
Erik MeijerAI Engineer World's Fair 20262026
Liam McGarrigleAI Engineer Europe 20262026
Dan MasonAI Engineer World's Fair 20252025
Ameya BhatawdekarAI Engineer World's Fair 20262026
Shreya Rajpal, Aman GuptaAI Engineer World's Fair 20262026
Lukas PeterssonAI Engineer World's Fair 20262026
Alex Shaw, Ryan MartenAI Engineer World's Fair 20262026
Kobie CrawfordAI Engineer Europe 20262026
Aparna Dhinkaran, Aparna DhinakaranAI Engineer Summit 20252025
Al HarrisAI Engineer Code 20252025
Kyle MisteleAI Engineer World's Fair 20262026
Gabe De MesaAI Engineer World's Fair 20262026
Aparna DhinakaranAI Engineer World's Fair 20252025
Jeff NgAI Engineer World's Fair 20262026
Yuval BelferAI Engineer World's Fair 20252025
Matija SosicAI Engineer Summit 20232023
Jon PeckAI Engineer World's Fair 20252025
Sarthak AggarwalAI Engineer World's Fair 20262026
Build Systems, Not Code

Transcript reviewed

Angie JonesAI Engineer World's Fair 20262026
Anju KambadurAI Engineer Summit 20252025
Scott WuAI Engineer World's Fair 20252025
DottaAI Engineer World's Fair 20262026
Respect The Process

Transcript reviewed

Andrew DumitAI Engineer World's Fair 20262026
Rustem FeyzkhanovAI Engineer World's Fair 20262026
Dat Ngo, Aman KhanAI Engineer World's Fair 20252025
Subbiah Sethuraman, Abhilash AsokanAI Engineer World's Fair 20262026
Kenny WorkmanAI Engineer World's Fair 20262026
Your agent is blindfolded

Transcript reviewed

Johan LajiliAI Engineer Europe 20262026
Sina ShahandehAI Engineer World's Fair 20262026
Tushar JainAI Engineer World's Fair 20262026
Eno ReyesAI Engineer World's Fair 20252025
Mike ChristensenAI Engineer Europe 20262026
Cedric VidalAI Engineer World's Fair 20252025
Philipp SchmidAI Engineer Europe 20262026
The Agentic AI Engineer

Cited in this entry

Benedikt Sanftl, Burak Cemil ÖzafşarAI Engineer World's Fair 20262026
Michele CatastaAI Engineer Code 20252025
Kam LasaterAI Engineer Summit 20252025
Vivek MuppallaAI Engineer World's Fair 20262026
Dex HorthyAI Engineer Code 20252025
Jerry Wu, Wyatt MarshallAI Engineer World's Fair 20252025
Harrison ChaseAI Engineer World's Fair 20252025
Matthias LuebkenAI Engineer Europe 20262026
A Song of Types and Agents

Metadata candidate

Roberto StagiAI Engineer World's Fair 20262026
Ari HeljakkaAI Engineer Summit 20252025
Bala RamdossAI Engineer World's Fair 20262026
Will Hang, Cathy ZhouAI Engineer Code 20252025
Barry Zhang, Mahesh MuragAI Engineer Code 20252025
Ido SalomonAI Engineer Europe 20262026
Ezra Tanzer, Dan ArpinoAI Engineer World's Fair 20262026
Brendan O'LearyAI Engineer Europe 20262026
Hubert MisztelaAI Engineer World's Fair 20252025
Nicholas Kang, Michael AaronAI Engineer Europe 20262026
Stephen ChinAI Engineer World's Fair 20252025
Zach BlumenfeldAI Engineer World's Fair 20252025
Uday Kiran Medisetty, Adam HudaAI Engineer World's Fair 20262026
Steve YeggeAI Engineer World's Fair 20262026
Kevin HouAI Engineer Summit 20252025
Dan Fu, Olive SongAI Engineer World's Fair 20262026
Agents Building Agents

Metadata candidate

Alfonso GrazianoAI Engineer World's Fair 20262026
Mike SpitzAI Engineer Europe 20262026
Shawn "swyx" WangAI Engineer Europe 20262026
Agents Need Feature Flags

Metadata candidate

Sachin GuptaAI Engineer World's Fair 20262026
Armanas PovilionisAI Engineer World's Fair 20262026
Armanas PovilionisAI Engineer World's Fair 20262026
Steve RuizAI Engineer Europe 20262026
Nick Nisi, Lizzie SiegleAI Engineer World's Fair 20252025
Ian Butler, Nick GregoryAI Engineer World's Fair 20252025
Rajat ShahAI Engineer World's Fair 20262026
Anita KirkovskaAI Engineer Summit 20252025
Matt PocockAI Engineer Europe 20262026
Nick Nisi, Zack ProserAI Engineer World's Fair 20252025
Nagkumar Arkalgud, Keiji KanazawaAI Engineer World's Fair 20252025
Brendan RappazzoAI Engineer World's Fair 20262026
Justin SmithAI Engineer World's Fair 20262026
Gagan Bhat, Isabella Kai HeAI Engineer World's Fair 20262026
Frank CoyleAI Engineer World's Fair 20262026
Patrick LöberAI Engineer Europe 20262026
Richmond AlakeAI Engineer World's Fair 20252025
Lance MartinAI Engineer World's Fair 20242024
Robert BrennanAI Engineer Code 20252025
Denys LinkovAI Engineer World's Fair 20262026
Arjun Chintapalli, Bhavani KalisettyAI Engineer Summit 20252025
Greg BensonAI Engineer World's Fair 20252025
Paul Klein IVAI Engineer World's Fair 20262026
Dr. Sajjan KanukolanuAI Engineer World's Fair 20262026
Raj NavakotiAI Engineer Europe 20262026
Louis-François Bouchard, Paul Iusztin, Samridhi VaidAI Engineer Europe 20262026
Will BrykAI Engineer World's Fair 20252025
Michael HablichAI Engineer Europe 20262026
Julián Duque, Anush DSouzaAI Engineer World's Fair 20252025
Antje BarthAI Engineer World's Fair 20252025
Rita KozlovAI Engineer World's Fair 20252025
Du’An Lightfoot, Banjo ObayomiAI Engineer World's Fair 20252025
Mahesh MuragAI Engineer Summit 20252025
Jerry LiuAI Engineer World's Fair 20252025
Bruno Passos, Beyang LiuAI Engineer Summit 20252025
Bennet FennerAI Engineer Europe 20262026
Ben KusAI Engineer World's Fair 20252025
Ekaterina DeynekaAI Engineer World's Fair 20262026
Lou BichardAI Engineer World's Fair 20252025
Soumya Gupta, Jai ChopraAI Engineer World's Fair 20262026
Cedric VidalAI Engineer World's Fair 20252025
Thor Schaeff, PaulAI Engineer World's Fair 20252025
Peter WielanderAI Engineer Code 20252025
Anoop Kotha, Toki SherbakovAI Engineer World's Fair 20252025
Shaan DesaiAI Engineer Summit 20252025
Matt PocockAI Engineer World's Fair 20262026
Ivan LeoAI Engineer Code 20252025
Apoorva JoshiAI Engineer World's Fair 20252025
Michael FesterAI Engineer World's Fair 20252025
Damien MurphyAI Engineer World's Fair 20242024
Building Self-Coding Agents

Metadata candidate

Colin FlahertyAI Engineer Summit 20252025
Tom MoorAI Engineer World's Fair 20252025
Dominik KundelAI Engineer World's Fair 20252025
Anant ShankhdharAI Engineer World's Fair 20262026
Hugo Santos, Madison FaulknerAI Engineer Europe 20262026
Michael GrinichAI Engineer World's Fair 20252025
Thariq ShihiparAI Engineer Code 20252025
Boris ChernyAI Engineer World's Fair 20252025
Codex and Subagents

Metadata candidate

Vaibhav Srivastav, Katia Gil GuzmanAI Engineer Europe 20262026
Jon Peck, Christopher HarrisonAI Engineer World's Fair 20252025
Francesco Bonacci, Dillon DuPont, Robert WendtAI Engineer World's Fair 20262026
Dhruv BatraAI Engineer World's Fair 20262026
Conquering Agent Chaos

Metadata candidate

Rick BlalockAI Engineer World's Fair 20252025
Containing Agent Chaos

Metadata candidate

Solomon HykesAI Engineer World's Fair 20252025
Andreas Kollegger, Zaid ZaimAI Engineer Europe 20262026
Soheil FeiziAI Engineer World's Fair 20262026
Liam HamptonAI Engineer Europe 20262026
Karina NguyenAI Engineer Summit 20252025
Anushrut GuptaAI Engineer World's Fair 20252025
Ben HylakAI Engineer World's Fair 20262026
Chintan Agrawal, Daniel WirjoAI Engineer World's Fair 20262026
Max Kanat-AlexanderAI Engineer Code 20252025
Ahmad AwaisAI Engineer Code 20252025
Ara KhanAI Engineer Europe 20262026
Laurie VossAI Engineer World's Fair 20252025
Barry ZhangAI Engineer Summit 20252025
Sylendran ArunagiriAI Engineer World's Fair 20252025
Kevin HouAI Engineer World's Fair 20242024
Satya NittaAI Engineer World's Fair 20242024
Rishabh BhargavaAI Engineer Europe 20262026
Ishita DagaAI Engineer World's Fair 20262026
Mason EggerAI Engineer World's Fair 20252025
Danny Gollapalli, Ben Hylak, Zubin KotichaAI Engineer Europe 20262026
Katelyn LesseAI Engineer Code 20252025
Nina Lopatina, Rajiv ShahAI Engineer World's Fair 20252025
Cormac BrickAI Engineer Europe 20262026
May WalterAI Engineer World's Fair 20262026
Sandipan BhaumikAI Engineer Europe 20262026
Joel HronAI Engineer World's Fair 20252025
Abhishek BhardwajAI Engineer World's Fair 20262026
Daniel Kim, Daria SobolevaAI Engineer World's Fair 20252025
Brooke HopkinsAI Engineer World's Fair 20252025
Jason LopateckiAI Engineer World's Fair 20262026
Paola Estefanía de CamposAI Engineer World's Fair 20262026
Future-Proof Coding Agents

Metadata candidate

Bill Chen, Brian FiocaAI Engineer Code 20252025
Luke HarriesAI Engineer Europe 20262026
Giving a Voice to AI Agents

Metadata candidate

Scott StephensonAI Engineer World's Fair 20242024
Mark MyshatynAI Engineer World's Fair 20252025
Anirban ChatterjeeAI Engineer World's Fair 20262026
Brian JohnAI Engineer Code 20252025
Nik PashAI Engineer Code 20252025
Ryan Lopopolo, Vibhu SapraAI Engineer Europe 20262026
Vasant KearneyAI Engineer World's Fair 20262026
Phil HetzelAI Engineer Europe 20262026
Evan BoyleAI Engineer World's Fair 20252025
Donald HruskaAI Engineer World's Fair 20252025
Hailong ZhangAI Engineer Summit 20252025
Preetika Bhateja, Daniel BumpAI Engineer World's Fair 20262026
KP Sawhney, Ian BallantyneAI Engineer Europe 20262026
Niels RoggeAI Engineer World's Fair 20262026
Ash Prabaker, Andrew WilsonAI Engineer Europe 20262026
Patrick DoughertyAI Engineer Summit 20252025
Jared HansonAI Engineer World's Fair 20252025
Kyle CorbittAI Engineer World's Fair 20252025
Rene BrandelAI Engineer World's Fair 20252025
Mustafa Ali, Kyle CorbittAI Engineer Summit 20252025
HTML Is All Agents Need

Metadata candidate

James RussoAI Engineer World's Fair 20262026
Amol KapoorAI Engineer World's Fair 20262026
Radek SienkiewiczAI Engineer Europe 20262026
Kyle Jaejun LeeAI Engineer World's Fair 20262026
Identity for AI Agents

Metadata candidate

AI Engineer Code 20252025
Vivek TrivedyAI Engineer World's Fair 20262026
Tariq ShaukatAI Engineer World's Fair 20262026
Mahmoud AbdelwahabAI Engineer Code 20252025
Suman DebnathAI Engineer World's Fair 20252025
Justin McCartyAI Engineer World's Fair 20242024
Kim MaidaAI Engineer World's Fair 20262026
Tom SmokerAI Engineer World's Fair 20252025
Michael RichmanAI Engineer Europe 20262026
Rukma SenAI Engineer World's Fair 20242024
Shafik Quoraishee, Joanne SongAI Engineer World's Fair 20262026
Eno ReyesAI Engineer Code 20252025
Ronan McGovernAI Engineer World's Fair 20252025
Stefania DrugaAI Engineer World's Fair 20262026
Mark Bain, Vasilije Markovic, Daniel Chalef, Alex GilmoreAI Engineer World's Fair 20252025
Kwindla Kramer, Shrestha Basu MallickAI Engineer World's Fair 20252025
Amy Boyd, Nitya NarasimhanAI Engineer Europe 20262026
Shirsha ChaudhuriAI Engineer Summit 20252025
Jess Grogan-Avignon, Jack WangAI Engineer Europe 20262026
Ola MabadejeAI Engineer World's Fair 20252025
Arjun SinghAI Engineer World's Fair 20262026
Maggie AppletonAI Engineer Europe 20262026
Frank CoyleAI Engineer World's Fair 20262026
Lech KalinowskiAI Engineer World's Fair 20262026
Antje BarthAI Engineer World's Fair 20262026
Benjamin SteinAI Engineer World's Fair 20242024
Christopher HarrisonAI Engineer World's Fair 20252025
Kwindla Hultman KramerAI Engineer World's Fair 20252025
Juan Herreros ElorzaAI Engineer Europe 20262026
Samuel ColvinAI Engineer Europe 20262026
Steven MoonAI Engineer Summit 20252025
Proactive Agents

Metadata candidate

Kath KorevecAI Engineer Code 20252025
Luke AlvoeiroAI Engineer Europe 20262026
Douwe KielaAI Engineer Summit 20252025
Hursh AgrawalAI Engineer World's Fair 20262026
Recursive Coding Agents

Metadata candidate

Raymond WeitekampAI Engineer World's Fair 20262026
Connor AdamsAI Engineer Europe 20262026
Patrick DeboisAI Engineer Summit 20252025
Daniel HanAI Engineer World's Fair 20252025
Onur SolmazAI Engineer Europe 20262026
Preeti SomalAI Engineer World's Fair 20252025
Sam MorrowAI Engineer Europe 20262026
Bobby Tiernay, Kam SweenAI Engineer World's Fair 20252025
Merve NoyanAI Engineer Europe 20262026
Kyle Penfound, Jeremy Adams - CasañasAI Engineer World's Fair 20252025
Mike ChambersAI Engineer World's Fair 20252025
Laurie VossAI Engineer Europe 20262026
Peter BarAI Engineer World's Fair 20252025
Pedro RodriguesAI Engineer Europe 20262026
Marc KlingenAI Engineer Europe 20262026
Robert BrennanAI Engineer World's Fair 20252025
Steven WillmottAI Engineer Europe 20262026
Charles PackerAI Engineer Summit 20252025
Josh PurtellAI Engineer World's Fair 20252025
Brandon WaselnukAI Engineer Europe 20262026
Cedric ClyburnAI Engineer World's Fair 20262026
Vikash Agrawal, LindaAI Engineer World's Fair 20252025
Rishi DesaiAI Engineer World's Fair 20262026
Ibragim BadertdinovAI Engineer Europe 20262026
Nuno CamposAI Engineer Europe 20262026
Sohail Shaikh, Ankush RastogiAI Engineer World's Fair 20262026
Apoorva Joshi, Ben PerlmutterAI Engineer World's Fair 20242024
The Age of the Agent

Metadata candidate

Flo CrivelloAI Engineer Summit 20232023
Christopher Harrison, John PeckAI Engineer World's Fair 20252025
Zack Reneau-WedeenAI Engineer Summit 20252025
The Agent-Native Company

Metadata candidate

Rick BlalockAI Engineer World's Fair 20252025
Tara AgyemangAI Engineer Europe 20262026
Ramesh Raskar, Maria GorskikhAI Engineer World's Fair 20262026
Vincent ChenAI Engineer Europe 20262026
Corey GallonAI Engineer World's Fair 20262026
Brook RiggioAI Engineer World's Fair 20252025
Beyang LiuAI Engineer World's Fair 20252025
Rushabh DoshiAI Engineer World's Fair 20262026
Justin SchroederAI Engineer World's Fair 20262026
Aparna DhinakaranAI Engineer World's Fair 20262026
Junyang LinAI Engineer World's Fair 20252025
The Log Is The Agent

Metadata candidate

Ishaan SehgalAI Engineer World's Fair 20262026
Hassan El MghariAI Engineer World's Fair 20262026
Lou BichardAI Engineer Europe 20262026
Kshitij GroverAI Engineer Summit 20252025
Sandipan BhaumikAI Engineer Europe 20262026
Omer PrimorAI Engineer World's Fair 20262026
Jan CurnAI Engineer World's Fair 20252025
Alberto RomeroAI Engineer Code 20252025
Emil EifremAI Engineer World's Fair 20262026
MuhtesemAI Engineer Summit 20252025
Manoj Nair, Ezra, RandallAI Engineer World's Fair 20262026
Cormac BrickAI Engineer Europe 20262026
Forrest Brazeal, Matt BallAI Engineer World's Fair 20252025
Training Agentic Reasoners

Metadata candidate

Will BrownAI Engineer World's Fair 20252025
Dr. Sarah BuchnerAI Engineer World's Fair 20242024
Mike ConoverAI Engineer Summit 20252025
Paul Iusztin, Louis-François BouchardAI Engineer World's Fair 20262026
João MouraAI Engineer World's Fair 20242024
Erik HanchettAI Engineer World's Fair 20262026
Victor DibiaAI Engineer World's Fair 20252025
Eddie SiegelAI Engineer Summit 20252025
Sidney PrimasAI Engineer World's Fair 20262026
Moritz JohnerAI Engineer World's Fair 20262026
Sai Krishna RallabandiAI Engineer World's Fair 20262026
Soumith ChintalaAI Engineer Summit 20252025
What RL Means for Agents

Metadata candidate

Will BrownAI Engineer Summit 20252025
What the Best Agents Share

Metadata candidate

Mardu SwanepoelAI Engineer Europe 20262026
Dmitry PetrovAI Engineer World's Fair 20262026
Why Agent Engineering

Metadata candidate

swyx (Shawn Wang)AI Engineer Summit 20252025
Nupur SharmaAI Engineer Europe 20262026
Ahmad AwaisAI Engineer World's Fair 20252025
Diane LinAI Engineer World's Fair 20262026
Zach BlumenfeldAI Engineer Europe 20262026
Christopher Lovejoy, Saul HowardAI Engineer World's Fair 20262026
Ari HeljakkaAI Engineer World's Fair 20252025
Prukalpa SankarAI Engineer World's Fair 20262026
Dan FarrellyAI Engineer World's Fair 20262026
Tisha Chawla, Susheem KoulAI Engineer World's Fair 20262026
Rachel Lee Nabors (RL Nabors)AI Engineer Europe 20262026
Erik HanchettAI Engineer World's Fair 20262026
Rafael LeviAI Engineer Europe 20262026
Hamza TahirAI Engineer World's Fair 20262026
Rizel ScarlettAI Engineer Summit 20252025
Zack ProserAI Engineer Europe 20262026
Rustin BanksAI Engineer World's Fair 20252025
Ben BurtenshawAI Engineer Europe 20262026
Ramana Siddanth EmaniAI Engineer World's Fair 20262026
Cedric VidalAI Engineer World's Fair 20242024
Daniel HanAI Engineer World's Fair 20262026
Joel BeckerAI Engineer Code 20252025
Cormac BrickAI Engineer World's Fair 20262026
Jesús BarrasaAI Engineer World's Fair 20252025
Diego CarpenteroAI Engineer Europe 20262026
John DickersonAI Engineer World's Fair 20252025
2026: The Year the IDE Died

Metadata candidate

Steve Yegge, Gene KimAI Engineer Code 20252025
A Genius With Amnesia

Metadata candidate

Victor SavkinAI Engineer World's Fair 20262026
Nathan LambertAI Engineer World's Fair 20252025
Damien MurphyAI Engineer World's Fair 20252025
Chintan Parikh, Weiyi WangAI Engineer Europe 20262026
AGI: The Path Forward

Metadata candidate

Eiso Kant, Jason WarnerAI Engineer Code 20252025
Christopher ChedeauAI Engineer World's Fair 20252025
Nathaniel Whittemore (NLW)AI Engineer Code 20252025
Boris Bogatin, Toufic BoubezAI Engineer Code 20252025
Olivier Leplus, Yohan LasorsaAI Engineer Europe 20262026
Philipp SchmidAI Engineer World's Fair 20252025
swyxAI Engineer World's Fair 20242024
Vibhor KumarAI Engineer World's Fair 20242024
Natalie SerrinoAI Engineer Code 20252025
Zach Blumenfeld, Ben Squire, Ryan KnightAI Engineer World's Fair 20262026
AI’s Jurassic Park Period

Metadata candidate

Aaron StanleyAI Engineer World's Fair 20262026
AI SDK v6

Metadata candidate

Nico AlbaneseAI Engineer Europe 20262026
Vasuman MozaAI Engineer World's Fair 20262026
Amazon AGI

Metadata candidate

Amazon AGI, Aditya KhandelwalAI Engineer World's Fair 20262026
Beyang LiuAI Engineer Code 20252025
Henry MaoAI Engineer World's Fair 20252025
Abhishek BhardwajAI Engineer World's Fair 20252025
Corey CooperAI Engineer World's Fair 20252025
Ivan BurazinAI Engineer World's Fair 20252025
Don Bosco DuraiAI Engineer Summit 20252025
Michal CichraAI Engineer Europe 20262026
Nimrod HauserAI Engineer Europe 20262026
Marlene MhangamiAI Engineer Europe 20262026
Filip KozeraAI Engineer World's Fair 20252025
Parth AsawaAI Engineer World's Fair 20262026
Grace IsfordAI Engineer Summit 20252025
Rajiv ChandegraAI Engineer World's Fair 20262026
Josh AlbrechtAI Engineer World's Fair 20252025
Hervé BredinAI Engineer Europe 20262026
Stephen BatifolAI Engineer Europe 20262026
Siddharth AhujaAI Engineer World's Fair 20252025
Samuel DentonAI Engineer World's Fair 20262026
SallyAnn DeLucia, Fuad AliAI Engineer Code 20252025
Paige Bailey, Guillaume Vernade, Ian BallantyneAI Engineer Europe 20262026
Eliza Cabrera, Jeremy SilvaAI Engineer World's Fair 20252025
Varun Badrinath Krishna, Petro Junior Milan, Rachelle MatternAI Engineer World's Fair 20242024
Max Brodeur-UrbasAI Engineer World's Fair 20252025
John CrepezziAI Engineer Summit 20252025
Angie JonesAI Engineer World's Fair 20262026
Harrison ChaseAI Engineer Summit 20232023
Building Cursor Composer

Metadata candidate

Lee RobinsonAI Engineer Code 20252025
David KaramAI Engineer World's Fair 20252025
Building Reactive AI Apps

Metadata candidate

Matt WelshAI Engineer Summit 20232023
Steve KaliskiAI Engineer Europe 20262026
Building security around ML

Metadata candidate

Dr. Andrew DavisAI Engineer World's Fair 20242024
Jamie Neuwirth, Zack WittenAI Engineer World's Fair 20242024
Eric ZakariassonAI Engineer Europe 20262026
Andrew ThompsonAI Engineer World's Fair 20252025
Abed MatiniAI Engineer World's Fair 20262026
Prasenjit SarkarAI Engineer Europe 20262026
Atul RamachandranAI Engineer World's Fair 20262026
Nathan SoboAI Engineer World's Fair 20252025
Cat Wu, Thariq Shihipar, Simon WillisonAI Engineer World's Fair 20262026
Lance MartinAI Engineer World's Fair 20262026
Derek BinghamAI Engineer World's Fair 20242024
Morgante PellAI Engineer World's Fair 20242024
Sunil PaiAI Engineer Europe 20262026
Jacob KahnAI Engineer Code 20252025
Codex, Behind the Harness

Metadata candidate

Dominik KundelAI Engineer World's Fair 20262026
Naman JainAI Engineer Code 20252025
Cohere for VPs of AI

Metadata candidate

Vivek MuppallaAI Engineer World's Fair 20242024
Pedro RodriguesAI Engineer Europe 20262026
Jedrick Kosinski, ComfyAnonymousAI Engineer World's Fair 20252025
Yusuf OlokobaAI Engineer Code 20252025
Priscila Andre de OliveiraAI Engineer Europe 20262026
Pierluca D'OroAI Engineer World's Fair 20262026
Stephen ChinAI Engineer Europe 20262026
Stephen ChinAI Engineer Code 20252025
Context Is the New Code

Metadata candidate

Patrick DeboisAI Engineer Europe 20262026
Val Bercovici, Callan FoxAI Engineer Code 20252025
Convex Launch

Metadata candidate

Jamie TurnerAI Engineer World's Fair 20242024
Dominik KundelAI Engineer World's Fair 20242024
Copilots Everywhere

Metadata candidate

Thomas Dohmke, Eugene YanAI Engineer World's Fair 20242024
Santosh RadhaAI Engineer World's Fair 20242024
Dmytro (Dima) DzhulgakovAI Engineer World's Fair 20242024
Vincent KocAI Engineer Europe 20262026
Mahesh SathiamoorthyAI Engineer World's Fair 20262026
#define AI Engineer

Metadata candidate

Greg Brockman, swyx, Jensen HuangAI Engineer World's Fair 20252025
Defying Gravity

Metadata candidate

Kevin HouAI Engineer Code 20252025
Shawn Wang (swyx)AI Engineer World's Fair 20252025
Develop at Idea Velocity

Metadata candidate

Jeffrey Lee-ChanAI Engineer World's Fair 20262026
Dan ShipperAI Engineer Code 20252025
Phil HetzelAI Engineer Europe 20262026
Don't be data poor

Metadata candidate

Anuj IravaneAI Engineer World's Fair 20262026
Tomas ReimersAI Engineer World's Fair 20252025
Arthur ObjartelAI Engineer Summit 20252025
Philipp SchmidAI Engineer World's Fair 20262026
Sheila Gulati, Nischal NadhamuniAI Engineer World's Fair 20242024
Joseph Wang, SidAI Engineer World's Fair 20262026
Ofer MendelevitchAI Engineer Code 20252025
Doug GuthrieAI Engineer World's Fair 20252025
Ara KhanAI Engineer Europe 20262026
Carlos Esteban, DougAI Engineer World's Fair 20252025
Julia Neagu, Deanna Emery, Maitar AsherAI Engineer World's Fair 20252025
Garry TanAI Engineer World's Fair 20262026
Sam BhagwatAI Engineer World's Fair 20262026
Theo BrowneAI Engineer World's Fair 20262026
Sarah ChiengAI Engineer Europe 20262026
Field Guide to Fable

Metadata candidate

Thariq ShihiparAI Engineer World's Fair 20262026
Ankur GoyalAI Engineer World's Fair 20252025
Craig WattrusAI Engineer World's Fair 20252025
Emma Ning, Tsavo KnottAI Engineer World's Fair 20252025
Samir ModyAI Engineer Code 20252025
Rafael LeviAI Engineer Europe 20262026
Mounir MouawadAI Engineer World's Fair 20252025
Antje Barth, Mike ChambersAI Engineer World's Fair 20242024
Romain HuetAI Engineer World's Fair 20242024
KitzeAI Engineer World's Fair 20252025
Chris NoringAI Engineer Europe 20262026
Frontier Feud

Metadata candidate

Barr Yaron, Mihir, John, Tina, Shresta, Paige, Colin, Petra, StevenAI Engineer Summit 20252025
Mark Backman, AleixAI Engineer World's Fair 20252025
Jason LiuAI Engineer World's Fair 20262026
Jerry LiuAI Engineer World's Fair 20242024
The Future of MCP

Metadata candidate

David Soria ParraAI Engineer Europe 20262026
Gateways are All You Need

Metadata candidate

Karan SampathAI Engineer Europe 20262026
Cassidy HardinAI Engineer Europe 20262026
Omar SansevieroAI Engineer Europe 20262026
Ruben CasasAI Engineer Europe 20262026
Keegan McCallumAI Engineer World's Fair 20262026
Dave BurnisonAI Engineer World's Fair 20242024
Sarah KhalifeAI Engineer World's Fair 20242024
John PhamAI Engineer World's Fair 20252025
Mike BursellAI Engineer World's Fair 20252025
Andreas KolleggerAI Engineer World's Fair 20252025
Iman MakaremiAI Engineer World's Fair 20252025
Kyle KranenAI Engineer World's Fair 20252025
Dex HorthyAI Engineer World's Fair 20262026
Zhengyao JiangAI Engineer World's Fair 20262026
Brian ScanlanAI Engineer Europe 20262026
How Claude Code Works

Metadata candidate

Jared ZoneraichAI Engineer Code 20252025
How Deep Research Works

Metadata candidate

Mukund Sridhar, Aarush SelvanAI Engineer Summit 20252025
Sunny RekhiAI Engineer World's Fair 20262026
Eno ReyesAI Engineer World's Fair 20262026
Leo MehrAI Engineer World's Fair 20262026
Vinoo GaneshAI Engineer World's Fair 20262026
Alex BauerAI Engineer World's Fair 20262026
Benjamin VerbeekAI Engineer Europe 20262026
Dan FengAI Engineer World's Fair 20262026
Kwindla Hultman KramerAI Engineer World's Fair 20242024
Hamel Husain, Emil SedghAI Engineer World's Fair 20242024
David MyttonAI Engineer World's Fair 20252025
Beth GlenfieldAI Engineer World's Fair 20252025
Ian ButlerAI Engineer World's Fair 20252025
Christopher LovejoyAI Engineer Europe 20262026
Jeff Huber, Jason LiuAI Engineer World's Fair 20252025
Muktesh MishraAI Engineer World's Fair 20252025
Joe ReeveAI Engineer Europe 20262026
Samuel ColvinAI Engineer World's Fair 20252025
Mitesh PatelAI Engineer World's Fair 20252025
Nicolas SchlaepferAI Engineer World's Fair 20242024
Imagination Engineering

Metadata candidate

Eve BouffardAI Engineer World's Fair 20262026
Yu SuAI Engineer World's Fair 20262026
Alex LissAI Engineer World's Fair 20252025
Judging LLMs

Metadata candidate

Alex VolkovAI Engineer World's Fair 20242024
Robert ChandlerAI Engineer World's Fair 20252025
Lawrence JonesAI Engineer Europe 20262026
David KaramAI Engineer World's Fair 20252025
Raymond FengAI Engineer World's Fair 20262026
Juan PeredoAI Engineer Summit 20252025
Xiaofeng WangAI Engineer Summit 20252025
Guillaume VernadeAI Engineer Europe 20262026
Danilo CamposAI Engineer Europe 20262026
Ben HolmesAI Engineer World's Fair 20262026
Dat NgoAI Engineer Europe 20262026
Daniel WhitenackAI Engineer World's Fair 20242024
Sally Ann O'MalleyAI Engineer Europe 20262026
Joel BeckerAI Engineer Code 20252025
Daniel HanAI Engineer World's Fair 20242024
Adam BehrensAI Engineer World's Fair 20252025
Vincent KocAI Engineer Europe 20262026
Eashan SinhaAI Engineer World's Fair 20252025
Pietro ZulloAI Engineer World's Fair 20262026
MCP is all you need

Metadata candidate

Samuel ColvinAI Engineer World's Fair 20252025
David CramerAI Engineer World's Fair 20252025
Matt CareyAI Engineer Europe 20262026
Liad Yosef, Ido SalomonAI Engineer Europe 20262026
Manuel OdendahlAI Engineer World's Fair 20252025
Greg KamradtAI Engineer World's Fair 20252025
Drasko ProfirovicAI Engineer World's Fair 20262026
Mentoring the Machine

Metadata candidate

Eric HouAI Engineer World's Fair 20252025
Peter Werry, BrandonAI Engineer Europe 20262026
Minimax M2

Metadata candidate

Olive SongAI Engineer Code 20252025
Ilan BigioAI Engineer World's Fair 20252025
Alvaro MoralesAI Engineer World's Fair 20252025
Martin Harrysson, Natasha ManiarAI Engineer Code 20252025
Neil ZeghidourAI Engineer Europe 20262026
Mark HenningsAI Engineer Summit 20232023
Notion's Token Town

Metadata candidate

Sarah SachsAI Engineer World's Fair 20262026
On AI and Knowledge

Metadata candidate

Pablo CastroAI Engineer World's Fair 20262026
Sharif ShameemAI Engineer World's Fair 20252025
Garrett GalowAI Engineer Europe 20262026
Sonny Merla, Mauro Luchetti, Mattia RedaelliAI Engineer Europe 20262026
Saoud RizwanAI Engineer World's Fair 20262026
OpenAI for VPs of AI

Metadata candidate

Prashant Mital, Toki SherbakovAI Engineer Summit 20252025
Phil NashAI Engineer Europe 20262026
DottaAI Engineer Europe 20262026
Ishan AnandAI Engineer World's Fair 20262026
Mario ZechnerAI Engineer Europe 20262026
Randall HuntAI Engineer World's Fair 20252025
Dmitry KuchinAI Engineer World's Fair 20252025
Pragmatic AI With TypeChat

Metadata candidate

Daniel RosenwasserAI Engineer Summit 20232023
Steve KorshakovAI Engineer World's Fair 20262026
Anish Agarwal, Matthew SchoenbauerAI Engineer World's Fair 20252025
Sander SchulhoffAI Engineer World's Fair 20252025
Prompt Engineering is Dead

Metadata candidate

Nir GazitAI Engineer World's Fair 20252025
Nick NisiAI Engineer Europe 20262026
RAG for VPs of AI

Metadata candidate

Jerry LiuAI Engineer World's Fair 20242024
Kuba RogutAI Engineer Europe 20262026
Chris ParsonsAI Engineer Europe 20262026
Raza HabibAI Engineer World's Fair 20242024
Stefania DrugaAI Engineer World's Fair 20252025
Harald Kirschner, Christopher HarrisonAI Engineer World's Fair 20252025
Chad Bailey, Brian JohnsonAI Engineer World's Fair 20252025
Idan GazitAI Engineer World's Fair 20262026
Recursive Model Improvement

Metadata candidate

Lee RobinsonAI Engineer World's Fair 20262026
Will BrownAI Engineer World's Fair 20262026
David GomesAI Engineer Europe 20262026
Rayan GargAI Engineer World's Fair 20262026
Anton TroynikovAI Engineer Summit 20232023
Kshitij GroverAI Engineer World's Fair 20252025
Boris StarkovAI Engineer Europe 20262026
Rewiring the State

Metadata candidate

Eoin MulgrewAI Engineer Europe 20262026
Clay Bavor, Alessio FanelliAI Engineer World's Fair 20252025
RL Environments at Scale

Metadata candidate

Will BrownAI Engineer Code 20252025
Aakanksha ChowdheryAI Engineer World's Fair 20252025
Shashi JagtapAI Engineer World's Fair 20262026
Stephan SteinfurtAI Engineer Europe 20262026
Michael YuanAI Engineer World's Fair 20252025
Scaffold Wisely

Metadata candidate

Rahul SengottuveluAI Engineer Summit 20252025
Alessandro CappelliAI Engineer Europe 20262026
Adrian BertagnoliAI Engineer Europe 20262026
Scaling to Long Horizons

Metadata candidate

Ross Taylor, Chengxi TaylorAI Engineer World's Fair 20262026
See, Hear, Speak, Draw

Metadata candidate

Logan Kilpatrick, Simón FishmanAI Engineer Summit 20232023
Joshua SnyderAI Engineer Europe 20262026
Raahul Singh, Vanč LevstikAI Engineer World's Fair 20262026
Aman KhanAI Engineer World's Fair 20252025
Jared JoselowitzAI Engineer World's Fair 20262026
Giran Moodley, Mayan Soni, Oussama Hafferssas, Mayank SoniAI Engineer Europe 20262026
Ben SteinAI Engineer World's Fair 20252025
Yogendra MirajeAI Engineer World's Fair 20262026
Skills are the New SDKs

Metadata candidate

Elvin AghammadzadaAI Engineer World's Fair 20262026
Skills at Scale

Metadata candidate

Nick Nisi, Zack ProserAI Engineer Europe 20262026
Asaf BordAI Engineer Code 20252025
Louis Knight-WebbAI Engineer Europe 20262026
Matt PocockAI Engineer Europe 20262026
Gus Martins, Ian BallantyneAI Engineer Europe 20262026
The New Code

Metadata candidate

Sean GroveAI Engineer World's Fair 20252025
State of Data

Metadata candidate

Sean CaiAI Engineer World's Fair 20262026
Sarah GuoAI Engineer World's Fair 20252025
Peter Steinberger, swyxAI Engineer Europe 20262026
Annabell SchäferAI Engineer World's Fair 20262026
Manish SanwalAI Engineer Summit 20252025
Thiyagarajan MaruthavananAI Engineer World's Fair 20262026
Stop Using RAG as Memory

Metadata candidate

Daniel ChalefAI Engineer World's Fair 20252025
Taylor Jordan SmithAI Engineer World's Fair 20252025
Pydantic is all you need

Metadata candidate

Jason LiuAI Engineer Summit 20232023
Jack MorrisAI Engineer Code 20252025
Brian BalfourAI Engineer World's Fair 20252025
Kobie CrawfordAI Engineer Europe 20262026
Ronan McGovernAI Engineer World's Fair 20252025
swyxAI Engineer Summit 20232023
Barr YaronAI Engineer World's Fair 20252025
Barr YaronAI Engineer World's Fair 20262026
Patrick DeboisAI Engineer World's Fair 20252025
Sumit AgarwalAI Engineer World's Fair 20242024
Jack CableAI Engineer World's Fair 20262026
Dani Grant, Chelcie TaylorAI Engineer World's Fair 20252025
Chris White, Bryan Bischof, Brittany WalkerAI Engineer Summit 20232023
Kevin Madura, Mo BhasinAI Engineer World's Fair 20252025
Travis FrisingerAI Engineer World's Fair 20252025
Diamond BishopAI Engineer Summit 20252025
Natalie MeurerAI Engineer World's Fair 20262026
The End of Apps

Metadata candidate

KitzeAI Engineer Europe 20262026
Addy OsmaniAI Engineer World's Fair 20262026
Kieran KlaassenAI Engineer World's Fair 20262026
Sam FertigAI Engineer World's Fair 20252025
Armin Ronacher, Cristina Poncela CubeiroAI Engineer Europe 20262026
Ankur GoyalAI Engineer World's Fair 20252025
The Future of Work

Metadata candidate

Toran Bruce Richards, Silen Naihin, PootsAI Engineer Summit 20232023
Alexander Embiricos, Romain Huet, Peter SteinbergerAI Engineer World's Fair 20262026
Allie Howe, Dex Horthy, Geoffrey Huntley, Ian Livingstone, Greg PstruchaAI Engineer World's Fair 20262026
Chang She, Noah ShpakAI Engineer World's Fair 20242024
Jesse HanAI Engineer World's Fair 20252025
William LyonAI Engineer World's Fair 20252025
Itamar FriedmanAI Engineer World's Fair 20262026
Almog BakuAI Engineer Summit 20252025
The Making of Devin

Metadata candidate

Scott WuAI Engineer World's Fair 20242024
Ray MyersAI Engineer World's Fair 20252025
Phil HetzelAI Engineer Europe 20262026
Marah Abdin, Robert McHardyAI Engineer World's Fair 20262026
Jacob E. ThomasAI Engineer World's Fair 20262026
Raphael KalandadzeAI Engineer World's Fair 20262026
The New Application Layer

Metadata candidate

Malte UblAI Engineer Europe 20262026
Kwindla Kramer, Kwindla Hultman KramerAI Engineer World's Fair 20262026
Arturo NunezAI Engineer World's Fair 20262026
The Prompt is the Platform

Metadata candidate

Dominik, Dominik TornowAI Engineer World's Fair 20262026
Jonathan FernandesAI Engineer World's Fair 20252025
Elmer Thomas, Maria BermudezAI Engineer World's Fair 20252025
Filip MakraduliAI Engineer World's Fair 20252025
Itamar FriedmanAI Engineer Code 20252025
Alex Volkov, Benjamin EckelAI Engineer World's Fair 20252025
Walden, Carter, Tanay, Alex Atallah, NavAI Engineer World's Fair 20262026
Aparna DhinakaranAI Engineer Code 20252025
Gregory BrussAI Engineer World's Fair 20252025
Paul Klein IVAI Engineer World's Fair 20252025
Alex VolkovAI Engineer World's Fair 20262026
tldraw computer

Metadata candidate

Steve RuizAI Engineer World's Fair 20252025
Stefania DrugaAI Engineer Summit 20252025
Ayush BhardwajAI Engineer World's Fair 20262026
Rafal Wilinski, Vitor BaloccoAI Engineer World's Fair 20252025
Geoffrey LittAI Engineer World's Fair 20252025
Thabang LedwabaAI Engineer World's Fair 20252025
Jon PeckAI Engineer World's Fair 20252025
Useful General Intelligence

Metadata candidate

Danielle PerszykAI Engineer World's Fair 20252025
Sonam PankajAI Engineer World's Fair 20262026
Eugene YanAI Engineer World's Fair 20262026
Matt DaileyAI Engineer World's Fair 20262026
Veo 3 for developers

Metadata candidate

Paige BaileyAI Engineer World's Fair 20252025
Nico AlbaneseAI Engineer Summit 20252025
Harald KirschnerAI Engineer World's Fair 20252025
Harald KirschnerAI Engineer World's Fair 20252025
Itamar FriedmanAI Engineer World's Fair 20252025
Michael ArnaldiAI Engineer Europe 20262026
James LeAI Engineer World's Fair 20262026
Fryderyk WiatrowskiAI Engineer Europe 20262026
Nik CaryotakisAI Engineer Summit 20252025
Allen PikeAI Engineer World's Fair 20262026
Dippu Kumar SinghAI Engineer Europe 20262026
Suman DebnathAI Engineer World's Fair 20252025
Rajkumar SakthivelAI Engineer World's Fair 20262026
Lucas PalmaAI Engineer World's Fair 20262026
Bilge YücelAI Engineer Europe 20262026
Nicholas ArcolanoAI Engineer Code 20252025
Tobin SouthAI Engineer World's Fair 20252025
Remy GuercioAI Engineer Europe 20262026
Lei ZhangAI Engineer Code 20252025
Eugene Yan, Hamel Husain, Jason Liu, Dr Bryan Bischof, Charles Frye, Shreya ShankarAI Engineer World's Fair 20242024
Andy TriedmanAI Engineer Summit 20252025
Fryderyk Wiatrowski, Peter AlbertAI Engineer World's Fair 20242024
Victoria MelnikovaAI Engineer World's Fair 20252025
Phil HetzelAI Engineer Europe 20262026
Garrett GalowAI Engineer Europe 20262026
Tom Shapland, PhDAI Engineer World's Fair 20252025
Sunil Pai, Matt CareyAI Engineer Europe 20262026
Why MLX

Metadata candidate

AI Engineer Europe 20262026
Daniel SzokeAI Engineer Europe 20262026
Samuel HumeauAI Engineer Europe 20262026
Dr. Jasper ZhangAI Engineer World's Fair 20252025
James LoweAI Engineer World's Fair 20252025
Kevin HouAI Engineer World's Fair 20252025
Chin Keong LamAI Engineer World's Fair 20252025
Eugene CheahAI Engineer Summit 20252025
Balázs HorváthAI Engineer World's Fair 20262026
Ravi MadabhushiAI Engineer World's Fair 20262026
Veronica HylakAI Engineer World's Fair 20262026
Dan BjornnAI Engineer World's Fair 20262026
Tun Shwe, Jeremy FrenayAI Engineer Europe 20262026
Sachin KumarAI Engineer World's Fair 20262026
Jeremiah LowinAI Engineer Code 20252025
Mike PhippsAI Engineer World's Fair 20262026
Sean DuBois, Kwindla Hultman Kramer, YaxinAI Engineer World's Fair 20252025
Lisa OrrAI Engineer Code 20252025
Yuxuan ZhangAI Engineer Code 20252025

References

Coverage and source review
Processed transcripts
93 processed in full · 5 in the curated path
Automated source review
Passed
Metadata candidates
639 unreviewed; not verified topic membership
Corpus version
1bd8e407b26a07b33815594e1b2db5f41827119a2b3cb6fbf240f9fc571fc767

Automated review checks source support; it is not publication approval.

A synthesis of selected conference talks and technical references. Citations link to the source material; they do not imply that every talk on this subject is included.

  1. Workflow Patterns

    Workflow definitions specify activities and their routing. The paper describes sequences, concurrent branches, conditional choices based on control data, and cycles that repeat activities. Its examples include evaluating an insurance claim after retrieving the customer file, then either paying damages or contacting the customer. Prescribed workflows therefore need not be straight-line sequences: their executed paths can depend on observations while remaining governed by specified control rules.

  2. Building effective agents

    The article distinguishes workflows, whose paths are prescribed by code, from agents that choose how to proceed and which tools to use. It presents prompt chaining, routing, parallel work, orchestrator-worker decomposition, and evaluator-optimizer feedback as different arrangements rather than one universal architecture. Autonomous loops suit tasks whose steps cannot be fully predetermined, but need environmental feedback, stopping conditions, and opportunities for human intervention. Tool interfaces should make intended use and errors clear; adding autonomy also adds latency, cost, and compounding-error risks.

  3. Artificial Intelligence: Foundations of Computational Agents — Agents and Environments

    An agent receives information from an environment and issues commands that can affect it. Its controller chooses commands using current observations and retained information. The textbook distinguishes commands from actual effects: a purchasing command can fail because communication breaks, stock disappears, or the price changes. Observations can also remain ambiguous despite reliable sensors. Its examples include simple prescribed controllers, so agent behavior does not inherently require language-model deliberation.

  4. Agents vs Workflows: Why Not Both?

    Agents and workflows can be nested through tool and step interfaces.

  5. The Agentic AI Engineer

    Use spec-driven development to capture success criteria, context, tools, responsibilities, exclusions, and boundaries independently of the implementation.

  6. Building Reliable Agentic Systems

    Keep domain-specific success criteria and decision checklists explicit instead of removing them solely to increase generality.

  7. When Search Agents Should Ask: DiscoBench for Clarification-Aware Deep Search

    DiscoBench exposes Search, Ask, and Answer actions during multistep information tasks. Ambiguity is constructed by removing distinguishing constraints so several entities or interpretations remain plausible. A simulated user can supply a verified distinguishing clue, allowing the agent to refine its search. The analysis separates recognizing ambiguity from asking an effective question and finds trajectories that continue searching before guessing despite unresolved ambiguity. Search-then-ask trajectories had higher checkpoint pass rates than search-heavy guessing in the reported analysis.

  8. Principles of Mixed-Initiative User Interfaces

    Horvitz recommends choosing automated action and clarification by considering uncertainty about user goals, the consequences of mistaken action, and the cost of interrupting the user. Assistance can be narrowed when evidence is insufficient, and users need ways to invoke, terminate, and refine it. Microsoft's LookOut illustrates this approach: it extracts appointment information from an email, presents tentative fields for editing and saving, and can display a broader calendar view when it cannot identify an exact time.

  9. Function calling

    The application supplies tool descriptions and argument schemas; the model returns a proposed function name and arguments. The application parses arguments, dispatches its own code, and sends the resulting output back with the corresponding call identifier. The model can then answer or request further calls. Strict mode constrains arguments to the supported schema; object schemas require additionalProperties:false and required properties, with nullable types representing optional values. Application-side validation and authorization must occur before effects: a schema-valid customer identifier can still identify the wrong customer or an inaccessible account.

  10. ReAct: Synergizing Reasoning and Acting in Language Models

    ReAct interleaves model-generated reasoning and actions with observations supplied by an environment. Reasoning can track subgoals or identify missing information; an action retrieves evidence or changes state; the next reasoning step conditions on the resulting observation and can revise the plan. This supplies a feedback mechanism unavailable to a fixed, unobserved action sequence. The paper's trajectory analysis nevertheless finds reasoning errors, repeated thoughts/actions that fail to escape a loop, and uninformative searches that derail subsequent reasoning.

  11. Language Models are Few-Shot Learners

    Few-shot inference supplies demonstrations as input conditioning while keeping model weights fixed; fine-tuning changes pretrained weights through training. Examples consume bounded context and influence subsequent predictions without becoming parameter updates. Separately, benchmark contamination means evaluation material overlaps training data, weakening claims of generalization to unseen examples. GPT-3's study compares original scores with subsets lacking detected n-gram overlap, but acknowledges false positives and possible distribution differences between clean and original subsets. Conceptually, contamination concerns exposure to evaluation data; optimizing a proxy concerns objective mismatch, while biased reviewer labels concern measurement. Those problems can occur independently.

  12. What if the harness mattered more than the model? - Aditya Bhargava, Etsy

    In the median-function example, bounded read/write access produced a suggested fix but no edit; adding a feedback-loop prompt and test execution led to an edit followed by a passing test run.

  13. Function Calling is All You Need

    The demonstrated agent repeatedly processes model tool calls until the model returns no further calls.

  14. Agents are Robots Too: What Self-Driving Taught Me About Building Agents — Jesse Hu, Abundant

    Waiting for a complete tool response implicitly discretizes observation and action, simplifying reasoning while limiting real-time reactions.

  15. Planning and Acting in Partially Observable Stochastic Domains

    A partially observable decision process separates the world’s state from the observations available to the agent. A belief state is a probability distribution updated from prior belief, an action and a new observation; a policy selects actions from that belief. The paper’s listening example shows that an action can gather information before committing to a consequential choice. This grounds the distinction between planning over incomplete evidence and assuming the latest tool response describes all relevant reality.

  16. PROV-DM: The PROV Data Model

    PROV represents a source snapshot and its summary as distinct entities, with a summarization activity that used the snapshot and generated the summary. wasGeneratedBy can record generation time; wasDerivedFrom links the result to its source. Entity attributes can carry application-specific versions, and revision and invalidation relations describe later changes. Applied to retrieval, retain source identity/version, transformation identity, and separate source, retrieval, and summary-generation times. Freshness requires additional application policy: check the authoritative source's current version or validity, inspect invalidation, and enforce a task-appropriate age limit. Generating a summary today does not make its old source facts current.

  17. AIP-151: Long-running operations

    Google's long-running operation pattern returns a trackable operation instead of the eventual result. Clients retrieve progress and partial-failure metadata through GetOperation. Errors preventing execution from starting differ from errors recorded after execution begins. A resource undergoing creation or deletion may already appear in reads while remaining unusable. The specification also permits completed validation-only operations, illustrating why operation completion must be interpreted according to the requested operation.

  18. Let's Build an Agent from Scratch — Kam Lasater

    The demonstration combines planning and read/write memory in a tool-accessible to-do list.

  19. Effective harnesses for long-running agents

    Anthropic reports coding agents leaving partially implemented work undocumented or declaring completion after seeing only partial progress. Its experimental approach records feature requirements with explicit passing status, progress notes, and version-control history for subsequent sessions. Agents work incrementally and test features before marking them complete. A published feature fixture specifies observable interface behavior rather than merely requesting code changes. The report also describes cases where unit tests or HTTP checks missed failures visible through end-to-end browser interaction.

  20. Shakey the Robot — SRI Technical Note 323

    SRI's Shakey research ran from 1966 through 1972. The team completed its first integrated robot system in 1969 and a substantially improved system in 1971. The original program sought systems capable of creating intermediate strategies and goals for incompletely specified problems. Nilsson's collected report emphasizes integrating perception with action, recovering from incorrectly executed actions, and planning and executing complex sequences. These concerns therefore preceded language-model agents by decades.

  21. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving

    Fikes and Nilsson's 1971 SRI paper defines a planning problem through an initial world description, available actions, and a goal condition. Each action description specifies applicability conditions and facts its modeled execution adds or removes. A goal can require several conditions together, such as placing both boxes at a destination. STRIPS separates searching for an action sequence from proving facts within a world description. The paper explicitly distinguishes applying an operator during planning from executing the corresponding robot action.

  22. Monitored Execution of Robot Plans Produced by STRIPS

    Fikes's PLANEX1 checks conditions needed for the remaining plan against the robot system's current world description. If the final conditions hold, it exits successfully; otherwise it selects a usable continuation or requests replanning. Newly observed progress can make planned steps unnecessary. Recovery can construct a short plan that restores conditions needed to resume the original plan. Monitoring and selective replanning were therefore already explicit concerns in this early symbolic planning system.

  23. A Robust Layered Control System for a Mobile Robot

    Brooks's subsumption architecture combines concurrently running behavior layers built from asynchronous finite-state modules. Suppression temporarily replaces a module's normal input with another signal; inhibition temporarily blocks an output, discarding messages emitted during that interval. Lower layers keep running while higher layers intervene in selected connections. This addresses responsiveness under changing conditions: basic behavior need not wait for higher layers to produce timely results. In the robot example, directed travel suppresses random wandering while obstacle avoidance remains active. Another connection inhibits wandering while observations are collected. These mechanisms coordinate behavior through signal paths rather than a central controller selecting every action.

  24. Peer Review — Rodney Brooks

    Brooks's first-person publication account distinguishes MIT AI Memo 864, dated September 1985, from the journal publication of A Robust Layered Control System for a Mobile Robot in March 1986, volume 2, number 1, pages 14–23. These are separate dissemination dates for the work, not competing dates for its invention.

  25. Reactive Reasoning and Planning

    Georgeff and Lansky's 1987 SRI paper describes the Procedural Reasoning System, which combines goal-directed planning with responses to changing circumstances. It selects applicable procedures using current beliefs and goals, maintains adopted procedures as intentions, and elaborates near-term steps while leaving later details open. New observations can activate another procedure or interrupt existing work. The authors report using PRS with the Flakey robot for navigation and malfunction-handling tasks. This demonstrated a hybrid approach: neither constructing every action before execution nor relying exclusively on immediate reactions.

  26. BDI Agents: From Theory to Practice

    Rao and Georgeff's 1995 paper connects belief–desire–intention theory with practical implementations. Beliefs represent information about the environment; desires represent objectives and priorities; intentions retain the selected course of action. Keeping intentions avoids reconsidering everything at every step, while commitment rules determine when to abandon them. Their OASIS air-traffic application retained an arrival sequence until it was completed or the next aircraft could no longer meet its assigned arrival time. The paper reports parallel evaluation at Sydney airport using live radar data and connects its practical interpreter to PRS and its successor dMARS.

  27. Validating the DS1 Remote Agent Experiment

    NASA Ames and JPL's Remote Agent operated Deep Space 1 during experiments on May 17–21, 1999. Operators supplied goals and operational constraints; onboard software generated plans, executed commands, monitored results and diagnosed failures. Its executive could try alternative methods, request recovery, or abandon an unrepairable plan and request another. A simulated camera-switch failure caused replanning during flight. A separate, real execution deadlock prompted ground investigation and termination of the first experiment; a newly designed six-hour experiment subsequently completed validation. The system demonstrated goal-directed autonomy while retaining ground control.

  28. WebGPT: Browser-assisted question-answering with human feedback

    OpenAI's 2021 WebGPT work, by Nakano, Hilton, Balaji and colleagues, trained GPT-3 to research long-form answers through a text browser. Each observation supplied the question and current browser state; the model selected commands such as search, follow a link, scroll or collect a reference. Browsing ended through a model command or an imposed action or reference-length limit, after which a separate answering phase used collected references. Human comparisons evaluated accuracy, coherence and usefulness. The best configuration combined demonstration-based training with reward-model selection and produced answers preferred to the study's human demonstrations in 56% of comparisons.

  29. ReAct: Synergizing Reasoning and Acting in Language Models

    ReAct interleaves model-generated reasoning and task actions so observations from an external environment can inform later decisions. Actions obtain information or change the environment; subsequent model steps can update plans and respond to exceptions. This differs from generating an entire action sequence without observing its effects. The paper evaluates this pattern in question answering, fact verification, and interactive decision tasks, providing a concrete origin for the observe-decide-act loop used in tool-using agents.

  30. ReAct: Synergizing Reasoning and Acting in Language Models

    ReAct was first submitted on October 6, 2022. Its March 10, 2023 revision is identified by the authors as the ICLR camera-ready version.

  31. Building Reliable Agentic Systems

    Finer subtasks make the action space easier to control, but excessive decomposition creates more decisions the model must get right.

  32. On the Planning Abilities of Large Language Models — A Critical Investigation

    Valmeekam, Marquez, Sreedharan and Kambhampati's NeurIPS 2023 study separates plausible action suggestions from executable, goal-achieving plans. Models received domain actions and task conditions; generated plans were checked using the VAL validator. The authors report that models used the supplied action vocabulary, yet frequently produced invalid sequences. In their blocks example, an action can fail because another block occupies its target. LLM proposals nevertheless helped an external planner's search, and verifier feedback improved subsequent generated plans in tested common-sense domains. Choosing available actions therefore did not establish that their ordering satisfied dependencies.

  33. LLMs Still Can't Plan; Can LRMs? A Preliminary Evaluation of OpenAI's o1 on PlanBench

    Valmeekam, Stechly and Kambhampati's September 2024 study reported substantially stronger planning results for o1-preview than earlier tested models. On 600 Blocksworld problems involving three to five blocks and solutions of two to sixteen steps, it solved 587 cases. On the semantically equivalent but renamed Mystery Blocksworld set, zero-shot success was 317 of 600. The study consequently distinguished improved planning capability from robustness across representations and larger problems.

  34. Real AI Agents Need Planning, Not Just Prompting

    The speaker characterizes ReAct (Reasoning and Action) as a local thought–action–observation loop without explicit look-ahead over the entire plan.

  35. Real AI Agents Need Planning, Not Just Prompting

    Dynamic planning allows an agent to reconsider and replace its plan during execution.

  36. Building Reliable Agentic Systems

    Evaluate subtask outcomes against the current environment and replan as feedback arrives, especially when other actors can change the environment.

  37. Model Predictive Control: Theory, Computation, and Design, second edition

    Model predictive control plans N steps by minimizing Σk=0…N−1 ℓ(xk,uk)+Vf(xN), subject to dynamics xk+1=f(xk,uk), initial state, and state/input constraints. Here ℓ is step cost and Vf is terminal cost. It executes only the first optimized input, obtains a new state measurement or estimate, and solves again over a shifted horizon. Thus execution uses feedback even though each nominal planning problem considers an open-loop sequence. This requires a predictive model, an actionable state estimate, explicit objectives and constraints, and a feasible optimization solved in time. Continuity and suitable compactness/coercivity conditions support existence of a minimizer; stability and continuing feasibility need additional design conditions.

  38. Plans and Resource-Bounded Practical Reasoning

    Bratman, Israel and Pollack's 1988 account treats adopted plans as commitments that focus subsequent decisions. Committing to attend a meeting, for example, directs reasoning toward getting there and filters incompatible alternatives. This reduces repeated deliberation when computation takes time and the environment can change during it. Plans should remain partial because future conditions are incompletely known, and revisable because new information can invalidate them. The proposed architecture combines means–end reasoning, opportunity detection, compatibility filtering and an override mechanism that permits reconsideration.

  39. An LLM Compiler for Parallel Function Calling

    Sehoon Kim and colleagues' LLMCompiler represents proposed tool work as a dependency graph. Independent calls can run together; dependent calls receive preceding results through placeholders. Intermediate observations can return to the planner to generate another graph. This addresses the cost of invoking a model between every independent operation. On approximately 1,500 HotpotQA comparison questions, its GPT-3.5-Turbo-1106 configuration reported 3.95-second latency versus 7.12 seconds for the adjusted ReAct baseline, with accuracies of 62.00% and 62.47%, respectively.

  40. How to Build Planning Agents Without Losing Control - Yogendra Miraje, FactSet

    Planning by sub-goal division, also called task decomposition, breaks a goal into simpler steps that a plan-and-execute architecture can operationalize.

  41. Ensure AI Agents Work: Evaluation Frameworks for Scaling Success

    Evaluate both selection of the appropriate skill and preservation of user constraints in its arguments.

  42. Agents are Robots Too: What Self-Driving Taught Me About Building Agents — Jesse Hu, Abundant

    The Terminus agent from Terminal Bench illustrates a more granular action space: a Tmux stream with character-level input and output.

  43. On Optimal Game-Tree Search Using Rational Meta-Reasoning

    A bounded agent chooses between acting now and performing a computation that might change its eventual action. The computation's value comes from improved external decisions, with delay reducing utility. A simplified one-step application is VOC(c)=E[U(action selected after c)]−U(current action)−cost(c), expressing cost and benefit in common utility units. Continue when a feasible computation has positive expected net value; otherwise act or stop. Information gathering can be assessed similarly, including its direct costs and effects. Estimation must account for possible results and whether they would change the decision. Partial computations can enable valuable later computations, so a purely one-step stopping rule can miss their combined value.

  44. SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering

    John Yang, Carlos Jimenez and colleagues' 2024 Princeton SWE-agent study treats available commands and returned observations as an agent-computer interface. It keeps model weights fixed while changing how the agent searches, views and edits repositories. An iterative search interface encouraged agents to inspect matches repeatedly through next/previous commands, sometimes exhausting their budget. On the 300-task SWE-bench Lite set with GPT-4, summarized search resolved 18% of tasks versus 12% for iterative search. The implementation combines compact actions and informative feedback with a ReAct loop, illustrating how interface choices shape a multi-step policy.

  45. Writing effective tools for AI agents

    Anthropic recommends distinct tool purposes, namespaced names, explicit parameter names such as user_id, and descriptions explaining terminology, expected inputs, and outputs. Response formats should expose relevant content and any identifiers required by subsequent calls; concise/detailed modes, filtering, and pagination control context consumption. Validation errors should explain actionable corrections. Task-oriented search can avoid loading entire collections, while workflow tools can combine frequently chained operations. Thus narrow purpose does not necessarily mean one low-level operation per tool. Internal evaluations and held-out tests informed these recommendations; the report describes improvements from tool-description changes and a response example shrinking from 206 to 72 tokens.

  46. Intelligence without representation

    Brooks challenges architectures that depend on separately developed perception, symbolic processing, and action modules fitting together through a central world representation. His alternative builds complete working systems incrementally from behavior layers that each connect sensing to action. Layers monitor circumstances and can abandon an unpromising activity or exploit an opportunity. The paper describes mobile robots operating in office environments and argues that direct environmental coupling reduces dependence on an accurate centralized model.

  47. IT Admin for the AI Workforce — Sarthak Aggarwal, Decawork

    Normalize authenticated intent into a typed, logged plan before exposing execution to untrusted evidence.

  48. Amazon Bedrock AgentCore — Authoring temporal policies

    AgentCore documents policies that consider earlier requests within a session. Its cumulative-budget example sums transfer amount inputs within five minutes, including the current request, and denies a request when the sum reaches 3000. With requests of 1000 amount units, the first two are permitted and the third is denied. This illustrates how an individually acceptable operation can become impermissible because of preceding operations. The example counts requested amounts rather than independently verified completed transfers.

  49. OWASP LLM10:2025 Unbounded Consumption

    Uncontrolled inference can consume shared capacity or money without crossing a content-policy boundary. Long inputs, repeated requests, and expensive operations can make request count a poor proxy for work. OWASP recommends input limits, per-user quotas, resource management, timeouts, throttling, graceful degradation, and bounds on queued and total actions. For an agent, the engineering implication is to account for the whole task, including generated tokens and downstream calls, and enforce limits before repeated work expands beyond its budget.

  50. The Protection of Information in Computer Systems

    Saltzer and Schroeder describe complete mediation, fail-safe defaults and least privilege: check authority for accesses, deny absent permission, and limit a component’s granted powers. These principles apply during recovery as well as ordinary execution. In an agent loop, tool proposals and retrieved instructions must therefore pass an independently enforced authorization boundary before they can affect protected resources. Model capability does not establish the caller’s authority.

  51. Using RL-based Agent to Detect and Remediate ETL Pipeline Failures

    Safety constraints should sit outside the learned policy, with escalation treated as a valid outcome.

  52. Not what you've signed up for: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection

    Indirect prompt injection places attacker-authored instructions in material an application retrieves at inference time, such as web pages or messages. When inserted into model context, that material can be interpreted as instructions and redirect subsequent answers or API use without the attacker controlling the user's request or model weights. The paper demonstrates attacks on integrated systems and develops a taxonomy including information theft and manipulated content. Engineering implication: retrieval and tool results remain untrusted data; the application must independently enforce resource access, tool permissions, transaction approval, and data-release restrictions. A model's interpretation of retrieved text cannot grant these privileges.

  53. OWASP Transaction Authorization Cheat Sheet

    Transaction authorization should let the user acknowledge significant transaction data, such as destination and amount, and bind approval to that transaction rather than an unrestricted session. The server controls authorization data and permitted state transitions. Changes to transaction data invalidate prior authorization or restart the process. Credentials should be unique per operation and valid only for a limited interval. A final server-side gate immediately tied to execution verifies that the transaction was properly authorized, preventing skipped checks and substitution between approval and use. For an agent, approving a draft action therefore must not silently authorize a changed target, payload, or scope.

  54. What Does Done Even Mean? Agents and Paperclip's Liveness Model - Dotta, Paperclip

    Define a clear chain of custody so each agent knows who receives the work after its step finishes.

  55. Building Your Own Secure AI Workflows: Human-in-the-Loop Automation with n8n

    Place approval in the execution path so the agent cannot bypass it by choosing to call the underlying tool directly.

  56. PagerDuty: Incidents

    PagerDuty separates triggering, acknowledging, and resolving an incident. Assignment and notification follow an escalation policy; acknowledgment records that a responder claims ownership and is working on the unresolved issue. Without acknowledgment, escalation continues. An acknowledgment timeout can return the incident to triggered status and resume escalation. Incident timelines record status changes, actions, and notifications. This supplies an operational example in which requesting attention, accepting responsibility, and resolving work are distinct events.

  57. When Machines Mislead: Human Review of Erroneous AI Cheating Signals

    Duolingo researchers inserted fabricated copy-typing alerts into reviews of previously certified test sessions, without affecting test-taker results. Two studies each sampled 170 sessions. Estimated rejection of fabricated alerts rose from 50% under the original guidelines to 71% after guidelines emphasized independent video evidence. Reviewers nevertheless accepted some fabricated alerts in both studies. Human review thus supplied an additional check but did not automatically correct erroneous automated signals.

  58. Build AI Systems for Discernment, Not Approval - Angel Ortmann Lee, Duolingo

    The human-AI interaction loop is cyclical: interfaces that encourage rubber-stamping can turn model-influenced approvals into misleading evaluation and training labels.

  59. Design by Contract Introduction

    A precondition states what the caller must establish before invoking a routine. Given that condition, the implementation owes the postcondition on successful completion; it may assume the caller fulfilled the precondition. A postcondition can relate resulting state to entry state, such as count=old(count)+1 and lookup(key)=insertedValue. A class invariant expresses consistency constraints across the class's operations, such as 0≤count≤capacity. An output schema can check declared structure and value restrictions, but ordinarily does not establish that the caller was entitled to invoke the operation, that persistent state changed correctly, or that cross-operation invariants hold.

  60. Demystifying evals for AI agents

    An agent evaluation separates a task and its success criteria from repeated trials, execution transcripts, graders, and final environment outcomes. A booking claim in a transcript is different from an actual reservation in the database. The system under test includes both model and agent harness. Code-based checks suit precise state or test assertions; model graders cover more open-ended properties but require calibration; human review helps establish the standard. Capability suites explore difficult behavior, while regression suites protect behavior that already works.

  61. What Does Done Even Mean? Agents and Paperclip's Liveness Model - Dotta, Paperclip

    Represent completion as a structured object containing distinct claims, rather than a Boolean status.

  62. From Agent Traces to Agent Simulations — Rustem Feyzkhanov, Snorkel AI

    Evaluate environment state, execution traces, and artifacts using checks suited to each evidence type.

  63. Agents need more than a chat

    Use explicitly identified verification proxies, such as comparison with trusted 'golden contracts,' when direct outcome verification is unavailable.

  64. How to Build Planning Agents Without Losing Control - Yogendra Miraje, FactSet

    Make replanning and termination explicit, and apply recursion limits alongside tool validation checks.

  65. LangGraph: Interrupts

    An interrupt pauses graph execution, exposes a payload requesting external input, and saves graph state through a checkpointer. Execution waits until resumed with input and the same thread identity. Documented uses include approval, review, correction, and input validation. Resuming restarts the interrupted node from its beginning, so code before the interrupt executes again. This provides a concrete distinction between waiting for a decision and finishing the underlying task.

  66. LangGraph: Graph API overview

    LangGraph's recursion limit bounds graph super-steps during an execution and raises GraphRecursionError when exceeded. Applications can instead inspect remaining steps and route to a fallback before exhausting the limit. The documentation demonstrates normal graph completion with a partial or best-effort result. Consequently, a graceful exit and an exception-free run can both occur without fulfilling the original task.

  67. Magentic-One: A Generalist Multi-Agent System for Solving Complex Tasks

    Magentic-One separates a task ledger containing facts, unresolved information, guesses, and a provisional plan from a progress ledger checking completion, repetition, and forward movement. Detected stalls increment a counter; exceeding its threshold triggers reconsideration of learned information and revision of the plan. Configurable attempt and time limits can terminate the process independently of task completion. After termination, the system may return its best guess rather than an established solution.

  68. Let's Build an Agent from Scratch — Kam Lasater

    The speaker identifies nonconverging tool loops and describes a client-enforced iteration limit as a guardrail, while explicitly noting that the demo lacks one.

  69. Temporal Activity Execution

    An Activity Execution can comprise multiple task attempts. Temporal relies on timeouts to detect lost work, including worker crashes after invocation, and retries according to policy; limiting attempts to one prevents retry but does not prove an external effect failed. Cancellation is cooperative: activities receive service cancellation through heartbeats, can ignore it, and workflows may proceed without waiting for acceptance. A timed-out attempt may therefore continue while another attempt runs. Application consequence: treat an unconfirmed external mutation as uncertain, retain its operation identifier, reconcile against the receiving system, and use enforced idempotency or explicit recovery before repeating it. Timeout or cancellation is not evidence that a payment, message, or write was reversed.

  70. Resolving an ambiguous payment request

    A timeout can leave the client unable to tell whether Stripe received or executed a request. Stripe documents retrying with the same key and parameters until a server result is obtained, using backoff. An HTTP 500 remains indeterminate: side effects may exist even though the cached response stays unchanged. Stripe may reconcile partial mutations and emit webhook events for resulting objects. Supplying a local operation identifier in metadata lets the application correlate these objects with its own pending operation. Engineering consequence: preserve pending state until authoritative provider evidence resolves it; do not infer failure solely from a timeout.

  71. Making retries safe with idempotent APIs — Amazon Builders' Library

    A caller-provided request identifier expresses that repeated requests represent the same logical operation. Identical parameters alone cannot establish this: a user may intentionally request two identical resources. The server must coordinate recording the identifier with performing the mutation atomically, return a semantically equivalent result for a retry, and reject reused identifiers paired with different intent or parameters. Retention of identifiers also needs a defined lifetime. These semantics let an agent runtime retry an uncertain tool response without silently turning one authorized operation into two.

  72. From RL to IRL — Gaurav Mishra, Amazon AGI Lab

    The talk's 'flight school, not just exams' approach trains recovery inside messy simulations instead of silently resetting failed runs.

  73. Compensating Transaction pattern

    Compensation performs new, business-specific actions to counter completed steps of an eventually consistent workflow. It differs from transaction rollback: intervening concurrent work must be preserved, the exact original state may be unattainable, and cancellation may incur charges. Record completed steps and the information needed to compensate them. Compensation order need not exactly reverse execution, and some steps can run in parallel. Compensation can itself fail, so persist progress, resume from failure, and make retryable steps idempotent. Where automated recovery is impossible, alert an operator with diagnostic information. For irreversible effects, an application must define an acceptable remedy or escalation rather than claim the action has been undone.

  74. Using RL-based Agent to Detect and Remediate ETL Pipeline Failures

    Use explicit rules for directly observable conditions and reserve learning for contextual action selection.

  75. τ-bench: A Benchmark for Tool-Agent-User Interaction in Real-World Domains

    τ-bench checks the final database against an annotated goal and, where required, checks information in user-facing responses. Its binary reward is r=raction×routput. Repeated trials distinguish a successful run from consistent completion: pass^k is the probability all k independent, identically distributed trials succeed, averaged across tasks; pass@k requires only one success. With c successes among n trials, the pass^k estimator is the task average of C(c,k)/C(n,k), for k≤n. The paper explicitly warns that reward 1 can miss trajectory violations, such as executing without confirmation. Final-state checks must therefore be supplemented when the process itself has requirements.

  76. No Vibes Allowed: Solving Hard Problems in Complex Codebases

    Prioritize correcting false information, filling relevant gaps, and removing noise rather than merely shortening the conversation.

  77. OpenTelemetry: Traces

    A distributed trace connects operations through spans carrying identity, timing, attributes and events. Parent-child relationships and links represent related work across boundaries. Applied to an agent, model requests, tool dispatch and downstream calls can be correlated so a failed run can be reconstructed from observations. A span’s error-free status describes that instrumented operation; it does not by itself establish that the requested business outcome was correct.

  78. Reasoning models don't always say what they think

    Anthropic's original research report describes inserting answer hints into evaluation questions and checking whether models acknowledged hints that influenced their answers. Tested models sometimes changed their answers toward a hint without identifying that influence in their generated reasoning. The report also describes synthetic reward-hacking experiments where exploiting a rewarded shortcut was often absent from the reasoning account. These interventions show why a persuasive explanation cannot be assumed to identify the causes of an agent's action.

  79. Quantifying infrastructure noise in agentic coding evals

    Anthropic varied resource allocation across Terminal-Bench configurations while holding the model, harness, and tasks constant. Resource enforcement changed infrastructure failures and task success. The report distinguishes additional headroom that reduces transient container failures from larger allocations that enable different solution strategies. In one example, installing a data-science dependency stack exhausted memory before solution code was written, whereas a leaner approach was possible. Thus an unsuccessful trajectory can reflect both an action strategy and the environment's constraints rather than a model-only defect.

  80. Engineering Better Evals: Scalable LLM Evaluation Pipelines That Work

    Aggregate traces by execution path and compare evaluation outcomes across paths instead of inspecting only individual runs.

  81. OWASP Logging Cheat Sheet

    OWASP advises against directly logging passwords, access tokens, session identifiers, connection strings, encryption keys, sensitive personal information, and payment data; remove or appropriately protect sensitive fields. Validate and sanitize event data crossing trust boundaries to prevent log injection. Restrict and periodically review read access, record access to logs, protect transfer and storage, and apply retention and disposal rules to debug logs, backups and extracts as well as primary logs. Applied to agents, collect the identifiers, timings, outcomes and selected diagnostic fields needed for investigation; do not assume entire prompts, retrieved documents or tool responses are safe to retain.

  82. AI Agents That Matter

    The authors compared complex code-generation agents with simple procedures that regenerate after failing supplied tests, including a procedure that gradually increases sampling temperature. They evaluated 164 HumanEval tasks and ran each system five times. The temperature-increasing baseline had no significant accuracy difference from the best-performing complex architecture while costing less than several tested agents. This provides a concrete reason to compare elaborate decision strategies with bounded, prescribed feedback procedures rather than attributing gains to planning or reflection alone.

  83. AgentDojo: A Dynamic Environment to Evaluate Attacks and Defenses for LLM Agents

    AgentDojo implements tools that read and modify explicit application state. User-task checks examine returned answers and state changes, while separate security checks determine whether an attacker achieved an unwanted objective. Its evaluation distinguishes ordinary task utility, task completion without adversarial side effects, and attacker success. This provides a concrete method for assessing both intended work and unwanted consequences instead of treating a satisfactory answer as sufficient evidence of acceptable execution.

  84. ReliabilityBench: Evaluating LLM Agent Reliability Under Production-Like Stress Conditions

    ReliabilityBench combines repeated executions, task-description perturbations, and injected tool failures. Its synthetic scheduling, travel, support, and shopping tools modify explicit state, which task-specific predicates assess afterward. A published travel fixture checks both confirmed reservation status and the expected passenger. Fault categories include timeouts, rate limits, partial responses, schema changes, and stale data. The method allows different action sequences when they satisfy the required final-state conditions.

  85. NIST AI RMF Playbook: Measure

    Construct validity asks whether an indicator measures the concept it claims to measure; external validity concerns generalization beyond development conditions. NIST calls for documented operating conditions, measurement assumptions, limitations and variance. Evaluations using human-subject data should reflect the population in the context of use. Applied to agent evaluation, define the deployment population and scenario dimensions before sampling, document exclusions, and compare sampled conditions with intended users, tasks and operating environments. A split within an unrepresentative dataset does not establish deployment coverage.

  86. Simulation-Maxxing: How Nubank ships agents 20× faster with simulations

    The described setup combines a real agent, mocked tools and steered user scenarios, then scores the resulting multi-turn traces.

  87. Simulation-Maxxing: How Nubank ships agents 20× faster with simulations

    Synthetic personas need consistent account and identity data as well as interaction style.

  88. Build Evals That Actually Matter - Nick Ung & Akshay Sharma, Lyft

    Simulate complete interactions with explicit user intent, world state, and personas, then combine judgment-based grading with deterministic checks of expected actions.

  89. Build Evals That Actually Matter - Nick Ung & Akshay Sharma, Lyft

    Helpful-assistant behavior in a user simulator can make conversations unrealistically easy; production examples and realistic user behavior are needed to expose harder failures.

  90. Building Multi-agent Systems with Finite State Machines

    Place an explicit approval state between the model's proposed tool call and the application's next action.

  91. How to Build Planning Agents Without Losing Control - Yogendra Miraje, FactSet

    The speaker distinguishes a workflow agent executing a predefined path from an agentic workflow whose path the agent plans and executes.

  92. Coding Agents Are Guessing: Measuring Action-Boundary Violations in Underspecified DevOps Instructions

    UnderSpecBench varies instruction clarity, target identification, and consequence cues while keeping task environments, tools, and oracles fixed. Each run begins from reset state in an isolated container. Handwritten oracles compare environmental changes and action records against intended objects and objects that must remain untouched, distinguishing safe completion from wrong-target and excessive-scope effects. The setup combines real commands with emulated services and disables per-action confirmation. This supplies a concrete design for testing whether ambiguous requests lead to unauthorized scope expansion.

  93. Agents are Robots Too: What Self-Driving Taught Me About Building Agents — Jesse Hu, Abundant

    Strong prediction and reasoning do not establish that an agent can execute successfully, make progress, or recover from errors.

  94. Agents vs Workflows: Why Not Both?

    Workflows make prerequisite relationships explicit when later operations must wait for earlier ones.

  95. Building Reliable Agentic Systems

    Passing intermediate reasoning between steps can improve consistency, but can also amplify an early mistake.