Efficient Search for Customized Activation Functions with Gradient Descent

Lukas Strack, Mahmoud Safari, Frank Hutter
8/13/2024
cs.LGcs.AI

No official code found. Best implementation: automl/GRAFS (1 star, last commit 2024-08-12).

Abstract

Different activation functions work best for different deep learning models. To exploit this, we leverage recent advancements in gradient-based search techniques for neural architectures to efficiently identify high-performing activation functions for a given application. We propose a fine-grained search cell that combines basic mathematical operations to model activation functions, allowing for the exploration of novel activations. Our approach enables the identification of specialized activations, leading to improved performance in every model we tried, from image classification to language models. Moreover, the identified activations exhibit strong transferability to larger models of the same type, as well as new datasets. Importantly, our automated process for creating customized activation functions is orders of magnitude more efficient than previous approaches. It can easily be applied on top of arbitrary deep learning pipelines and thus offers a promising practical avenue for enhancing deep learning architectures.

View on arXivView PDF

Code Implementations(1)

automl/GRAFSCommunity100%
10PythonAug 12, 20242 years ago

Similar Papers

Cite this paper

@article{strack2024efficient,
  title  = {Efficient Search for Customized Activation Functions with Gradient Descent},
  author = {Lukas Strack and Mahmoud Safari and Frank Hutter},
  year   = {2024},
  eprint = {2408.06820},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.06820v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.06820.svg)](https://codeofpaper.com/paper/2408.06820)

Discussion