Rethinking Neural Nonlinearity as Gating

# Rethinking Neural Nonlinearity as Gating
Source: [https://arxiv.org/abs/2607.03148](https://arxiv.org/abs/2607.03148)
[View PDF](https://arxiv.org/pdf/2607.03148)

> Abstract:Activation functions are considered an essential primitive for neural nonlinearity, i\.e\., they enable neural networks to serve as universal approximators\. In this paper, we show that this nonlinearity can also be achieved by input\-conditioned threshold gating through branches as a universal primitive\. We demonstrate that standard activations \-\- whether piecewise\-linear \(ReLU, PReLU, Hardtanh\) or smooth \(SiLU, Sigmoid, Tanh, GELU\) \-\- are in fact instances of a single Threshold Gating \(TG\) primitive\. For softmax, we show that it admits an exact TG conversion via its equivalent per\-element Sigmoid form\. We then validate these equivalences by converting pretrained networks across CNNs, transformer\-based models, and recurrent architectures, preserving model performance without requiring retraining\. Threshold Gating also enables training from scratch that goes beyond replacing existing activations, enabling gains in model compression, performance, and shorter training\. We also propose a 'Minimal Branch Theorem' which relates the minimum number of required branches in our primitive to the trainability of general deep neural networks\. In terms of hardware implementation, TG maps to a unified implementation in the case of analog in\-memory systems, addressing the bottleneck of analog\-to\-digital and digital\-to\-analog converters \(ADC/DAC\) that is known to significantly impact power consumption and on\-chip area\.

## Submission history

From: Muhammad Sabih \[[view email](https://arxiv.org/show-email/e7765490/2607.03148)\] **\[v1\]**Fri, 3 Jul 2026 09:38:16 UTC \(44 KB\)