Weigh the tradeoffs

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.

Tradeoffs become manageable when expressed on a shared scorecard. Record task quality, p95 latency, unit cost, operational burden, and risk exposure. Do not collapse them immediately into one number; a weighted score can hide an unacceptable safety or privacy threshold. First mark non-negotiable constraints, then optimize among the surviving options.

Consider the mechanism when judging a trade. Documents are parsed, normalized, split into addressable chunks, enriched with metadata, embedded, and indexed. At query time, the system may rewrite the question, apply access filters, run vector or hybrid search, rerank candidates, fit the best evidence into a context budget, and generate an answer whose claims point back to sources. That explains why a control can improve one stage while degrading the whole pipeline. Test at the system boundary seen by the user, not only inside the component. A locally faster retriever, sampler, or model does not help if queueing, retries, validation, or human review dominates end-to-end time.

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.

Write two candidate designs and place each on a small Pareto chart with quality on one axis and cost or latency on the other. A design is dominated when another is at least as good on every measured dimension and better on one. Eliminate dominated choices, then apply hard constraints such as privacy, authorization, or an SLO. For the remaining choice, define a rollback trigger before launch. Reversibility matters because estimates can be wrong: a feature flag, versioned index, pinned model, or shadow run can turn an uncertain tradeoff into a controlled experiment.