Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

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.
Surse care acoperăarXiv, Latent Space, Fortune, LessWrong
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Constraining the outputs of ReLU neural networks

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

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