Greedy Decoding Is Not Precision-Invariant: Cross-Precision Output Divergence in LLM Inference
Greedy decoding from large language models is commonly treated as deterministic. We show it is not precision-invariant: the same model, prompt, and decoding algorithm produce different outputs in BF16 versus FP16 on identical hardware. Across our evaluations of six models (1.1B-7B parameters, four families; divergence additionally characterised at 12B) and three benchmarks, 49-100\% of prompts…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
