Primary evidence
- Mathematical Reasoning via Self-supervised Skip-tree TrainingS1 · Primary research · Paper · 2020-06-08
- Mathematical Reasoning via Self-supervised Skip-tree Training — ICLR 2021S1 · Primary research · Paper
Rather than masking only a flat token span, skip-tree training removes a subtree from a structured mathematical expression and trains a model to reconstruct it, encouraging representations that reflect the compositional structure of formal mathematics.
The authors introduced the skip-tree pretraining task for formal mathematical expressions and reported that skip-tree-trained models outperformed standard skip-sequence training on tasks including type inference, missing-assumption prediction and equality completion, while also producing conjectures evaluated for provability and usefulness.
The work helped establish self-supervised pretraining on formal mathematical corpora as a distinct route to reusable reasoning representations before later large-scale formal-math language models and proof-oriented pretraining pipelines.
Significance rationale: Skip-tree training was an early structure-aware self-supervised objective for formal mathematics, showing that language-model pretraining over mathematical expression trees could support several downstream reasoning tasks and useful conjecture generation.
—
—
The Chronicle records the method and reported results from the arXiv research record, later accepted at ICLR 2021; no directly inspectable public implementation artifact is recorded here.
No corrections recorded.