A Kernel Perspective for Regularizing Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
We propose a new point of view for regularizing deep neural networks by using the norm of a reproducing kernel Hilbert space (RKHS). Even though this norm cannot be computed, it admits upper and lower approximations leading to various practical strategies. Specifically, this perspective (i) provides a common umbrella for many existing regularization principles, including spectral norm and gradient penalties, or adversarial training, (ii) leads to new effective regularization penalties, and (iii) suggests hybrid strategies combining lower and upper bounds to get better approximations of the RKHS norm. We experimentally show this approach to be effective when learning on small datasets, or to obtain adversarially robust models.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1.
4 papers.
- 2021Unrolled Variational Bayesian Algorithm for Image Blind Deconvolutioncited by 4
- 2022Jacobian Norm with Selective Input Gradient Regularization for Improved and Interpretable Adversarial Defensecited by 2
- 2022A Fast and Efficient Conditional Learning for Tunable Trade-Off between Accuracy and Robustnesscited by 1
- 2023On Inductive Biases for Machine Learning in Data Constrained Settingscited by 0
- 2023On Inductive Biases for Machine Learning in Data Constrained Settings21 Feb 2023
- 2022Jacobian Norm with Selective Input Gradient Regularization for Improved and Interpretable Adversarial Defense9 Jul 2022
- 2022A Fast and Efficient Conditional Learning for Tunable Trade-Off between Accuracy and Robustness28 Mar 2022
- 2021Unrolled Variational Bayesian Algorithm for Image Blind Deconvolution14 Oct 2021