CORTEXA
← Browse
arxivmath.AGcs.NE2026-07-19

Expressivity of Shallow Neural Networks Over Finite Fields

Maksym Zubkov, Carol Wu, Shiwei Yang, Param Mody, Yifei Chen

We study the expressivity of shallow polynomial neural networks (PNNs) with monomial activation functions over finite fields. For a given architecture, we define a neuromanifold as the image of the map from all possible network weights into the product of polynomial rings. We quantify the expressivity by the cardinality of the neuromanifold, and derive a natural lower and upper bound. This leads to counting rational points over finite fields, a problem closely linked to the Weil conjectures. Finally, we present an architecture that exhibits a striking difference in the neuromanifolds when considered over a characteristic zero versus a finite-characteristic field, illustrating the critical role of field characteristic in the notion of expressivity.

View free PDFSource page

Related papers

arxivcs.NE2026-07-23

Search Hardness-Aware LLM-Based Problem Formulation for Expensive Simulation-Driven Design

Yuchen Li, Handing Wang, Bing Xue, Mengjie Zhang

Expensive simulation-driven design is widely used in engineering to identify requirement-satisfying designs with as few high-fidelity simulations as possible. Most existing efforts address this challenge by improving optimization algorithms under fixed formulations, yet the formu…

View free PDFSource page
arxivcs.LGcs.NE2026-07-23

Weight-norm Criticality: A Mechanism for Loss Spikes Induced by the Normalization and Weight Decay

Xiaolong Li, Zhangchen Zhou, Zhi-Qin John Xu

Most explanations of training instability focus on \emph{learning-rate criticality}, typically characterized by the Edge of Stability, beyond which optimization becomes unstable. We argue that, in practical deep neural network training, there is an additional and often overlooked…

View free PDFSource page