SOURCE-LINKED INTELLIGENCE

Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks

arXiv · AI, language, vision and robotics · article · Aug 27, 2026 · UTC

Motivated by theoretical problems in deep learning, we conjecture that post-composing a fixed number of pairwise distinct nonconstant polynomials with a generic polynomial of sufficiently large degree yields linearly independent polynomials. This generalizes Newman--Slater's theorem on powers of polynomials. We establish several cases of this conjecture and its origin-passing variant: We prove the result for two polynomials, and for an arbitrary number of polynomials when their degrees are bounded. Furthermore, we show how the conjecture implies a complete understanding of the identifiability

Read original source ↗ Open in workspace

recordType

paper

region

Global