Mining Generalizable Activation Functions

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Vitvitskyi, Alex, Boratko, Michael, Grcic, Matej, Pascanu, Razvan, Shah, Deep, Veličković, Petar
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914308017881088
author Vitvitskyi, Alex
Boratko, Michael
Grcic, Matej
Pascanu, Razvan
Shah, Deep
Veličković, Petar
author_facet Vitvitskyi, Alex
Boratko, Michael
Grcic, Matej
Pascanu, Razvan
Shah, Deep
Veličković, Petar
contents The choice of activation function is an active area of research, with different proposals aimed at improving optimization, while maintaining expressivity. Additionally, the activation function can significantly alter the implicit inductive bias of the architecture, controlling its non-linear behavior. In this paper, in line with previous work, we argue that evolutionary search provides a useful framework for finding new activation functions, while we also make two novel observations. The first is that modern pipelines, such as AlphaEvolve, which relies on frontier LLMs as a mutator operator, allows for a much wider and flexible search space; e.g., over all possible python functions within a certain FLOP budget, eliminating the need for manually constructed search spaces. In addition, these pipelines will be biased towards meaningful activation functions, given their ability to represent common knowledge, leading to a potentially more efficient search of the space. The second observation is that, through this framework, one can target not only performance improvements but also activation functions that encode particular inductive biases. This can be done by using performance on out-of-distribution data as a fitness function, reflecting the degree to which the architecture respects the inherent structure in the data in a manner independent of distribution shifts. We carry an empirical exploration of this proposal and show that relatively small scale synthetic datasets can be sufficient for AlphaEvolve to discover meaningful activations.
format Preprint
id arxiv_https___arxiv_org_abs_2602_05688
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Mining Generalizable Activation Functions
Vitvitskyi, Alex
Boratko, Michael
Grcic, Matej
Pascanu, Razvan
Shah, Deep
Veličković, Petar
Machine Learning
Artificial Intelligence
The choice of activation function is an active area of research, with different proposals aimed at improving optimization, while maintaining expressivity. Additionally, the activation function can significantly alter the implicit inductive bias of the architecture, controlling its non-linear behavior. In this paper, in line with previous work, we argue that evolutionary search provides a useful framework for finding new activation functions, while we also make two novel observations. The first is that modern pipelines, such as AlphaEvolve, which relies on frontier LLMs as a mutator operator, allows for a much wider and flexible search space; e.g., over all possible python functions within a certain FLOP budget, eliminating the need for manually constructed search spaces. In addition, these pipelines will be biased towards meaningful activation functions, given their ability to represent common knowledge, leading to a potentially more efficient search of the space. The second observation is that, through this framework, one can target not only performance improvements but also activation functions that encode particular inductive biases. This can be done by using performance on out-of-distribution data as a fitness function, reflecting the degree to which the architecture respects the inherent structure in the data in a manner independent of distribution shifts. We carry an empirical exploration of this proposal and show that relatively small scale synthetic datasets can be sufficient for AlphaEvolve to discover meaningful activations.
title Mining Generalizable Activation Functions
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2602.05688