Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition

Abstract

Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. When using CAD, there is often a choice for the ordering placed on the variables. This can be important, with some problems infeasible with one variable ordering but easy with another. Machine learning is the process of fitting a computer model to a complex function based on properties learned from measured data. In this paper we use machine learning (specifically a support vector machine) to select between heuristics for choosing a variable ordering, outperforming each of the separate heuristics.

16 pages

Cited by in corpus (9)

• Improving the use of equational constraints in cylindrical algebraic decomposition
• Symbolic Versus Numerical Computation and Visualization of Parameter Regions for Multistationarity of Biological Networks
• Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
• Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition With Groebner Bases
• Using the distribution of cells by dimension in a cylindrical algebraic decomposition
• A machine learning based software pipeline to pick the variable ordering for algorithms with polynomial inputs
• A comparison of three heuristics to choose the variable ordering for CAD
• On Minimal and Minimum Cylindrical Algebraic Decompositions
• Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition