no code implementations • 24 Jan 2024 • Tereso del Río, Matthew England
Symbolic Computation algorithms and their implementation in computer algebra systems often contain choices which do not affect the correctness of the output but can significantly impact the resources required: such choices can benefit from having them made separately for each problem via a machine learning model.
no code implementations • 13 Jul 2023 • Tereso del Rio, Matthew England
This paper discusses and evaluates ideas of data balancing and data augmentation in the context of mathematical objects: an important topic for both the symbolic computation and satisfiability checking communities, when they are making use of machine learning techniques to optimise their tools.
no code implementations • 27 Jun 2023 • Rashid Barket, Matthew England, Jürgen Gerhard
There has been an increasing number of applications of machine learning to the field of Computer Algebra in recent years, including to the prominent sub-field of Symbolic Integration.
no code implementations • 24 Apr 2023 • Lynn Pickering, Tereso Del Rio Almajano, Matthew England, Kelly Cohen
In recent years there has been increased use of machine learning (ML) techniques within mathematics, including symbolic computation where it may be applied safely to optimise or select algorithms.
no code implementations • 9 Sep 2022 • Matthew England
The algorithms employed by our communities are often underspecified, and thus have multiple implementation choices, which do not effect the correctness of the output, but do impact the efficiency or even tractability of its production.
no code implementations • 22 May 2020 • Dorian Florescu, Matthew England
It may seem that the probabilistic nature of ML tools would invalidate the exact results prized by such software, however, the algorithms which underpin the software often come with a range of choices which are good candidates for ML application.
no code implementations • 17 Mar 2020 • AmirHosein Sadeghimanesh, Matthew England
In this paper we introduce a new representation for the multistationarity region of a reaction network, using polynomial superlevel sets.
no code implementations • 28 Nov 2019 • Dorian Florescu, Matthew England
Our topic is the use of machine learning to improve software by making choices which do not compromise the correctness of the output, but do affect the time taken to produce such output.
no code implementations • 3 Jun 2019 • Dorian Florescu, Matthew England
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.
no code implementations • 24 Apr 2019 • Matthew England, Dorian Florescu
Prior work to apply ML on this problem implemented a Support Vector Machine (SVM) to select between three existing human-made heuristics, which did better than anyone heuristic alone.
no code implementations • 9 Jul 2018 • Abdulaziz M. Alayba, Vasile Palade, Matthew England, Rahat Iqbal
Deep neural networks have shown good data modelling capabilities when dealing with challenging and large datasets from a wide range of application areas.
no code implementations • 26 Apr 2018 • Zongyan Huang, Matthew England, David Wilson, James H. Davenport, Lawrence C. Paulson
We investigate the use of machine learning (specifically support vector machines) to make such choices instead.
no code implementations • 28 Feb 2018 • Abdulaziz M. Alayba, Vasile Palade, Matthew England, Rahat Iqbal
The complexities of Arabic language in morphology, orthography and dialects makes sentiment analysis for Arabic more challenging.
no code implementations • 10 Feb 2017 • Abdulaziz M. Alayba, Vasile Palade, Matthew England, Rahat Iqbal
While there has been a lot of research on sentiment analysis in English, the amount of researches and datasets in Arabic language is limited.
no code implementations • 15 Aug 2016 • Zongyan Huang, Matthew England, James H. Davenport, Lawrence C. Paulson
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.
no code implementations • 25 Apr 2014 • Zongyan Huang, Matthew England, David Wilson, James H. Davenport, Lawrence C. Paulson, James Bridge
Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields.