使用机器学习决定何时用Groebner基预处理柱形代数分解
Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition With Groebner Bases
摘要:
柱形代数分解(CAD)是计算代数几何中的一个重要工具,特别是实闭域上的量词消去。然而,它可能是昂贵的,最坏情况下的复杂度是输入大小的两倍指数。因此,重要的是以CAD算法的最佳方式制定问题。一种可能性是使用Groebner基(GB)理论对输入多项式进行预处理。以前的实验表明,虽然这通常对CAD算法非常有益,但对于某些问题,它可能会显着恶化CAD性能。在本文中,我们调查是否机器学习,特别是一个支持向量机(SVM),可用于识别这些CAD问题,受益于GB预处理。我们对超过1000个问题(比以前的研究大很多倍)进行了实验,发现机器学习的选择比人类的启发式更好。
英文摘要:
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the size of the input. Hence it is important to formulate the problem in the best manner for the CAD algorithm. One possibility is to precondition the input polynomials using Groebner Basis (GB) theory. Previous experiments have shown that while this can often be very beneficial to the CAD algorithm, for some problems it can significantly worsen the CAD performance. In the present paper we investigate whether machine learning, specifically a support vector machine (SVM), may be used to identify those CAD problems which benefit from GB preconditioning. We run experiments with over 1000 problems (many times larger than previous studies) and find that the machine learned choice does better than the human-made heuristic.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。