Under an unproved irreducibility heuristic, the outputs of the proposed generator-sampling algorithm are Zariski dense in the space of generator sets of a fixed ideal, supplying a conditional geometric notion of dataset generality for transformer training.
B \^o cher, Introduction to Higher Algebra , Macmillan, 1907
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
-
Geometric Generality of Transformer-Based Gr\"obner Basis Computation
Under an unproved irreducibility heuristic, the outputs of the proposed generator-sampling algorithm are Zariski dense in the space of generator sets of a fixed ideal, supplying a conditional geometric notion of dataset generality for transformer training.