Constructive Universal Approximation and Sure Convergence for Multi-Layer Neural Networks
Chien-Ming Chi

TL;DR
This paper introduces o1Neuro, a neural network model with sparse indicator neurons that achieves universal approximation and guaranteed convergence, outperforming traditional models on complex regression tasks.
Contribution
The paper presents o1Neuro, a novel sparse indicator neuron-based neural network with proven approximation capabilities and convergence guarantees, highlighting the trade-off between sparsity and depth.
Findings
o1Neuro can approximate any measurable function at the population level.
It achieves sure convergence with high probability after sufficient updates.
Empirically outperforms XGBoost, Random Forests, and TabNet on benchmark datasets.
Abstract
We propose o1Neuro, a new neural network model built on sparse indicator activation neurons, with two key statistical properties. (1) Constructive universal approximation: At the population level, a deep o1Neuro can approximate any measurable function of , while a shallow o1Neuro suffices for additive models with two-way interaction components, including XOR and univariate terms, assuming has bounded density. Combined with prior work showing that a single-hidden-layer non-sparse network is a universal approximator, this highlights a trade-off between activation sparsity and network depth in approximation capability. (2) Sure convergence: At the sample level, the optimization of o1Neuro reaches an optimal model with probability approaching one after sufficiently many update rounds, and we provide an example showing that the required number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
