Fast approximation and learning of binary classification tasks in o-minimal structures using ReLU neural networks
math.LO, cs.LG, math.FA
Submitted: 2026-06-29
Updated: 2026-11-12
Terminology
Sources
- Deep Learning as the Disciplined Construction of Tame Objects
- Measurability in the Fundamental Theorem of Statistical Learning
- Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
- Optimal learning of high-dimensional classification problems using deep neural networks
- Mathematical theory of deep learning
Related papers
- The consistency strength of the failure of amenable C-sequences
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
- Indiscernible Extraction in Theories with Bounded k-splitting
- Measuring the Complexity of Countable Presburger Models
- A non-trivially non-trivial automorphism at an inaccessible cardinal
- The Ordering Principle and Higher Dependent Choice