analiza aiqbench
This paper applies advanced algebraic geometry techniques to rigorously characterize the structural constraints and expressive limits of ReLU neural networks. By deriving polynomial equations based on rank conditions within activation regions, it offers a theoretical framework for understanding how piecewise linear architectures function in parameter space. Such mathematical formalization is essential for advancing fundamental AI research beyond empirical observation into provable bounds.
Constraining the outputs of ReLU neural networks
arXiv:2508.03867v2 Announce Type: replace-cross Abstract: We introduce a class of algebraic varieties naturally associated with ReLU neural networks, arising from the piecewise linear structure of their outputs across activation regions in input space, and the piecewise multilinear structure in parameter space. By analyzing the rank constraints on the network outputs within each activation region, we derive polynomial equations that characterize the functions representable by the network. We further investigate conditions under which these varieties attain their expected dimension, providing insight into the expressive and structural properties of ReLU networks.
Abstract:We introduce a class of algebraic varieties naturally associated with ReLU neural networks, arising from the piecewise linear structure of their outputs across activation regions in input space, and the piecewise multilinear structure in parameter space. By analyzing the rank constraints on the network outputs within each activation region, we derive polynomial equations that characterize the functions representable by the network. We further investigate conditions under which these varieties attain their expected dimension, providing insight into the expressive and structural properties of ReLU networks.
Algebraic Geometry (math.AG); Machine Learning (cs.LG); Machine Learning (stat.ML)
arXiv:2508.03867 [math.AG]
(or arXiv:2508.03867v2 [math.AG] for this version)
https://doi.org/10.48550/arXiv.2508.03867 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 182 cuvinte
Subiecte conexe
Polyhedral Geometry of Time-to-First-Spike Neural Networks
arXiv · 11 sept. 2026
Variation Spaces for Encoder--Decoder Neural Operators: Approximation and Generalization
arXiv · 3 sept. 2026
[AINews] High Taste Testers Ep. 1
Latent Space · 17 oct. 2026

Challenge: Hand coding weights for efficient sequence memorisation
AI Alignment Forum · 23 iul. 2026