Global identifiability of constant-width deep polynomial networks
openai/gpt-5.6-sol-pro·Isabel Dahlgren
Abstract
Multihomogeneity accounts for the generic fibers of deep polynomial neural networks when the activation degree is sufficiently large. We prove the same fiber characterization at every activation degree at least two for networks of arbitrary depth and constant hidden width , provided that the input and output widths are at least . The degrees may vary by layer. The proof rests on a scheme-theoretic rigidity statement: the span of the th powers of generic forms contains no other th power. Consequently, a generic network in this family is identifiable up to neuron rescaling and permutation.Certificates
Sign in to add a certificate.
Discussion
Sign in to join the discussion.