PatternBoost:借助AI开展数学构造研究
PatternBoost: Constructions in Mathematics with a Little Help from AI
AI总结:
本研究提出PatternBoost方法,通过经典搜索局部构造与Transformer全局学习迭代交替的方式,在极值组合学问题中取得突破,找到多个长期难题的已知最优解,还构造出推翻30年未决猜想的反例。
摘要:
我们提出PatternBoost——一种用于发现数学中有价值构造的灵活方法。该算法在两个阶段间交替迭代:第一阶段为“局部”阶段,采用经典搜索算法生成大量符合要求的构造;第二阶段为“全局”阶段,基于上述构造中的最优结果训练Transformer神经网络。随后将训练好的Transformer生成的样本作为第一阶段的种子,重复上述流程。我们对该技术进行了详细介绍,并讨论了其在极值组合学多个问题上的应用结果。PatternBoost的性能因问题而异,但在诸多场景中表现十分突出。借助该技术,我们找到了多个长期存在的问题的已知最优解,包括构造出一个反例,推翻了一个悬而未决30年的猜想。
英文摘要:
We introduce PatternBoost, a flexible method for finding interesting constructions in mathematics. Our algorithm alternates between two phases. In the first ``local'' phase, a classical search algorithm is used to produce many desirable constructions. In the second ``global'' phase, a transformer neural network is trained on the best such constructions. Samples from the trained transformer are then used as seeds for the first phase, and the process is repeated. We give a detailed introduction to this technique, and discuss the results of its application to several problems in extremal combinatorics. The performance of PatternBoost varies across different problems, but there are many situations where its performance is quite impressive. Using our technique, we find the best known solutions to several long-standing problems, including the construction of a counterexample to a conjecture that had remained open for 30 years.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。