Learn the controls and knobs

The main controls are chunk size and overlap; embedding model; vector and keyword weights; metadata filters; candidate top-k; reranker depth; context token budget; citation format; abstention rule; and index refresh cadence. Each should be treated as a hypothesis: “changing X will move metric Y under workload Z.” Change one family of controls at a time, record the version, and compare against a baseline.

Start with controls that bound harm—permissions, limits, split integrity, or validation—before controls that polish average quality. Use a small sweep instead of one lucky setting. A setting that wins on one example can lose on a different length, language, class, tenant, or traffic pattern. Keep defaults explicit in configuration so a provider or library update cannot silently redefine the experiment.

A useful control sheet has five columns: control, current value, predicted benefit, predicted cost, and rollback trigger. Fill it using the tradeoff below rather than intuition alone: Small chunks retrieve precisely but lose surrounding context; large chunks preserve context but dilute matches. Higher top-k improves recall while adding distractors and tokens. Reranking improves ordering at extra latency. Fresh indexing costs compute but stale evidence damages trust.

For “Can I carry over vacation?”, hybrid search retrieves policy chunks. A reranker promotes the region-specific 2026 policy over a popular 2024 FAQ. The answer quotes the two-day limit and cites the exact chunk; without supporting evidence it abstains.

The worked number is if 18 of 20 test questions retrieve at least one relevant chunk in top 5, recall@5 = 18/20 = 0.90. 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: Small chunks retrieve precisely but lose surrounding context; large chunks preserve context but dilute matches. Higher top-k improves recall while adding distractors and tokens. Reranking improves ordering at extra latency. Fresh indexing costs compute but stale evidence damages trust. 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.

Select three plausible values for one control while freezing the others. Run the same representative cases at every value and record task quality, p95 latency, unit cost, and failure count. Do not pick the winner from the average alone: inspect the worst case and important slices. Next, repeat one run to estimate natural variation. If the difference between two settings is smaller than run-to-run variation, the evidence does not support declaring a winner. Save the configuration beside the results so the experiment is reproducible after a model or library upgrade.