← Back to all news
arXiv Machine Learning By Kathl\'en Kohn, Giovanni Luca Marchetti, Alex Massarenti, Massimiliano Mella

Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks

Read the original on arXiv Machine Learning →

The paper proposes a conjecture that composing a fixed number of distinct nonconstant polynomials with a generic high‑degree polynomial produces linearly independent polynomials, extending Newman–Slater’s theorem. The authors prove the conjecture for two polynomials and for any number when the degrees are bounded, and they show how these results explain the parameter symmetries of deep fully connected neural networks with generic polynomial activations. In particular, for architectures with layer‑specific activations of increasing degree, the conjecture’s proven cases fully characterize the parameter sets that yield the same end‑to‑end network function, and it also resolves the identifiability of shallow polynomial networks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Oct 16

Linear Independence of Polynomial Compositions with Bounded Input Degree

The paper proves the weak composition‑independence conjectures of Kohn, Marchetti, Massarenti and Mella by employing deformations of rational curves and a single kernel of the linearized equation, with Riemann‑Roch providing a contradiction from tangent fields with controlled poles. This result establishes that a neural network using a general polynomial activation function of sufficiently large degree is identifiable.

By Xiaotian Chang, Yacoub Hendi
More like this →
arXiv Machine Learning
Oct 16

SUPN: Shallow Universal Polynomial Networks for Efficient Function Approximation

The paper introduces Shallow Universal Polynomial Networks (SUPNs), a single‑hidden‑layer architecture that replaces standard activations with learnable multivariate polynomials, thereby increasing expressivity per unit. SUPNs achieve universal approximation by either widening the network or increasing polynomial complexity, and the authors prove convergence rates and quasi‑optimal parameter choices. Empirical tests across a wide range of smooth, nonsmooth, and discontinuous functions in up to ten dimensions show that SUPNs often outperform deep neural networks and Kolmogorov‑Arnold networks in accuracy and variability while requiring fewer parameters and lower training cost.

By Zachary Morrow, Michael Penwarden, Brian Chen, Aurya Javeed, Akil Narayan, John D. Jakeman
More like this →
arXiv Machine Learning
Jul 24

New Complexity-Theoretic Frontiers of Tractability for Neural Network Training

arXiv:2607. 20811v1 Announce Type: new Abstract: In spite of the fundamental role of neural networks in contemporary machine learning research, our understanding of the computational complexity of optimally training neural networks remains incomplete even when dealing with the simplest kinds of activation functions.

By Cornelius Brand, Robert Ganian, Mathis Rocton
efficiency
More like this →
arXiv Machine Learning
Oct 28

Polynomial Residual Networks are Generically Identifiable

The paper establishes identifiability results for constant‑width residual networks that use polynomial activations and bias terms. For activations of degree at least five with generic coefficients, the mapping from parameters to network outputs is generically one‑to‑one. For activations of degree at least three that lack a linear term after a suitable input translation, the generic fiber consists of translations of biases combined with scaling of weights and biases by real roots of unity, and these findings also apply to bias‑free networks. Additionally, the authors derive necessary conditions for critical points of the ResNet parametrization, which are important in singular learning theory.

By Isabel Dahlgren, Giovanni Luca Marchetti, Kathl\'en Kohn
safety
More like this →