Abstract:Machine-assisted mathematical discovery has been a long-standing challenge in machine learning and artificial intelligence. In recent years, we have seen tremendous progress with generative AI, yet its contribution to automated discovery in advanced mathematical research has been limited. One of the most difficult benchmarks in this context is the Birch test, which asks whether a machine can discover truly novel and non-trivial mathematical structures without human intervention. In this work, we particularly focus on the branch of automated conjecture discovery. We use HypothesiX, an automated conjecture mining agent and analyse its generated conjectures related to the distribution of twin primes to verify the conditions of the Birch test. Furthermore, note that automated discovery is now operating at scale, but verifying its non-triviality still depends on human evaluation. We propose a benchmark to quantify the non-triviality of machine-generated conjectures using the Mahalanobis distance within an embedding cluster of selected known mathematical conjectures. We also note that this quantified benchmark can be used as an error indication signal to localise the incorrectness of a new mathematical statement, which autoformalisers fail to verify due to their limitations in proof discovery capability.
From: Madhuparna Das Ms [view email]
[v1]
Thu, 11 Jun 2026 21:23:56 UTC (283 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。