NYU defines an interestingness metric for theorems and trains a 27B model to discover new math
nyuniversity · hf · 2026-09-26
NYU researchers propose quantifying a theorem's intrinsic interestingness as the ratio of proof length to statement length, showing it strongly correlates with downstream utility.
- They identify proof difficulty conditioned on premises as a key primitive and train a 27B model that predicts it more accurately than frontier general-purpose models
- Optimizing for this metric cut substantial/full overlap with Mathlib from 91.9% to 30.6%, yielding more out-of-distribution math
- The system generates candidate theorems, selects the most interesting, and iteratively grows a self-expanding, machine-verified library
- These metrics offer a practical signal for ranking conjectures and guiding proof search without human-supplied targets
Related event: NYU Defines "Interestingness" Metric for LLMs to Discover Math(3 posts)→
More from Research
- Quote arguing autoregressive error critique conflates prefix with full compute state — teortaxesTex · 2026-09-26
- New Paper Links Orch OR Theory With Microtubule Resonance — anirbanbandyo · 2026-09-26
- Claude computes nine-loop scattering amplitude, verified by SLAC's Lance Dixon for ~$1–2K — EricBuess · 2026-09-26
- 4B decision model Mica beats same-size rival at Tetris without generating a single token — Top-Evidence174 · 2026-09-26
- Physicists scooped by Anthropic AI: 'more low-hanging fruit than experts expect' — soumitrashukla9 · 2026-09-26
- 4B model mines an iron pickaxe in Minecraft in 23 decisions, generating zero tokens — Top-Evidence174 · 2026-09-26