English

Generalization error bounds for two-layer neural networks with Lipschitz loss function

Machine Learning 2026-04-09 v1 Probability

Abstract

We derive generalization error bounds for the training of two-layer neural networks without assuming boundedness of the loss function, using Wasserstein distance estimates on the discrepancy between a probability distribution and its associated empirical measure, together with moment bounds for the associated stochastic gradient method. In the case of independent test data, we obtain a dimension-free rate of order O(n1/2)O(n^{-1/2} ) on the nn-sample generalization error, whereas without independence assumption, we derive a bound of order O(n1/(din+dout))O(n^{-1 / ( d_{\rm in}+d_{\rm out} )} ), where dind_{\rm in}, doutd_{\rm out} denote input and output dimensions. Our bounds and their coefficients can be explicitly computed prior to the training of the model, and are confirmed by numerical simulations.

Keywords

Cite

@article{arxiv.2604.06281,
  title  = {Generalization error bounds for two-layer neural networks with Lipschitz loss function},
  author = {Jiang Yu Nguwi and Nicolas Privault},
  journal= {arXiv preprint arXiv:2604.06281},
  year   = {2026}
}
R2 v1 2026-07-01T11:58:04.030Z