Trace a worked example

Scenario: A classifier trains for five epochs on 80,000 labeled tickets and freezes a checkpoint. Every new ticket then runs a forward pass in milliseconds. Adding today’s policy to a prompt helps that request but does not alter the checkpoint.

Write the trace as numbered state transitions, not a polished story:

1. Capture the input, version, identity, and assumptions.
2. Apply the mechanism: During training, examples pass forward through the network, a loss compares predictions with targets, gradients flow backward, and an optimizer updates weights. During inference, only the forward computation is needed, often with autoregressive token generation and a KV cache. Fine-tuning is additional training; RAG and prompting are inference-time techniques.
3. Record the relevant controls: training data and split; learning rate; batch size; epochs; optimizer; regularization; checkpoint choice; inference batch size; precision; context length; decoding strategy; and serving hardware.
4. Calculate or inspect the intermediate signal: one epoch over 80,000 examples with batch size 100 requires 800 optimizer steps; five epochs require 4,000 steps.
5. Compare the result with a baseline and an acceptance threshold.
6. Store enough evidence to reproduce the decision without storing unnecessary sensitive content.

Now perturb the trace. Change one input to a long, stale, ambiguous, or unauthorized case. A robust design should either continue within its contract or abstain visibly. Silent degradation is worse than a clear refusal because downstream systems may interpret fluent output as verified output.

A classifier trains for five epochs on 80,000 labeled tickets and freezes a checkpoint. Every new ticket then runs a forward pass in milliseconds. Adding today’s policy to a prompt helps that request but does not alter the checkpoint.

The worked number is one epoch over 80,000 examples with batch size 100 requires 800 optimizer steps; five epochs require 4,000 steps. State the unit and denominator whenever you report it. A percentage without a denominator can conceal a tiny sample; a latency without a percentile can conceal slow users; a similarity score without a labeled task can conceal irrelevant neighbors. Compare the observed value with a threshold chosen before seeing the final test result.

Now test the tempting shortcut. Suppose the team optimizes only the most visible metric. The result may look better while the system becomes less trustworthy. The reason is concrete: Training is expensive but amortized across many uses and can change persistent behavior. Inference is repeated per request and dominates operating cost at scale. Fine-tuning can improve stable task behavior but is slower to update than retrieval; retrieval gives fresh facts without changing weights. This is why the decision record must include both the intended gain and the tolerated regression. If the tolerated regression is unknown, the change is not ready for a consequential workflow.

• Prefer a measured baseline over a persuasive demo.
• Keep versions, inputs, and thresholds reproducible.
• Separate syntactic success from semantic correctness and authorization.
• Escalate or abstain when evidence falls outside the contract.
• Re-evaluate when data, traffic, models, providers, or user goals change.

These rules turn the topic into an engineering decision rather than a slogan. They also make disagreement productive: another person can challenge the assumptions, rerun the evaluation, and reach a documented conclusion.

The trace used one set of assumptions. Change one quantity by a realistic amount while holding the others fixed, then recompute the result. Next change a categorical assumption: model version, tenant, language, traffic shape, data freshness, or permission level. Mark which steps remain valid and which must be repeated. This is a stronger test than narrating the happy path because it reveals hidden coupling. Preserve the original and perturbed traces side by side, including intermediate values, so a reviewer can locate the first point at which their behavior diverges.