Scale-invariant Bayesian Neural Networks with Connectivity Tangent Kernel
Not on the map. Why?
Abstract (arXiv)
Explaining generalizations and preventing over-confident predictions are central goals of studies on the loss landscape of neural networks. Flatness, defined as loss invariability on perturbations of a pre-trained solution, is widely accepted as a predictor of generalization in this context. However, the problem that flatness and generalization bounds can be changed arbitrarily according to the scale of a parameter was pointed out, and previous studies partially solved the problem with restrictions: Counter-intuitively, their generalization bounds were still variant for the function-preserving parameter scaling transformation or limited only to an impractical network structure. As a more fundamental solution, we propose new prior and posterior distributions invariant to scaling transformations by textitdecomposing the scale and connectivity of parameters, thereby allowing the resulting generalization bound to describe the generalizability of a broad class of networks with the more practical class of transformations such as weight decay with batch normalization. We also show that the above issue adversely affects the uncertainty calibration of Laplace approximation and propose a solution using our invariant posterior. We empirically demonstrate our posterior provides effective flatness and calibration measures with low complexity in such a practical parameter transformation case, supporting its practical effectiveness in line with our rationale.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 53 of its 75 references that are in the map. First posted on arXiv 30 Sep 2022.
Builds on
53 of 75 references.
References · 53
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
38 more
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,287
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2017Exploring Generalization in Deep Learningcited by 600
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2019Likelihood Ratios for Out-of-Distribution Detectioncited by 453
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 371
- 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 365
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2015Probabilistic Backpropagation for Scalable Learning of Bayesian Neural Networkscited by 295
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
- 2020Being Bayesian, Even Just a Bit, Fixes Overconfidence in ReLU Networkscited by 231
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 157
- 2020Evaluation of Neural Architectures Trained with Square Loss vs Cross-Entropy in Classification Taskscited by 138
- 2018Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approachcited by 126
- 2017L2 Regularization versus Batch and Weight Normalizationcited by 124
- 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 120
- 2018Three Mechanisms of Weight Decay Regularizationcited by 113
- 2020Tighter risk certificates for neural networkscited by 112
- 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 100
- 2019A Signal Propagation Perspective for Pruning Neural Networks at Initializationcited by 96
- 2020Bayesian Deep Ensembles via the Neural Tangent Kernelcited by 90
- 2019Approximate Inference Turns Deep Networks into Gaussian Processescited by 89
- 2020Relative Flatness and Generalizationcited by 88
- 2020Bayesian Deep Learning via Subnetwork Inferencecited by 87
- 2019'In-Between' Uncertainty in Bayesian Neural Networkscited by 80
- 2018Bayesian Uncertainty Estimation for Batch Normalized Deep Networkscited by 70
- 2020Hutch++: Optimal Stochastic Trace Estimationcited by 63
- 2020Catastrophic Fisher Explosion: Early Phase Fisher Matrix Impacts Generalizationcited by 62
- 2019Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks using PAC-Bayesian Analysiscited by 59
- 2021Fast Adaptation with Linearized Neural Networkscited by 32
50 most cited of 53 All 53 (JSON)
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 4.
7 papers.
- 2024Reparameterization invariance in approximate Bayesian inferencecited by 17
- 2023The Geometry of Neural Nets' Parameter Spaces Under Reparametrizationcited by 16
- 2023Stochastic Marginal Likelihood Gradients using Neural Tangent Kernelscited by 10
- 2025Determinant Estimation under Memory Constraints and Neural Scaling Lawscited by 4
- 2025Spectral Estimation with Free Decompressioncited by 1
- 2025PEdger++: Practical Edge Detection via Assembling Cross Informationcited by 0
- 2025Position: Many generalization measures for deep learning are fragilecited by 0
- 2025Position: Many generalization measures for deep learning are fragile21 Oct 2025
- 2025PEdger++: Practical Edge Detection via Assembling Cross Information16 Aug 2025
- 2025Spectral Estimation with Free Decompression13 Jun 2025
- 2025Determinant Estimation under Memory Constraints and Neural Scaling Laws6 Mar 2025
- 2024Reparameterization invariance in approximate Bayesian inference5 Jun 2024
- 2023Stochastic Marginal Likelihood Gradients using Neural Tangent Kernels6 Jun 2023
- 2023The Geometry of Neural Nets' Parameter Spaces Under Reparametrization14 Feb 2023