“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 17757 |
|
| Abstract: | |
|
We discuss the use of machine learning models for finding â??good coordinatesâ?� for polynomial ideals. Our main goal is to put ideals into quasi-stable position, as this generic position shares most properties of the generic initial ideal, but can be deterministically reached and verified. Furthermore, it entails a Noether normalisation and provides us with a system of parameters. Traditional approaches use either random choices which typically destroy all sparsity or rather simple human heuristics which are only moderately successful. Our experiments show that machine learning models provide us here with interesting alternatives that most of the time make nearly optimal choices.
Download TeX format |
|
| back to top | |
