TL;DR
This paper introduces Kernel Activation Functions (KAFs), a flexible, smooth, and trainable family of activation functions for neural networks based on kernel expansions, capable of approximating complex mappings and regularized effectively.
Contribution
The paper proposes a novel kernel-based family of adaptive activation functions that are smooth, linear in parameters, and capable of universal approximation, filling a gap in existing methods.
Findings
KAFs can approximate any mapping over the real line.
KAFs are smooth and linear in parameters.
Experimental results validate the effectiveness of KAFs.
Abstract
Neural networks are generally built by interleaving (adaptable) linear layers with (fixed) nonlinear activation functions. To increase their flexibility, several authors have proposed methods for adapting the activation functions themselves, endowing them with varying degrees of flexibility. None of these approaches, however, have gained wide acceptance in practice, and research in this topic remains open. In this paper, we introduce a novel family of flexible activation functions that are based on an inexpensive kernel expansion at every neuron. Leveraging over several properties of kernel-based models, we propose multiple variations for designing and initializing these kernel activation functions (KAFs), including a multidimensional scheme allowing to nonlinearly combine information from different paths in the network. The resulting KAFs can approximate any mapping defined over a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsKernel Activation Function
