Deep Neural Networks: Multi-Classification and Universal Approximation
<|reference_start|>Deep Neural Networks: Multi-Classification and Universal Approximation: We demonstrate that a ReLU deep neural network with a width of $2$ and a depth of $2N+4M-1$ layers can achieve finite sample memorization for any dataset comprising $N$ elements in $\mathbb{R}^d$, where $d\ge1,$ and $M$ classes, thereby ensuring accurate classification.   By modeling the neural network as a time-discrete nonlinear dynamical system, we interpret the memorization property as a problem of simultaneous or ensemble controllability. This problem is addressed by constructing the network parameters inductively and explicitly, bypassing the need for training or solving any optimization problem.   Additionally, we establish that such a network can achieve universal approximation in $L^p(\Omega;\mathbb{R}_+)$, where $\Omega$ is a bounded subset of $\mathbb{R}^d$ and $p\in[1,\infty)$, using a ReLU deep neural network with a width of $d+1$. We also provide depth estimates for approximating $W^{1,p}$ functions and width estimates for approximating $L^p(\Omega;\mathbb{R}^m)$ for $m\geq1$. Our proofs are constructive, offering explicit values for the biases and weights involved.<|reference_end|>
@article{hernández2024deep,
    title={Deep Neural Networks: Multi-Classification and Universal Approximation},
    author={Mart'in Hern'andez, Enrique Zuazua},
    journal={arXiv preprint arXiv:2409.06555},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.06555},
    primaryClass={stat.ML cs.LG math.OC}
}