Nash Equilibrium Text: A Game-Theoretic Decoding Framework for Text Generation
Text revision has become an integral component of large language models. This paper formulates revision such that it admits a Nash equilibrium: Token positions are players, vocabulary items are actions, and each player's utility is the language model's log conditional probability. We motivate the revision by showing that Nash equilibria can have exponentially higher likelihood than autoregressive…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.