Algorithmically generating new algebraic features of polynomial systems for machine learning

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

4 Downloads (Pure)

Abstract

There are a variety of choices to be made in both computer algebra systems (CASs) and satisfiability modulo theory (SMT) solvers which can impact performance without affecting mathematical correctness. Such choices are candidates for machine learning (ML) approaches, however, there are difficulties in applying standard ML techniques, such as the efficient identification of ML features from input data which is typically a polynomial system. Our focus is selecting the variable ordering for cylindrical algebraic decomposition (CAD), an important algorithm implemented in several CASs, and now also SMT-solvers. We created a framework to describe all the previously identified ML features for the problem and then enumerated all options in this framework to automatically generate many more features. We validate the usefulness of these with an experiment which shows that an ML choice for CAD variable ordering is superior to those made by human created heuristics, and further improved with these additional features. This technique of feature generation could be useful for other choices related to CAD, or even choices for other algorithms in CASs / SMT-solvers with polynomial systems as input.

Original languageEnglish
Title of host publicationProceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation
PublisherCEUR Workshop Proceedings
Number of pages12
Publication statusPublished - 4 Oct 2019
Event4th International Workshop on Satisfiability Checking and Symbolic Computation - Bern , Switzerland
Duration: 10 Jul 201910 Jul 2019

Publication series

NameCEUR Workshop Proceedings
PublisherCEUR Workshop Proceedings
Volume2460
ISSN (Print)1613-0073

Conference

Conference4th International Workshop on Satisfiability Checking and Symbolic Computation
Abbreviated titleSIAM AG 2019
CountrySwitzerland
CityBern
Period10/07/1910/07/19

Fingerprint

Learning systems
Polynomials
Algebra
Decomposition
Identification (control systems)
Experiments

Bibliographical note

Copyright © 2019 for the individual papers by the papers' authors. This volume and its papers are published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).

Keywords

  • machine learning
  • feature generation
  • non-linear
  • real arithmetic
  • symbolic computation
  • cylindrical algebraic decomposition

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Florescu, D., & England, M. (2019). Algorithmically generating new algebraic features of polynomial systems for machine learning. In Proceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation (CEUR Workshop Proceedings; Vol. 2460). CEUR Workshop Proceedings.

Algorithmically generating new algebraic features of polynomial systems for machine learning. / Florescu, Dorian; England, Matthew.

Proceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation. CEUR Workshop Proceedings, 2019. (CEUR Workshop Proceedings; Vol. 2460).

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Florescu, D & England, M 2019, Algorithmically generating new algebraic features of polynomial systems for machine learning. in Proceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation. CEUR Workshop Proceedings, vol. 2460, CEUR Workshop Proceedings, 4th International Workshop on Satisfiability Checking and Symbolic Computation, Bern , Switzerland, 10/07/19.
Florescu D, England M. Algorithmically generating new algebraic features of polynomial systems for machine learning. In Proceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation. CEUR Workshop Proceedings. 2019. (CEUR Workshop Proceedings).
Florescu, Dorian ; England, Matthew. / Algorithmically generating new algebraic features of polynomial systems for machine learning. Proceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation. CEUR Workshop Proceedings, 2019. (CEUR Workshop Proceedings).
@inproceedings{30a71f6493b54b4db873df1120aa3636,
title = "Algorithmically generating new algebraic features of polynomial systems for machine learning",
abstract = "There are a variety of choices to be made in both computer algebra systems (CASs) and satisfiability modulo theory (SMT) solvers which can impact performance without affecting mathematical correctness. Such choices are candidates for machine learning (ML) approaches, however, there are difficulties in applying standard ML techniques, such as the efficient identification of ML features from input data which is typically a polynomial system. Our focus is selecting the variable ordering for cylindrical algebraic decomposition (CAD), an important algorithm implemented in several CASs, and now also SMT-solvers. We created a framework to describe all the previously identified ML features for the problem and then enumerated all options in this framework to automatically generate many more features. We validate the usefulness of these with an experiment which shows that an ML choice for CAD variable ordering is superior to those made by human created heuristics, and further improved with these additional features. This technique of feature generation could be useful for other choices related to CAD, or even choices for other algorithms in CASs / SMT-solvers with polynomial systems as input.",
keywords = "machine learning, feature generation, non-linear, real arithmetic, symbolic computation, cylindrical algebraic decomposition",
author = "Dorian Florescu and Matthew England",
note = "Copyright {\circledC} 2019 for the individual papers by the papers' authors. This volume and its papers are published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).",
year = "2019",
month = "10",
day = "4",
language = "English",
series = "CEUR Workshop Proceedings",
publisher = "CEUR Workshop Proceedings",
booktitle = "Proceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation",
address = "Germany",

}

TY - GEN

T1 - Algorithmically generating new algebraic features of polynomial systems for machine learning

AU - Florescu, Dorian

AU - England, Matthew

N1 - Copyright © 2019 for the individual papers by the papers' authors. This volume and its papers are published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).

PY - 2019/10/4

Y1 - 2019/10/4

N2 - There are a variety of choices to be made in both computer algebra systems (CASs) and satisfiability modulo theory (SMT) solvers which can impact performance without affecting mathematical correctness. Such choices are candidates for machine learning (ML) approaches, however, there are difficulties in applying standard ML techniques, such as the efficient identification of ML features from input data which is typically a polynomial system. Our focus is selecting the variable ordering for cylindrical algebraic decomposition (CAD), an important algorithm implemented in several CASs, and now also SMT-solvers. We created a framework to describe all the previously identified ML features for the problem and then enumerated all options in this framework to automatically generate many more features. We validate the usefulness of these with an experiment which shows that an ML choice for CAD variable ordering is superior to those made by human created heuristics, and further improved with these additional features. This technique of feature generation could be useful for other choices related to CAD, or even choices for other algorithms in CASs / SMT-solvers with polynomial systems as input.

AB - There are a variety of choices to be made in both computer algebra systems (CASs) and satisfiability modulo theory (SMT) solvers which can impact performance without affecting mathematical correctness. Such choices are candidates for machine learning (ML) approaches, however, there are difficulties in applying standard ML techniques, such as the efficient identification of ML features from input data which is typically a polynomial system. Our focus is selecting the variable ordering for cylindrical algebraic decomposition (CAD), an important algorithm implemented in several CASs, and now also SMT-solvers. We created a framework to describe all the previously identified ML features for the problem and then enumerated all options in this framework to automatically generate many more features. We validate the usefulness of these with an experiment which shows that an ML choice for CAD variable ordering is superior to those made by human created heuristics, and further improved with these additional features. This technique of feature generation could be useful for other choices related to CAD, or even choices for other algorithms in CASs / SMT-solvers with polynomial systems as input.

KW - machine learning

KW - feature generation

KW - non-linear

KW - real arithmetic

KW - symbolic computation

KW - cylindrical algebraic decomposition

UR - http://www.scopus.com/inward/record.url?scp=85073808561&partnerID=8YFLogxK

M3 - Conference proceeding

T3 - CEUR Workshop Proceedings

BT - Proceedings of the 4th International Workshop on Satisfiability Checking and Symbolic Computation

PB - CEUR Workshop Proceedings

ER -