Skip to content
aiqbench takeAI Research

aiqbench analysis

This paper establishes a rigorous geometric foundation for polynomial neural networks by proving global identifiability under specific activation degree bounds using the Alexander-Hirschowitz theorem framework. By correcting previous proofs through direct differential analysis, it clarifies the dimension and non-defectiveness properties of neurovarieties, offering critical theoretical insights into the representational capacity of deep learning architectures.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

The Alexander-Hirschowitz theorem for neurovarieties

arXiv1 min read

arXiv:2511.19703v2 Announce Type: replace-cross Abstract: We study the dimension and identifiability of neurovarieties associated to polynomial neural networks. We give an independent geometric proof that the linear bounds $d_i\geq 2n_i-1$ on the activation degrees imply non defectiveness for any number of outputs, a dimension statement previously obtained from finite identifiability. The proof is based on a direct analysis of the differential of the parameterization. We also investigate secant and Grassmann-secant obstructions outside this range and prove global identifiability for multi-output architectures under the same degree bounds.

Abstract:We study the dimension and identifiability of neurovarieties associated to polynomial neural networks. We give an independent geometric proof that the linear bounds $d_i\geq 2n_i-1$ on the activation degrees imply non defectiveness for any number of outputs, a dimension statement previously obtained from finite identifiability. The proof is based on a direct analysis of the differential of the parameterization. We also investigate secant and Grassmann-secant obstructions outside this range and prove global identifiability for multi-output architectures under the same degree bounds.

15 pages. Thanks to Kevin Dao, we identified a gap in the previous proof of the main non-defectiveness result. We replaced the transversality argument with a direct analysis of the differential, based on a new linear independence lemma, obtaining the degree bound $d_i\ge 2n_i-1$

Algebraic Geometry (math.AG); Artificial Intelligence (cs.AI); Machine Learning (cs.LG); Commutative Algebra (math.AC)

arXiv:2511.19703 [math.AG]

(or arXiv:2511.19703v2 [math.AG] for this version)

Full text under the publisher's open licence · 145 words

Related coverage