Rapid Bayesian computation and estimation for neural networks via log-concave coupling

  • Curtis McDonald

    University of California, Berkeley, USA
  • Andrew R. Barron

    Yale University, New Haven, USA
Rapid Bayesian computation and estimation for neural networks via log-concave coupling cover
Download PDF

A subscription is required to access this article.

Abstract

This paper presents the study of a Bayesian estimation procedure for single-hidden-layer neural networks using controlled neuron weight vectors. We study the structure of the posterior density and provide a representation that makes it amenable to rapid sampling via Markov Chain Monte Carlo (MCMC). Let the neural network have neurons with internal weights of dimension and fix the outer weights. Thus, there are parameters overall. With  data observations, use a gain parameter or inverse temperature of in the posterior density for the internal weights.
The posterior is intrinsically multi-modal and not naturally suited to rapid mixing of direct MCMC algorithms. For a continuous uniform prior on the ball, we demonstrate that the posterior density can be written as a mixture density with suitably defined auxiliary random variables, where the mixture components are log-concave. Furthermore, when the total number of model parameters is large enough that , the mixing distribution of the auxiliary random variables is also log-concave. Thus, neuron parameters can be sampled from the posterior by only sampling log-concave densities. The authors refer to the pairing of weights with such auxiliary random variables as a log-concave coupling.

Cite this article

Curtis McDonald, Andrew R. Barron, Rapid Bayesian computation and estimation for neural networks via log-concave coupling. Math. Stat. Learn. (2026), published online first

DOI 10.4171/MSL/59