Pith. sign in

REVIEW 2 cited by

Transcendence: Generative Models Can Outperform The Experts That Train Them

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.11741 v4 pith:FOQ6QU4P submitted 2024-06-17 cs.LG cs.AI

classification cs.LGcs.AI
keywords transcendencetraineddatagenerativemodelexpertshumansmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Generative models are trained with the simple objective of imitating the conditional probability distribution induced by the data they are trained on. Therefore, when trained on data generated by humans, we may not expect the artificial model to outperform the humans on their original objectives. In this work, we study the phenomenon of transcendence: when a generative model achieves capabilities that surpass the abilities of the experts generating its data. We demonstrate transcendence by training an autoregressive transformer to play chess from game transcripts, and show that the trained model can sometimes achieve better performance than all players in the dataset. We theoretically prove that transcendence can be enabled by low-temperature sampling, and rigorously assess this claim experimentally. Finally, we discuss other sources of transcendence, laying the groundwork for future investigation of this phenomenon in a broader setting.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Relating Misfit to Gain in Weak-to-Strong Generalization Beyond the Squared Loss

    cs.LG 2025-01 conditional novelty 6.0 of 10

    For convex and approximately convex model classes, the loss gain in weak-to-strong learning is at least the KL misfit between strong and weak models, plus an error term that vanishes as k grows.

  2. Self-Improving Transformers Overcome Easy-to-Hard and Length Generalization Challenges

    cs.LG 2025-02 conditional novelty 5.0 of 10

    Iterative self-training on a model's own correct outputs, with simple length and voting filters, lets transformers generalize to far longer arithmetic and path-finding problems than they saw in training.

Pith tools