Explaining f-Divergence-Based Regularization via Local Curvature and Sharpness-Aware Minimization
Not on the map. Why?
Abstract (arXiv)
Divergence-based regularization and Sharpness-Aware Minimization (SAM) are two prominent approaches for improving generalization in deep learning, both motivated by robustness to perturbations. However, their relationship has remained largely unexplored. Building on classical second-order expansions of f-divergences, we show that the two methods are locally consistent under parameter-space perturbations: both induce curvature-sensitive penalties, with divergence regularization yielding a Fisher-weighted quadratic form and SAM penalizing sharpness through the dominant Hessian eigenvalue. For negative log-likelihood objectives with exponential-family output distributions, this correspondence becomes especially transparent, since the Fisher and Gauss-Newton matrices coincide. We further show that the same local geometric perspective extends to input-space perturbations, where divergence-based regularization is defined through transformations of the input. In this setting, the regularizer induces a pullback quadratic form on the input space, providing a more general perturbation framework than standard SAM while preserving the same local sensitivity interpretation. To validate the analysis empirically, we use the asymmetric α-skew Jensen-Shannon divergence (JSD) family as a controlled testbed. Its local curvature coefficient scales as α(1-α) and is maximized at the symmetric point α=tfrac12, which recovers the standard JSD. Loss-landscape visualizations in the input-perturbation regime show that stronger induced curvature penalization is associated with flatter local minima. Experiments on four benchmark datasets further demonstrate that both accuracy and negative log-likelihood are consistently best near this regime of maximal curvature penalization.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 24 references that are in the map. First posted on arXiv 8 Sep 2026.
Builds on
16 of 24 references.
References · 16
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
- 2014New insights and perspectives on the natural gradient methodcited by 435
- 2022Fisher SAM: Information Geometry and Sharpness Aware Minimisationcited by 84
- 2022How Does Sharpness-Aware Minimization Minimize Sharpness?cited by 64
- 2015Distributional Smoothing with Virtual Adversarial Trainingcited by 61
- 2020When Optimizing f-divergence is Robust with Label Noisecited by 44
- 2023SAM operates far from home: eigenvalue regularization as a dynamical phenomenoncited by 24
- 2021Adversarial Robustness via Fisher-Rao Regularizationcited by 19
4 more
- 2023CR-SAM: Curvature Regularized Sharpness-Aware Minimizationcited by 10
- 2023Learning Fair Classifiers via Min-Max F-divergence Regularizationcited by 8
- 2024X-SHIELD: Regularization for eXplainable Artificial Intelligencecited by 3
- 2025Regularization via f-Divergence: An Application to Multi-Oxide Spectroscopic Analysiscited by 3
Built on by
Not cited yet.