Hutter et al. Argue Generalization Requires Universal Induction in New arXiv Paper

examachine · x · 2026-10-03

A new arXiv paper by Aram Ebtekar, Marcus Hutter, and Danica J. Sutherland argues classical statistical theory can't explain general-purpose AI: No Free Lunch theorems imply any learner beating chance somewhere must lose elsewhere, and this applies to meta-learning too, so meaningful prediction always starts with an inductive bias external to the data.

Biasing toward short programs yields Solomonoff induction (SI), which the authors relativize to an information vantage point—favoring accessibility relative to preexisting information rather than absolute simplicity. Any algorithm outpredicting relativized SI must embed extra information about the data, which none can generate. SI is incomputable, but it formalizes the inference optimum at infinite compute, with evidence suggesting frontier AI systems roughly approximate it.

Original post →

More from AGI Musings

AGI Musings channel →