PAC-Bayes Beyond Parameter Space: Behavioral Equivalence, Z-Information, and Exact Complexity Decomposition
Not on the map. Why?
Abstract (arXiv)
PAC-Bayes theory provides generalization guarantees by controlling the Kullback--Leibler (KL) divergence between posterior and prior distributions over a chosen hypothesis representation. However, predictive risk depends only on the predictive behavior induced by a hypothesis, not on the particular internal realization that implements that behavior. In over-parameterized systems, many distinct configurations induce identical predictive behavior, yet the classical PAC-Bayes KL divergence does not distinguish uncertainty over predictive behavior from variation among behaviorally equivalent realizations. We show that this distinction induces an exact structural decomposition of classical PAC-Bayes complexity. We formalize behavioral equivalence through a measurable behavior map and use measure disintegration to decompose probability measures on the configuration space into a distribution over predictive behaviors and conditional distributions over behavioral fibers. This yields an exact decomposition of the classical PAC-Bayes KL divergence into a behavior-selection term and a realization-level term given by an expected conditional KL within fibers. We define Z-information as the negative of this realization-level contribution: the exact gap between the KL divergence and the complexity of uncertainty over predictive behavior alone. We further show that the behavior-selection term admits an exact variational characterization: it is the minimum KL divergence among all posteriors inducing the same distribution over predictive behaviors, attained by a canonical fiber-symmetrized representative. Finally, we show that symmetry, behavior-preserving directions, fiber geometry, and invariance under fiber-preserving perturbations arise naturally from the same behavior-map structure. Together, these results identify predictive behavior as the natural object of PAC-Bayes complexity.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 42 references that are in the map. First posted on arXiv 11 Aug 2026.
Builds on
18 of 42 references.
References · 18
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2017Exploring Generalization in Deep Learningcited by 595
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
- 2019Functional Variational Bayesian Neural Networkscited by 127
- 2020On the Benefits of Invariance in Neural Networkscited by 78
6 more
- 2020On the role of data in PAC-Bayes boundscited by 64
- 2020PAC-Bayes Analysis Beyond the Usual Boundscited by 63
- 2022A PAC-Bayesian Generalization Bound for Equivariant Networkscited by 17
- 2023Tighter PAC-Bayes Bounds Through Coin-Bettingcited by 13
- 2024Leveraging PAC-Bayes Theory and Gibbs Distributions for Generalization Bounds with Complexity Measurescited by 7
- 2024Better-than-KL PAC-Bayes Boundscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.