HATSolver: Learning Groebner Bases with Hierarchical Attention Transformers

Mohamed Malhou, Ludovic Perret, Kristin Lauter
12/9/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

At NeurIPS 2024, Kera et al. introduced the use of transformers for computing Groebner bases, a central object in computer algebra with numerous practical applications. In this paper, we improve this approach by applying Hierarchical Attention Transformers (HATs) to solve systems of multivariate polynomial equations via Groebner bases computation. The HAT architecture incorporates a tree-structured inductive bias that enables the modeling of hierarchical relationships present in the data and thus achieves significant computational savings compared to conventional flat attention models. We generalize to arbitrary depths and include a detailed computational cost analysis. Combined with curriculum learning, our method solves instances that are much larger than those in Kera et al. (2024 Learning to compute Groebner bases)

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{malhou2025hatsolver,
  title  = {HATSolver: Learning Groebner Bases with Hierarchical Attention Transformers},
  author = {Mohamed Malhou and Ludovic Perret and Kristin Lauter},
  year   = {2025},
  eprint = {2512.14722},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.14722v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.14722.svg)](https://codeofpaper.com/paper/2512.14722)

Discussion