Breaking the conventional forward-backward tie in neural networks: Activation functions

Gradient-based neural network training traditionally enforces symmetry between forward and backward propagation, requiring activation functions to be differentiable (or sub-differentiable) and strictly monotonic in certain regions to prevent flat gradient areas. This symmetry, linking forward activations closely to backward gradients, significantly restricts the selection of activation functions, particularly excluding those with substantial flat or non-differentiable regions. In this paper, we challenge this assumption through mathematical analysis, demonstrating that precise gradient magnitudes derived from activation functions are largely redundant, provided the gradient direction is preserved. Empirical experiments conducted on foundational architectures—such as Multi-Layer Perceptrons (MLPs), Convolutional Neural Networks (CNNs), and Binary Neural Networks (BNNs)—confirm that relaxing forward-backward symmetry and substituting traditional gradients with simpler or stochastic alternatives does not impair learning and may even enhance training stability and efficiency. We explicitly demonstrate that neural networks with flat or non-differentiable activation functions, such as the Heaviside step function, can be effectively trained, thereby expanding design flexibility and computational efficiency. Further empirical validation with more complex architectures remains a valuable direction for future research. • The study challenges the conventional link between the forward and backward propagation in gradient-based learning, particularly focusing on activation functions. • Introduced alternative gradient functions (constant, rectangular, triangular, noisy) to replace traditional activation function derivatives. • Achieved comparable performance with untied configurations in neural network training, validated on MLPs and CNNs . • Enabled efficient training of Binary Neural Networks (BNNs) using step activation functions and alternative gradients. • Opened avenues for custom backward gradient designs to improve accuracy and adaptability in diverse neural architectures.

Authors

Institutions

Publication Details

Journal
Neurocomputing
Published
2025-08-11
DOI
https://doi.org/10.1016/j.neucom.2025.131178
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Breaking the conventional forward-backward tie in neural networks: Activation functions

Francesco Gissi, Luigi Troiano, V. Benedetto, Genny Tortora
Neurocomputing
Neural Networks and Applications
article

Breaking the conventional forward-backward tie in neural networks: Activation functions

Francesco Gissi, Luigi Troiano, V. Benedetto, Genny Tortora
article en

Abstract

Gradient-based neural network training traditionally enforces symmetry between forward and backward propagation, requiring activation functions to be differentiable (or sub-differentiable) and strictly monotonic in certain regions to prevent flat gradient areas. This symmetry, linking forward activations closely to backward gradients, significantly restricts the selection of activation functions, particularly excluding those with substantial flat or non-differentiable regions. In this paper, we challenge this assumption through mathematical analysis, demonstrating that precise gradient magnitudes derived from activation functions are largely redundant, provided the gradient direction is preserved. Empirical experiments conducted on foundational architectures—such as Multi-Layer Perceptrons (MLPs), Convolutional Neural Networks (CNNs), and Binary Neural Networks (BNNs)—confirm that relaxing forward-backward symmetry and substituting traditional gradients with simpler or stochastic alternatives does not impair learning and may even enhance training stability and efficiency. We explicitly demonstrate that neural networks with flat or non-differentiable activation functions, such as the Heaviside step function, can be effectively trained, thereby expanding design flexibility and computational efficiency. Further empirical validation with more complex architectures remains a valuable direction for future research. • The study challenges the conventional link between the forward and backward propagation in gradient-based learning, particularly focusing on activation functions. • Introduced alternative gradient functions (constant, rectangular, triangular, noisy) to replace traditional activation function derivatives. • Achieved comparable performance with untied configurations in neural network training, validated on MLPs and CNNs . • Enabled efficient training of Binary Neural Networks (BNNs) using step activation functions and alternative gradients. • Opened avenues for custom backward gradient designs to improve accuracy and adaptability in diverse neural architectures.

NeurocomputingVol. 654
University of Salerno (IT), University of Sannio (IT)
Openalex Percentile: Top 89%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.