Skip to main content
ConductScienceScienceDex
zenodoopen

Binomial and toric ideal data for learning a performance metric of Buchberger's algorithm

<p>This&nbsp;data set&nbsp;consists of randomly generated binomial and toric ideals. It was used for predicting a certain complexity measure of Buchberger&#39;s algorithm for toric and binomial ideals in small number of variables. See also the corresponding code&nbsp;on&nbsp;<a href="https://github.com/Sondzus/LearningGBvaluemodel">GitHub</a>&nbsp;and&nbsp;the Involve journal paper available on&nbsp;<a href="https://arxiv.org/abs/2106.03676">arXiv</a>, which explains in detail the models used to generate the data.&nbsp;</p> <p>&nbsp;</p> <p><strong>From the article:</strong></p> <p>What can be (machine) learned about the performance of Buchberger&#39;s algorithm?</p> <p>Given a system of polynomials, Buchberger&#39;s algorithm computes a Gr\&quot;obner basis of the ideal these polynomials generate using an iterative procedure based on multivariate long division. The runtime of each step of the algorithm is typically dominated by a series of polynomial additions, and the total number of these additions is a hardware-independent performance metric that is often used to evaluate and optimize various implementation choices. In this work we attempt to predict, using just the starting input, the number of polynomial additions that take place during one run of Buchberger&#39;s algorithm. Good predictions are useful for quickly estimating difficulty and understanding what features make a Gr\&quot;obner basis computation hard. Our features and methods could also be used for value models in the reinforcement learning approach to optimize Buchberger&#39;s algorithm introduced in the second author&#39;s thesis.&nbsp;</p> <p>We show that a multiple linear regression model built from a set of easy-to-compute ideal generator statistics can predict the number of polynomial additions somewhat well, better than an uninformed model, and better than regression models built on some intuitive commutative algebra invariants that are more difficult to compute. We also train a simple recursive neural network that outperforms these linear models. Our work serves as a proof of concept, demonstrating that predicting the number of polynomial additions in Buchberger&#39;s algorithm is a feasible problem from the point of view of machine learning.</p>

ShareScore

32/100

Overall dataset sharing score

Score breakdown

These five areas show where the dataset supports — or may limit — practical reuse.

Stewardship
4
Harmonization
4
Access
16
Reuse readiness
8
Engagement
0

Dataset details

Repository
zenodo
Published
May 30, 2022
License
cc-by-4.0
DOI
10.5281/zenodo.6599501

Scored with release 0.9.0

ScienceDex for faculty

Your academic CV and NIH biosketch

Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.