Domingos: Log-Perplexity Fell to 0.75 Bits While Cost Rose Orders of Magnitude

pmddomingos · x · 2026-11-23

Pedro Domingos uses OpenAI's newly published perplexity data to argue diminishing returns: log-perplexity dropped from 10 bits (bag of words) to 5 bits (best pre-GPT model), 1 bit (GPT-3.5), and 0.75 bits (GPT-6.2 Astra) — all while costs rose by orders of magnitude. A prominent skeptic's take on the transparency chart.

Related event: OpenAI Chart Leaks GPT-6 Astra as Researcher Questions Scaling Returns(2 posts)→

Original post →

More from Models

Models channel →