arXiv · 2204.12392
A PAC-Bayes oracle inequality for sparse neural networks
Abstract
We study the Gibbs posterior distribution for sparse deep neural nets in a nonparametric regression setting. The posterior can be accessed via Metropolis-adjusted Langevin algorithms. Using a mixture over uniform priors on sparse sets of network weights, we prove an oracle inequality which shows that the method adapts to the unknown regularity and hierarchical structure of the regression function. The estimator achieves the minimax-optimal rate of convergence (up to a logarithmic factor).
Explore related subjects
Keep this discovery
Maximilian F. Steffen, Mathias Trabs. 2022-04-26. A PAC-Bayes oracle inequality for sparse neural networks. https://doi.org/10.1007/978-3-032-01279-1_7
Cite the original work for its findings. Save a collection to share your selection of sources.