2017/05/29 by Soumya Ghosh, Finale Doshi-Velez, Ghosh, Soumya +2 · 4 citations
Computer Science · Mathematics · #Adversarial Robustness in Machine Learning #FOS: Computer and information sciences #Gaussian Processes and Bayesian Inference #Machine Learning (stat.ML) #Machine Learning and Algorithms #stat.ML
paper · pdf · doi:10.48550/arxiv.1705.10388
arxiv created 2017/05/29 · openalex publication_date 2017/05/29 · arxiv updated 2017/05/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Bayesian Neural Networks (BNNs) have recently received increasing attention for their ability to provide well-calibrated posterior uncertainties. However, model selection---even choosing the number of nodes---remains an open question. In this work, we apply a horseshoe prior over node pre-activations of a Bayesian neural network, which effectively turns off nodes that do not help explain the data. We demonstrate that our prior prevents the BNN from under-fitting even when the number of nodes required is grossly over-estimated. Moreover, this model selection over the number of nodes doesn't come at the expense of predictive or computational performance; in fact, we learn smaller networks with comparable predictive performance to current approaches.