Same Query, Different Answer: Run-to-Run Variance in Semantic Query Processing
Set temperature to zero and the same request still comes back different, because inference servers batch concurrent requests and the batch yours lands in changes the floating-point arithmetic behind the logits. Replaying three benchmarks of database queries whose predicates are evaluated by a model — five runs each, 1.2 million calls, every input checksummed identical — between 0.07% and 10.2% of rows changed the verdict their operator gave, 24.0% on a 24-way classification, and the rate climbs with every extra run rather than settling. What compounds it is the query plan: 4.0% of extracted values changing moved the result table of 83 of 123 queries, because a query reading one field from every document needs only one field to move, and the paper gives the law — an answer that exposes n rows reproduces about e^(−n·δ̄) of the time, so one expected disagreement already cuts reproduction to a third. Voting three times doubles your calls, removes 36% of the disagreement and makes none of the aggregate or ranking answers reproducible; recording the per-row outputs an answer came from, at roughly 39 bytes each, is the fix that works.