A Transformer oracle that predicts useful expansion steps in border basis computations cuts runtimes up to 3x over the baseline while a fallback cap keeps the output provably correct.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms
A Transformer oracle that predicts useful expansion steps in border basis computations cuts runtimes up to 3x over the baseline while a fallback cap keeps the output provably correct.