arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.01412cs.AIcs.DMcs.LG
收藏

距离度量包围学习与Andrews-Curtis猜想

Distance Metric Ensemble Learning and the Andrews-Curtis Conjecture

Poznan University of Technology(波兹南理工大学);University of York(约克大学)

Krzysztof Krawiec, Jerry Swan

摘要:

为了在三维和四维空间中寻找庞加莱猜想的反例,1965年提出了安德鲁斯-柯蒂斯猜想。现在人们普遍怀疑安德鲁斯-柯蒂斯猜想是错误的,但小的潜在反例并不多,以前的工作试图通过组合搜索消除一些。然而,进展有限,最成功的方法(使用辅存的广度优先搜索)既不能扩展,也不能提供详细信息。以前的实证分析的问题结构研究了几个启发式的搜索进度的措施,并确定他们没有提供任何有用的指导搜索。在这篇文章中,我们直接从问题结构中归纳出新的质量度量,并通过集成机器学习将它们结合起来,产生一个更有效的搜索驱动程序。通过这种方法,我们消除了19个潜在的反例,其状态已经未知了一些年。

英文摘要:

Motivated by the search for a counterexample to the Poincaré conjecture in three and four dimensions, the Andrews-Curtis conjecture was proposed in 1965. It is now generally suspected that the Andrews-Curtis conjecture is false, but small potential counterexamples are not so numerous, and previous work has attempted to eliminate some via combinatorial search. Progress has however been limited, with the most successful approach (breadth-first-search using secondary storage) being neither scalable nor heuristically-informed. A previous empirical analysis of problem structure examined several heuristic measures of search progress and determined that none of them provided any useful guidance for search. In this article, we induce new quality measures directly from the problem structure and combine them to produce a more effective search driver via ensemble machine learning. By this means, we eliminate 19 potential counterexamples, the status of which had been unknown for some years.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑