← All speakers
On this page

Lance Martin is a member of technical staff at Anthropic working on the Claude Platform, including Claude Managed Agents and the claude-api skill in Claude Code. Previously an early LangChain engineer, he builds systems that let increasingly capable AI agents work independently while remaining observable, secure, and responsive to feedback.

From self-driving vehicles to AI agents

Martin earned a PhD at Stanford and worked on computer vision and perception for autonomous vehicles at Uber ATG, Ike, and Nuro. At LangChain, he contributed to LangGraph, developer education, retrieval-augmented generation, and evaluation; created the first LangChain Academy agent-building course and RAG From Scratch; and built auto-evaluator, an evaluation tool for language-model question-answering systems.

His 2024 work on controllable agents positioned graph-based workflows between rigid, developer-defined chains and unpredictable open-ended agents. Explicit state and constrained branching let models choose among approved paths while supporting corrective retrieval, hallucination checks, and code-validation loops. By 2026, at Anthropic, he had extended those concerns to infrastructure for agents running asynchronously over much longer periods.

How Martin designs dependable autonomy

  • Separate orchestration from execution. In long-horizon Claude systems, the agent harness coordinates isolated execution environments through a durable, append-only session. Failed workers can restart without erasing progress, credentials remain outside sandboxes, and models can revisit earlier context instead of relying solely on compressed summaries.
  • Evaluate the route and independently verify results. His approach to agent trajectory evaluation examines wasted tool calls, inappropriate repetition, and other failures hidden by a correct final answer. For extended assignments, a separate verifier evaluates completed work against explicit outcomes, preventing the working agent’s accumulated assumptions from shaping its own grade. He demonstrated verifier-driven iteration using Parameter Golf, a benchmark created by OpenAI.
  • Repair memory instead of merely accumulating it. His claude-diary project implements a simple memory system for Claude Code. His experiments distinguish notes recorded during execution from offline memory consolidation through dreaming, which reviews previous sessions, identifies misleading memories, and improves future decisions. He favors flexible filesystems or databases that models can organize themselves over rigid, developer-prescribed memory schemas.
  • Engineer context around actual model behavior. His writing on agent design emphasizes compact toolsets, progressive disclosure, persistent filesystems, and recoverable external context. For retrieval, he separates small chunks used to locate relevant information from larger documents supplied for answer generation; long context windows alone cannot guarantee reliable recall. His analysis of Manus further examines these context engineering tradeoffs.

Martin’s essay on the bitter lesson describes the architectural shift accompanying stronger models: fewer brittle, hand-coded assumptions; more general-purpose tools, persistent state, secure boundaries, and measurable feedback. His outline of emerging agent patterns extends that thinking to organization-level agent harnesses: shared systems with independent identities, organizational context, multiple users, and the ability to surface useful information proactively.

Read the topics behind these talks

2 conference talks

Key ideas

Scroll to read ↓

Build adaptive RAG workflows by constraining where models make decisions, then evaluate both the answers they produce and the paths they take.

  • Who decides the next step?
    1:29 ↗
  • Make flexibility an explicit part of the graph
    5:16 ↗
  • Check retrieval before trusting it
    8:51 ↗
  • Use executable feedback to repair code
    11:37 ↗
  • Evaluate the answer and the route separately
    15:29 ↗
  • Build the system that measures improvement
    22:30 ↗
  • Choose checks that fit the task
    26:21 ↗
  • Keep runtime checks cheap and bounded
    32:33 ↗
  • Inspect what each step costs and remembers
    37:50 ↗
  • Prefer crisp feedback before adding another agent
    45:17 ↗
  • Record the path as application data
    51:47 ↗
  • Give routing its own decision point
    56:02 ↗
  • Follow a document-grading state update
    1:02:46 ↗
  • Reduce the model's burden, then expand its evidence
    1:06:22 ↗
  • Distinguish available evidence from evidence the model uses
    1:12:27 ↗
  • What belongs in the model, the graph, or an API?
    1:20:12 ↗
  • A large window does not guarantee multi-fact retrieval
    1:28:14 ↗
  • Reduce the tool-selection problem before scaling it
    1:32:49 ↗
  • Grow the evaluation set from real failures
    1:41:58 ↗
  • Apply the same boundaries to SQL and reports
    1:46:27 ↗
  • Separate clarification, model capability, and persistence
    1:53:10 ↗
  • Distinguish execution errors from wrong decisions
    2:01:11 ↗
  • Relevance also depends on document authority and scope
    2:06:48 ↗
  • Test the branch—and recognize the missing interaction
    2:16:44 ↗

Key ideas

Scroll to read ↓

Long-running agents need more than capable models: durable sessions, independent verification, repairable memory, and harnesses that can serve an entire organization.

  • When the model outgrows the window
    0:36 ↗
  • From messages to managed deployment
    2:06 ↗
  • Separate the brain from the hands
    3:17 ↗
  • Compaction without erasing history
    5:20 ↗
  • Give verification its own context
    6:20 ↗
  • Research iterations in Parameter Golf
    8:18 ↗
  • From tactical notes to reusable memory
    10:15 ↗
  • When memory preserves the wrong lesson
    13:19 ↗
  • A harness for the whole organization
    16:05 ↗
  • Proactive and multiplayer interaction
    18:16 ↗
  • Why long horizons require more than a model
    19:31 ↗
  • Choose a flexible substrate, not prescribed memory types
    21:44 ↗
  • Does the corrected memory actually help?
    24:16 ↗

References