A simulator's plausible responses need a validated state-transition boundary
Compare tool contracts and paired outcomes, expose omitted failure modes, and distinguish simulator success from evidence of transfer to a target system.
On this page
The question for today
What you’ll understand
- Specify fidelity in terms of transitions, observations, timing, and constraints.
- Calculate paired simulator-target disagreement and success-rate gaps.
- Design boundary checks without treating a finite simulator score as a transfer guarantee.
A tool simulator can return convincing JSON while omitting the behavior that makes the real task difficult. It may update state immediately, never lose an acknowledgment, or accept impossible argument combinations. An agent optimized for that world can succeed through assumptions that fail at deployment. Define what the simulator preserves and validate that boundary against a controlled target. Its score remains evidence about that model of the environment, even when selected comparisons show useful agreement with a real implementation.
Fidelity concerns effects and observations, not only response style
Inventory schemas, validation rules, state changes, permissions, idempotency, asynchronous completion, retries, rate limits, and errors. A generated response that says an order shipped should not count as a state transition unless the simulator updates the corresponding authoritative record under its contract. User simulation is another boundary: a language model playing a customer can disclose information, misunderstand instructions, or cooperate differently from actual users. The original tau-bench combines simulated user interactions, domain tools, and policies; these components should be versioned and evaluated separately rather than treated as interchangeable sources of realism.
Specify which conditions are intentionally omitted. A deterministic simulator can be useful for regression while lacking latency variation or concurrent writers. WebArena's functional sites and OSWorld's computer environments increase fidelity for particular interfaces, yet their task and application versions still bound the evidence. Higher visual detail is not necessarily higher fidelity for database commitment or authorization semantics. Choose the boundary according to the capability claim, and avoid calling a benchmark realistic as a substitute for listing which real behaviors it reproduces.
Validate boundary cases where the environments can diverge
Build controlled conformance cases for invalid arguments, stale reads, committed effects with lost responses, duplicate retries, permission changes, partial failures, and cancellation. Compare both visible outputs and authoritative effects. Run these checks in isolated target fixtures, since replaying arbitrary evaluation actions against production can create new effects rather than merely observe fidelity. Pair task conditions and preserve the initial state for each comparison. If the real service has nondeterministic timing, repeated target trials may be needed to characterize the distribution instead of matching one convenient response exactly.
Outcome agreement alone can conceal divergent intermediate states that later actions expose. Conversely, harmless response formatting differences need not invalidate a task whose parser and action contract permit them. Classify mismatches by mechanism and measure whether the agent relies on the omitted behavior. A simulator patch can change task difficulty or the user policy's behavior, so a new version requires renewed comparisons. Do not calibrate only on successful demonstrations and then claim fidelity for error recovery, because that excludes precisely the transitions where many agents fail.
Report the scope of transfer and preserve mismatches as tests
Keep the simulator revision, target revision, paired task list, conformance cases, tool-response samples, and state evidence with the report. Separate simulated evaluation from target validation rather than pooling both denominators into one attractive success number. Report uncertainty and task-family coverage. When the simulator improves after a discovered mismatch, add a regression case but retain a separate untouched transfer check. A finite set of matching executions supports a scoped empirical claim, not universal agent capability, complete policy compliance, or immunity to future interface changes.
The Markov lab isolates sensitivity to a transition model. Reset, explicitly set BOTH p=0.1 and q=0.2, predict state-one probability about 0.2533 after four transitions, then Play or Step four times to t=2. Reset and re-set BOTH p=0.3 and q=0.2; predict 0.5625. Both runs start in state zero; n=min(2000000,floor(2 t)), and edits retain t. This exact two-state discrete chain has no tools, simulator validation, or task policy. Its changed occupancy shows that altered transition assumptions can matter even when state labels and output format stay the same.
Work it through
A plausible simulator can overstate target success
Twenty paired sandbox cases yield ten successes in both environments, six simulator-only successes, two target-only successes, and two failures in both. Use identical outcome definitions and comparable task starts for this accounting.
Simulator success is (10+6)/20=0.8; target success is (10+2)/20=0.6. The empirical target-minus-simulator gap is−0.2, or minus twenty percentage points.
Eight pairs disagree, so observed disagreement is (6+2)/20=0.4. A twenty-point rate gap and forty-percent paired disagreement measure different aspects of the comparison.
Inspect the six simulator-only cases for optimistic assumptions and the two target-only cases for overly restrictive simulation or other mismatches. These twenty pairs do not establish a universal correction factor or fidelity on untested tool failures.
Paired stateful validation exposes both directions of mismatch without equating simulator fluency or success with transfer.
The living notebook
Explore the model
Interactive lab · markov
Changing transition assumptions changes the modeled occupancy
For EACH run Reset, set BOTH p and q, predict, then Play or Step four times to t=2/n=4. From state 0, (0.1,0.2) gives P(state 1)≈0.2533 and(0.3,0.2) gives 0.5625. Edits retain t; n is capped at 2000000. This exact discrete two-state chain is not an agent, tool simulator, CTMC, or fidelity validator.
- P(state 1) at step 0
- 0%
- Stationary P(state 1)
- 60%
- Chain behavior
- Monotone convergence
Exact finite-step probabilities for a two-state chain starting in state 0, not sampled trajectories. Playback advances two transitions per second. When p = q = 0 every distribution is stationary; when p = q = 1 the chain alternates forever. A single zero transition creates an absorbing state. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA simulator's transition contract needs evidence; matching response appearance does not establish matching behavior.
Pause & reason
Check your understanding
Your turn
Try it yourself
Thirty paired cases have eighteen both-success, three simulator-only, six target-only, and three both-failure outcomes. Calculate each success rate, target-minus-simulator gap, and disagreement. Can the gap be used as a guaranteed correction on another domain?
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Use the same thirty-case denominator and keep directional and total mismatch separate.
Compare with the solution
Simulator rate is 21/30=0.7, target rate 24/30=0.8, gap 0.1, and disagreement 9/30=0.3. The gap is an empirical property of these pairs; another domain, task mix, version, or policy can change both its magnitude and sign, so it is not a guaranteed correction.
Keep the idea
Take it with you
- Simulator fidelity includes state effects, observations, timing, and constraints.
- Paired success gaps and disagreement reveal different mismatch patterns.
- Simulator evidence and finite target validation support scoped claims rather than universal transfer.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.