Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
arXiv:2605.07097v1 Announce Type: cross Abstract: We show that, in a precise sense, a broad class of feedforward neural networks learn (have finite sample complexity) in the PAC model: every fixed fin