Token-level entropy is a pretty clean proxy for detecting fork vs lock positions at inference time. Low entropy = lock (decode greedily), high entropy = fork (sample with more temperature). Speculative decoding already exploits something similar where the small draft model handles the predictable tokens and the big model kicks in at the uncertain ones. Combining that with this paper's fork/lock framing could get you adaptive temperature basically for free during inference.