2 papers
cs.LG2026
Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation
Anastasis Kratsios, Simone Brugiapaglia, Bum Jun Kim +2
Feedforward neural network (NN) expressivity is typically studied by emulating optimal basis-expansion schemes. While powerful, this perspective is incomplete: it primarily capture…
stat.ML2026
Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
Anastasis Kratsios, Gregory Cousins, Haitz Sáez de Ocáriz Borde +2
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 finite feedforward architecture w…