Enhancing Diversity in Bayesian Deep Learning via Hyperspherical Energy Minimization of CKA
Not on the map. Why?
Abstract (arXiv)
Particle-based Bayesian deep learning often requires a similarity metric to compare two networks. However, naive similarity metrics lack permutation invariance and are inappropriate for comparing networks. Centered Kernel Alignment (CKA) on feature kernels has been proposed to compare deep networks but has not been used as an optimization objective in Bayesian deep learning. In this paper, we explore the use of CKA in Bayesian deep learning to generate diverse ensembles and hypernetworks that output a network posterior. Noting that CKA projects kernels onto a unit hypersphere and that directly optimizing the CKA objective leads to diminishing gradients when two networks are very similar. We propose adopting the approach of hyperspherical energy (HE) on top of CKA kernels to address this drawback and improve training stability. Additionally, by leveraging CKA-based feature kernels, we derive feature repulsive terms applied to synthetically generated outlier examples. Experiments on both diverse ensembles and hypernetworks show that our approach significantly outperforms baselines in terms of uncertainty quantification in both synthetic and realistic outlier detection tasks.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 31 of its 47 references that are in the map. First posted on arXiv 31 Oct 2024.
Builds on
31 of 47 references.
References · 31
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2013Describing Textures in the Wildcited by 2,110
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
- 2020Bayesian Deep Learning and a Probabilistic Perspective of Generalizationcited by 480
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
- 2020Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awarenesscited by 389
19 more
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 368
- 2021HyperStyle: StyleGAN Inversion with HyperNetworks for Real Image Editingcited by 208
- 2021Deep Deterministic Uncertainty: A Simple Baselinecited by 200
- 2021Repulsive Deep Ensembles are Bayesiancited by 103
- 2023Improved Online Conformal Prediction via Strongly Adaptive Online Learningcited by 76
- 2022HyperTransformer: Model Generation for Supervised and Semi-Supervised Few-Shot Learningcited by 55
- 2019HyperGAN: A Generative Model for Diverse, Performant Neural Networkscited by 51
- 2018A Unified Particle-Optimization Framework for Scalable Bayesian Samplingcited by 44
- 2022Hypernetworks in Meta-Reinforcement Learningcited by 39
- 2021Learning with Hyperspherical Uniformitycited by 35
- 2021Recomposing the Reinforcement Learning Building Blocks with Hypernetworkscited by 33
- 2017Active Learning Using Uncertainty Informationcited by 28
- 2017Riemannian Stein Variational Gradient Descent for Bayesian Inferencecited by 24
- 2023Recurrent Hypernetworks are Surprisingly Strong in Meta-RLcited by 15
- 2021Blurs Behave Like Ensembles: Spatial Smoothings to Improve Accuracy, Uncertainty, and Robustnesscited by 14
- 2023COPlanner: Plan to Roll Out Conservatively but to Explore Optimistically for Model-Based RLcited by 14
- 2022Variational Inference for Infinitely Deep Neural Networkscited by 10
- 2022Hypernetwork-Based Adaptive Image Restorationcited by 8
- 2019Implicit Generative Modeling for Efficient Explorationcited by 6
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.