Posterior Contraction for Sparse Neural Networks in Besov Spaces with Intrinsic Dimensionality
Not on the map. Why?
Abstract (arXiv)
This work establishes that sparse Bayesian neural networks achieve optimal posterior contraction rates over anisotropic Besov spaces and their hierarchical compositions. These structures reflect the intrinsic dimensionality of the underlying function, thereby mitigating the curse of dimensionality. Our analysis shows that Bayesian neural networks equipped with either sparse or continuous shrinkage priors attain the optimal rates which are dependent on the intrinsic dimension of the true structures. Moreover, we show that these priors enable rate adaptation, allowing the posterior to contract at the optimal rate even when the smoothness level of the true function is unknown. The proposed framework accommodates a broad class of functions, including additive and multiplicative Besov functions as special cases. These results advance the theoretical foundations of Bayesian neural networks and provide rigorous justification for their practical effectiveness in high-dimensional, structured estimation problems.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 56 references that are in the map. First posted on arXiv 23 Jun 2025.
Builds on
25 of 56 references.
References · 25
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 433
- 2021Revisiting the Calibration of Modern Neural Networkscited by 390
- 2018Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problemcited by 323
- 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 315
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
- 2016Benefits of depth in neural networkscited by 250
- 2018Adaptivity of deep ReLU network for learning in Besov and mixed smooth Besov spaces: optimal rate and curse of dimensionalitycited by 162
- 2020Bayesian Deep Learning via Subnetwork Inferencecited by 87
- 2015Representation Benefits of Deep Feedforward Networkscited by 86
- 2018Posterior Concentration for Sparse Deep Learningcited by 50
- 2018Fast convergence rates of deep neural networks for classificationcited by 46
13 more
- 2019Deep learning is adaptive to intrinsic dimensionality of model smoothness in anisotropic Besov spacecited by 46
- 2020Efficient Variational Inference for Sparse Deep Learning with Theoretical Guaranteecited by 37
- 2024Transformers are Minimax Optimal Nonparametric In-Context Learnerscited by 37
- 2019Convergence Rates of Variational Inference in Sparse Deep Learningcited by 27
- 2021Consistent Sparse Deep Learning: Theory and Computationcited by 27
- 2023A Primer on Bayesian Neural Networks: Review and Debatescited by 27
- 2024Posterior and variational inference for deep neural networks with heavy-tailed weightscited by 10
- 2023Masked Bayesian Neural Networks : Theoretical Guarantee and its Posterior Inferencecited by 9
- 2020On the rate of convergence of image classifiers based on convolutional neural networkscited by 7
- 2022Asymptotic Properties for Bayesian Neural Network in Besov Spacecited by 7
- 2024Posterior concentrations of fully-connected Bayesian neural networks with general priors on the weightscited by 7
- 2025Approximation Bounds for Transformer Networks with Application to Regressioncited by 4
- 2022Optimal Convergence Rates of Deep Convolutional Neural Networks: Additive Ridge Functionscited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.