cs.LGNov 15, 2026

Barron Approximation and locally optimal weight densities for shallow neural networks

Authors: G. Welper

Organizations: School of Mathematical and Statistical Sciences, University of Texas Rio Grande Valley, Brownsville, TX 78520, USA

Abstract

Mean field theories provide optimization results for shallow neural networks by analyzing the weight distribution in infinite width limits. Corresponding results for finite sized networks are obtained by particle approximations, for which sharp quantitative bounds are still an open problem. In this paper, we consider a modified mean field loss, which allows a more fine grained control over finite sized networks. We prove convexity and equidistribution properties, which directly lead to Barron type approximation results for networks sampled from local loss minimizers. We demonstrate that particle approximations of the new loss function naturally lead to gradient descent methods with dropout type regularization.

Figures & tables

Explore similar work

CardsList
  1. Uniform-in-Time Weak Propagation-of-Chaos in Shallow Neural Networks

    May 21, 2026Margalit Glasgow, Joan BrunaShallow Neural NetworksMean-Field Theory

  2. Minimax rates for learning spectral Barron functions by deep ReLU neural networks

    Sep 30, 2026Songqiu Ma, Yunfei YangReLU Neural NetworksMinimax Estimation

  3. On the global convergence of gradient descent for wide shallow models with bounded nonlinearities

    May 11, 2026Romain Petit, Clarice Poon, Gabriel PeyréShallow Neural NetworksGradient Descent