Rectifier (neural networks)

<h2 id="advantages">Advantages</h2>
Advantages of ReLU include:

<ul><li><a href="/facts/Sparse_matrix/FFtN0XjR">Sparse</a> activation: for example, in a <a href="/facts/Weight_initialization/Mbk2jy1V">randomly initialized</a> network, only about 50% of <a href="/facts/Hidden_layer/uKzUskIX">hidden units</a> are activated (i.e. have a non-zero output).</li>
<li>Better gradient propagation: fewer <a href="/facts/Vanishing_gradient_problem/3hteovPr">vanishing gradient</a> problems compared to sigmoidal activation functions that saturate in both directions.<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a></li>
<li>Efficiency: only requires comparison and addition.</li>
<li>Scale-invariant (<a href="/facts/Homogeneous_function/wF9XX7s5">homogeneous</a>):</li></ul>

max
 (
 0
 ,
 a
 x
 )
 =
 a
 max
 (
 0
 ,
 x
 )
 
  for 
 
 a
 ≥
 0
 
 
 {\displaystyle \max(0,ax)=a\max(0,x){\text{ for }}a\geq 0}
 
.
<h2 id="potential-problems">Potential problems</h2>
Possible downsides can include:

<ul><li>Non-differentiability at zero (however, it is differentiable anywhere else, and the value of the <a href="/facts/Derivative/7Ito70Dh">derivative</a> at zero can be chosen to be 0 or 1 arbitrarily).</li>
<li>Not zero-centered: ReLU outputs are always non-negative. This can make it harder for the network to learn during backpropagation, because gradient updates tend to push weights in one direction (positive or negative). <a href="/facts/Batch_normalization/KCGIfhh6">Batch normalization</a> can help address this.</li>
<li>ReLU is unbounded.</li>
<li>Dying ReLU: ReLU neurons can sometimes be pushed into states in which they become inactive for essentially all inputs. In this state, no gradients flow backward through the neuron, and so the neuron becomes stuck in a perpetually inactive state (it "dies"). This is a form of the <a href="/facts/Vanishing_gradient_problem/3hteovPr">vanishing gradient problem</a>. In some cases, large numbers of neurons in a network can become stuck in dead states, effectively decreasing the model capacity and potentially even halting the learning process. This problem typically arises when the learning rate is set too high. It may be mitigated by using "leaky" ReLU instead, where a small positive slope is assigned for 
 
 
 
 x
 <
 0
 
 
 {\displaystyle x<0}
 
. However, depending on the task, performance may be reduced.</li></ul>
<h2 id="variants">Variants</h2>
<h3>Piecewise-linear variants</h3>
Leaky ReLU allows a small, positive gradient when the unit is inactive,<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a> helping to mitigate the vanishing gradient problem. This gradient is defined by a parameter 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
, typically set to 0.01–0.3.<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a><a class="footnote-ref" id="fnref:20" href="#fn:20">20</a>

f
        (
        x
        )
        =
        
          
            {
            
              
                
                  x
                
                
                  x
                  >
                  0
                  ,
                
              
              
                
                  α
                  x
                
                
                  x
                  ≤
                  0
                  ,
                
              
            
            
          
        
        
        
          f
          ′
        
        (
        x
        )
        =
        
          
            {
            
              
                
                  1
                
                
                  x
                  >
                  0
                  ,
                
              
              
                
                  α
                
                
                  x
                  ≤
                  0.
                
              
            
            
          
        
      
    
    {\displaystyle f(x)={\begin{cases}x&x>0,\\\alpha x&x\leq 0,\end{cases}}\qquad f'(x)={\begin{cases}1&x>0,\\\alpha &x\leq 0.\end{cases}}}

The same function can also be expressed without the piecewise notation as:

f
        (
        x
        )
        =
        
          
            
              1
              +
              α
            
            2
          
        
        x
        +
        
          
            
              1
              −
              α
            
            2
          
        
        
          |
        
        x
        
          |
        
      
    
    {\displaystyle f(x)={\frac {1+\alpha }{2}}x+{\frac {1-\alpha }{2}}|x|}

Parametric ReLU (PReLU) takes this idea further by making 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
 a learnable parameter along with the other network parameters.<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a>
Note that for 
 
 
 
 α
 ≤
 1
 
 
 {\displaystyle \alpha \leq 1}
 
, this is equivalent to

f
        (
        x
        )
        =
        max
        (
        x
        ,
        α
        x
        )
      
    
    {\displaystyle f(x)=\max(x,\alpha x)}

and thus has a relation to "maxout" networks.<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a>
Concatenated ReLU (CReLU) preserves positive and negative phase information:<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a>

f
        (
        x
        )
        =
        [
        ReLU
        ⁡
        (
        x
        )
        ,
        ReLU
        ⁡
        (
        −
        x
        )
        ]
        .
      
    
    {\displaystyle f(x)=[\operatorname {ReLU} (x),\operatorname {ReLU} (-x)].}

<h3>Other non-linear variants</h3>
<h4>DELU</h4>
ExtendeD Exponential Linear Unit (DELU) is an activation function which is smoother within the neighborhood of zero and sharper for bigger values, allowing better allocation of neurons in the learning process for higher performance. Thanks to its unique design, it has been shown that DELU may obtain higher classification accuracy than ReLU and ELU.<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a>

f
        (
        x
        )
        =
        
          
            {
            
              
                
                  x
                
                
                  x
                  >
                  
                    x
                    
                      c
                    
                  
                  ,
                
              
              
                
                  (
                  
                    e
                    
                      a
                      x
                    
                  
                  −
                  1
                  )
                  
                    /
                  
                  b
                
                
                  x
                  ≤
                  
                    x
                    
                      c
                    
                  
                
              
            
            
          
        
        
        
          f
          ′
        
        (
        x
        )
        =
        
          
            {
            
              
                
                  1
                
                
                  x
                  >
                  
                    x
                    
                      c
                    
                  
                  ,
                
              
              
                
                  (
                  a
                  
                    /
                  
                  b
                  )
                  
                    e
                    
                      a
                      x
                    
                  
                
                
                  x
                  ≤
                  
                    x
                    
                      c
                    
                  
                
              
            
            
          
        
      
    
    {\displaystyle f(x)={\begin{cases}x&x>x_{c},\\(e^{ax}-1)/b&x\leq x_{c}\end{cases}}\qquad f'(x)={\begin{cases}1&x>x_{c},\\(a/b)e^{ax}&x\leq x_{c}\end{cases}}}

In these formulas, 
 
 
 
 a
 
 
 {\displaystyle a}
 
, 
 
 
 
 b
 
 
 {\displaystyle b}
 
 and 
 
 
 
 
 x
 
 c
 
 
 
 
 {\displaystyle x_{c}}
 
 are <a href="/facts/Hyperparameter_(machine_learning)/jCxm3fTA">hyperparameter</a> values which could be set as default constraints 
 
 
 
 a
 =
 1
 
 
 {\displaystyle a=1}
 
, 
 
 
 
 b
 =
 2
 
 
 {\displaystyle b=2}
 
 and 
 
 
 
 
 x
 
 c
 
 
 =
 1.25643
 
 
 {\displaystyle x_{c}=1.25643}
 
, as done in the original work.

<h4>Gaussian-error linear unit (GELU)</h4>
GELU is a smooth approximation to the rectifier:

f
        (
        x
        )
        =
        x
        Φ
        (
        x
        )
        ,
      
    
    {\displaystyle f(x)=x\Phi (x),}

f
          ′
        
        (
        x
        )
        =
        x
        
          Φ
          ′
        
        (
        x
        )
        +
        Φ
        (
        x
        )
      
    
    {\displaystyle f'(x)=x\Phi '(x)+\Phi (x)}

where 
 
 
 
 Φ
 (
 x
 )
 =
 P
 (
 X
 ⩽
 x
 )
 
 
 {\displaystyle \Phi (x)=P(X\leqslant x)}
 
 is the <a href="/facts/Cumulative_distribution_function/WaKU8tp4">cumulative distribution function</a> of the standard <a href="/facts/Normal_distribution/UapjjPyQ">normal distribution</a>.
This activation function is illustrated in the figure at the start of this article. It has a "bump" to the left of x < 0 and serves as the default activation for models such as <a href="/facts/BERT_(language_model)/rDSueM4E">BERT</a>.<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a>

<h4>SiLU</h4>
Main article: <a href="/facts/Swish_function/fV16oGCE">Swish function</a>
The SiLU (sigmoid linear unit) or <a href="/facts/Swish_function/fV16oGCE">swish function</a><a class="footnote-ref" id="fnref:26" href="#fn:26">26</a> is another smooth approximation which uses the <a href="/facts/Sigmoid_function/lAXu3AwW">sigmoid function</a>, first introduced in the GELU paper:<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a>

f
        (
        x
        )
        =
        x
        ⋅
        sigmoid
        ⁡
        (
        x
        )
        ,
      
    
    {\displaystyle f(x)=x\cdot \operatorname {sigmoid} (x),}

f
          ′
        
        (
        x
        )
        =
        x
        ⋅
        
          sigmoid
          ′
        
        ⁡
        (
        x
        )
        +
        sigmoid
        ⁡
        (
        x
        )
      
    
    {\displaystyle f'(x)=x\cdot \operatorname {sigmoid} '(x)+\operatorname {sigmoid} (x)}

<h4>Softplus</h4>
Main article: <a href="/facts/Softplus/pwzdU9jF">Softplus</a>
A smooth approximation to the rectifier is the <a href="/facts/Analytic_function/JhL3z8FP">analytic function</a>

f
        (
        x
        )
        =
        ln
        ⁡
        (
        1
        +
        
          e
          
            x
          
        
        )
        ,
        
        
          f
          ′
        
        (
        x
        )
        =
        
          
            
              e
              
                x
              
            
            
              1
              +
              
                e
                
                  x
                
              
            
          
        
        =
        
          
            1
            
              1
              +
              
                e
                
                  −
                  x
                
              
            
          
        
      
    
    {\displaystyle f(x)=\ln(1+e^{x}),\qquad f'(x)={\frac {e^{x}}{1+e^{x}}}={\frac {1}{1+e^{-x}}}}

which is called the softplus<a class="footnote-ref" id="fnref:28" href="#fn:28">28</a><a class="footnote-ref" id="fnref:29" href="#fn:29">29</a> or SmoothReLU function.<a class="footnote-ref" id="fnref:30" href="#fn:30">30</a> For large negative 
 
 
 
 x
 
 
 {\displaystyle x}
 
 it is roughly 
 
 
 
 ln
 ⁡
 1
 
 
 {\displaystyle \ln 1}
 
, so just above 0, while for large positive 
 
 
 
 x
 
 
 {\displaystyle x}
 
 it is roughly 
 
 
 
 ln
 ⁡
 (
 
 e
 
 x
 
 
 )
 
 
 {\displaystyle \ln(e^{x})}
 
, so just above 
 
 
 
 x
 
 
 {\displaystyle x}
 
. 
This function can be approximated as:

ln
        ⁡
        
          (
          
            1
            +
            
              e
              
                x
              
            
          
          )
        
        ≈
        
          
            {
            
              
                
                  ln
                  ⁡
                  2
                  ,
                
                
                  x
                  =
                  0
                  ,
                
              
              
                
                  
                    
                      x
                      
                        1
                        −
                        
                          e
                          
                            −
                            x
                            
                              /
                            
                            ln
                            ⁡
                            2
                          
                        
                      
                    
                  
                  ,
                
                
                  x
                  ≠
                  0
                
              
            
            
          
        
      
    
    {\displaystyle \ln \left(1+e^{x}\right)\approx {\begin{cases}\ln 2,&x=0,\\[6pt]{\frac {x}{1-e^{-x/\ln 2}}},&x\neq 0\end{cases}}}

By making the change of variables 
 
 
 
 x
 =
 y
 ln
 ⁡
 (
 2
 )
 
 
 {\displaystyle x=y\ln(2)}
 
, this is equivalent to

log
          
            2
          
        
        ⁡
        (
        1
        +
        
          2
          
            y
          
        
        )
        ≈
        
          
            {
            
              
                
                  1
                  ,
                
                
                  y
                  =
                  0
                  ,
                
              
              
                
                  
                    
                      y
                      
                        1
                        −
                        
                          e
                          
                            −
                            y
                          
                        
                      
                    
                  
                  ,
                
                
                  y
                  ≠
                  0
                
              
            
            
          
        
      
    
    {\displaystyle \log _{2}(1+2^{y})\approx {\begin{cases}1,&y=0,\\[6pt]{\frac {y}{1-e^{-y}}},&y\neq 0\end{cases}}}

A sharpness parameter 
 
 
 
 k
 
 
 {\displaystyle k}
 
 may be included:

f
        (
        x
        )
        =
        
          
            
              ln
              ⁡
              (
              1
              +
              
                e
                
                  k
                  x
                
              
              )
            
            k
          
        
        ,
        
        
          f
          ′
        
        (
        x
        )
        =
        
          
            
              e
              
                k
                x
              
            
            
              1
              +
              
                e
                
                  k
                  x
                
              
            
          
        
        =
        
          
            1
            
              1
              +
              
                e
                
                  −
                  k
                  x
                
              
            
          
        
      
    
    {\displaystyle f(x)={\frac {\ln(1+e^{kx})}{k}},\qquad f'(x)={\frac {e^{kx}}{1+e^{kx}}}={\frac {1}{1+e^{-kx}}}}

The derivative of softplus is the <a href="/facts/Logistic_function/IaQ254t7">logistic function</a>.
The logistic <a href="/facts/Sigmoid_function/lAXu3AwW">sigmoid function</a> is a smooth approximation of the derivative of the rectifier, the <a href="/facts/Heaviside_step_function/bgsUtxgP">Heaviside step function</a>.
The multivariable generalization of single-variable softplus is the <a href="/facts/LogSumExp/m6jQDk1a">LogSumExp</a> with the first argument set to zero:

L
            S
            
              E
              
                0
              
            
          
          
            +
          
        
        ⁡
        (
        
          x
          
            1
          
        
        ,
        …
        ,
        
          x
          
            n
          
        
        )
        :=
        LSE
        ⁡
        (
        0
        ,
        
          x
          
            1
          
        
        ,
        …
        ,
        
          x
          
            n
          
        
        )
        =
        ln
        ⁡
        (
        1
        +
        
          e
          
            
              x
              
                1
              
            
          
        
        +
        ⋯
        +
        
          e
          
            
              x
              
                n
              
            
          
        
        )
      
    
    {\displaystyle \operatorname {LSE_{0}} ^{+}(x_{1},\dots ,x_{n}):=\operatorname {LSE} (0,x_{1},\dots ,x_{n})=\ln(1+e^{x_{1}}+\cdots +e^{x_{n}})}

The LogSumExp function is

LSE
        ⁡
        (
        
          x
          
            1
          
        
        ,
        …
        ,
        
          x
          
            n
          
        
        )
        =
        ln
        ⁡
        (
        
          e
          
            
              x
              
                1
              
            
          
        
        +
        ⋯
        +
        
          e
          
            
              x
              
                n
              
            
          
        
        )
      
    
    {\displaystyle \operatorname {LSE} (x_{1},\dots ,x_{n})=\ln(e^{x_{1}}+\cdots +e^{x_{n}})}

and its gradient is the <a href="/facts/Softmax_function/pvxeWV6L">softmax</a>; the softmax with the first argument set to zero is the multivariable generalization of the logistic function. Both LogSumExp and softmax are used in machine learning.

<h4>ELU</h4>
Exponential linear units try to make the mean activations closer to zero, which speeds up learning. It has been shown that ELUs can obtain higher classification accuracy than ReLUs.<a class="footnote-ref" id="fnref:31" href="#fn:31">31</a>

f
        (
        x
        )
        =
        
          
            {
            
              
                
                  x
                
                
                  x
                  >
                  0
                  ,
                
              
              
                
                  α
                  
                    (
                    
                      
                        e
                        
                          x
                        
                      
                      −
                      1
                    
                    )
                  
                
                
                  x
                  ≤
                  0
                
              
            
            
          
        
        
        
          f
          ′
        
        (
        x
        )
        =
        
          
            {
            
              
                
                  1
                
                
                  x
                  >
                  0
                  ,
                
              
              
                
                  α
                  
                    e
                    
                      x
                    
                  
                
                
                  x
                  ≤
                  0
                
              
            
            
          
        
      
    
    {\displaystyle f(x)={\begin{cases}x&x>0,\\\alpha \left(e^{x}-1\right)&x\leq 0\end{cases}}\qquad f'(x)={\begin{cases}1&x>0,\\\alpha e^{x}&x\leq 0\end{cases}}}

In these formulas, 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
 is a <a href="/facts/Hyperparameter_(machine_learning)/jCxm3fTA">hyperparameter</a> to be tuned with the constraint 
 
 
 
 α
 ≥
 0
 
 
 {\displaystyle \alpha \geq 0}
 
.
Given the same interpretation of 
 
 
 
 α
 
 
 {\displaystyle \alpha }
 
, ELU can be viewed as a smoothed version of a shifted ReLU (SReLU), which has the form 
 
 
 
 f
 (
 x
 )
 =
 max
 (
 −
 α
 ,
 x
 )
 
 
 {\displaystyle f(x)=\max(-\alpha ,x)}
 
.

<h4>Mish</h4>
The mish function can also be used as a smooth approximation of the rectifier.<a class="footnote-ref" id="fnref:32" href="#fn:32">32</a> It is defined as

f
        (
        x
        )
        =
        x
        tanh
        ⁡
        
          
            (
          
        
        softplus
        ⁡
        (
        x
        )
        
          
            )
          
        
        ,
      
    
    {\displaystyle f(x)=x\tanh {\big (}\operatorname {softplus} (x){\big )},}

where 
 
 
 
 tanh
 ⁡
 (
 x
 )
 
 
 {\displaystyle \tanh(x)}
 
 is the <a href="/facts/Hyperbolic_tangent/Y4Cb5S35">hyperbolic tangent</a>, and 
 
 
 
 softplus
 ⁡
 (
 x
 )
 
 
 {\displaystyle \operatorname {softplus} (x)}
 
 is the <a href="/facts/Softplus/pwzdU9jF">softplus</a> function.
Mish is non-<a href="/facts/Monotonic/MjQK0YL2">monotonic</a> and self-gated.<a class="footnote-ref" id="fnref:33" href="#fn:33">33</a> It was inspired by <a href="/facts/Swish_(function)/fV16oGCE">Swish</a>, itself a variant of <a href="/facts/ReLU/pwzdU9jF">ReLU</a>.<a class="footnote-ref" id="fnref:34" href="#fn:34">34</a>

<h4>Squareplus</h4>
Squareplus<a class="footnote-ref" id="fnref:35" href="#fn:35">35</a> is the function

f
        (
        x
        )
        =
        
          
            
              x
              +
              
                
                  
                    x
                    
                      2
                    
                  
                  +
                  b
                
              
            
            2
          
        
      
    
    {\displaystyle f(x)={\frac {x+{\sqrt {x^{2}+b}}}{2}}}

where 
 
 
 
 b
 ≥
 0
 
 
 {\displaystyle b\geq 0}
 
 is a hyperparameter that determines the "size" of the curved region near 
 
 
 
 x
 =
 0
 
 
 {\displaystyle x=0}
 
. (For example, letting 
 
 
 
 b
 =
 0
 
 
 {\displaystyle b=0}
 
 yields ReLU, and letting 
 
 
 
 b
 =
 4
 
 
 {\displaystyle b=4}
 
 yields the <a href="/facts/Metallic_mean/smIrlKVk">metallic mean</a> function.)
Squareplus shares many properties with softplus: It is <a href="/facts/Monotonic_function/MjQK0YL2">monotonic</a>, strictly <a href="/facts/Positive_(mathematics)/z0xollg1">positive</a>, approaches 0 as 
 
 
 
 x
 →
 −
 ∞
 
 
 {\displaystyle x\to -\infty }
 
, approaches the identity as 
 
 
 
 x
 →
 +
 ∞
 
 
 {\displaystyle x\to +\infty }
 
, and is 
 
 
 
 
 C
 
 ∞
 
 
 
 
 {\displaystyle C^{\infty }}
 
 <a href="/facts/Smooth_function/mffL4ch2">smooth</a>. However, squareplus can be computed using only <a href="/facts/Algebraic_functions/yT7EKmwF">algebraic functions</a>, making it well-suited for settings where computational resources or instruction sets are limited. Additionally, squareplus requires no special consideration to ensure numerical stability when 
 
 
 
 x
 
 
 {\displaystyle x}
 
 is large.

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Softmax_function/pvxeWV6L">Softmax function</a></li>
<li><a href="/facts/Sigmoid_function/lAXu3AwW">Sigmoid function</a></li>
<li><a href="/facts/Tobit_model/zmA78XSR">Tobit model</a></li>
<li><a href="/facts/Layer_(deep_learning)/cKFbI4GF">Layer (deep learning)</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Brownlee, Jason (8 January 2019). "A Gentle Introduction to the Rectified Linear Unit (ReLU)". Machine Learning Mastery. Retrieved 8 April 2021. <a href="https://machinelearningmastery.com/rectified-linear-activation-function-for-deep-learning-neural-networks/" target="_blank">https://machinelearningmastery.com/rectified-linear-activation-function-for-deep-learning-neural-networks/</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Liu, Danqing (30 November 2017). "A Practical Guide to ReLU". Medium. Retrieved 8 April 2021. <a href="https://medium.com/@danqing/a-practical-guide-to-relu-b83ca804f1f7" target="_blank">https://medium.com/@danqing/a-practical-guide-to-relu-b83ca804f1f7</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Ramachandran, Prajit; Barret, Zoph; Quoc, V. Le (October 16, 2017). "Searching for Activation Functions". arXiv:1710.05941 [cs.NE]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Xavier Glorot; Antoine Bordes; Yoshua Bengio (2011). Deep sparse rectifier neural networks (PDF). AISTATS. Rectifier and softplus activation functions. The second one is a smooth version of the first. <a href="/wiki/Yoshua_Bengio" target="_blank">/wiki/Yoshua_Bengio</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">László Tóth (2013). Phone Recognition with Deep Sparse Rectifier Neural Networks (PDF). ICASSP. <a href="http://www.inf.u-szeged.hu/~tothl/pubs/ICASSP2013.pdf" target="_blank">http://www.inf.u-szeged.hu/~tothl/pubs/ICASSP2013.pdf</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Andrew L. Maas, Awni Y. Hannun, Andrew Y. Ng (2014). Rectifier Nonlinearities Improve Neural Network Acoustic Models. <a href="https://ai.stanford.edu/~amaas/papers/relu_hybrid_icml2013_final.pdf" target="_blank">https://ai.stanford.edu/~amaas/papers/relu_hybrid_icml2013_final.pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Hansel, D.; van Vreeswijk, C. (2002). "How noise contributes to contrast invariance of orientation tuning in cat visual cortex". J. Neurosci. 22 (12): 5118–5128. doi:10.1523/JNEUROSCI.22-12-05118.2002. PMC 6757721. PMID 12077207. <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6757721" target="_blank">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6757721</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Kadmon, Jonathan; Sompolinsky, Haim (2015-11-19). "Transition to Chaos in Random Neuronal Networks". Physical Review X. 5 (4): 041030. arXiv:1508.06486. Bibcode:2015PhRvX...5d1030K. doi:10.1103/PhysRevX.5.041030. S2CID 7813832. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Engelken, Rainer; Wolf, Fred; Abbott, L. F. (2020-06-03). "Lyapunov spectra of chaotic recurrent neural networks". arXiv:2006.02427 [nlin.CD]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Householder, Alston S. (June 1941). "A theory of steady-state activity in nerve-fiber networks: I. Definitions and preliminary lemmas". The Bulletin of Mathematical Biophysics. 3 (2): 63–69. doi:10.1007/BF02478220. ISSN 0007-4985. <a href="http://link.springer.com/10.1007/BF02478220" target="_blank">http://link.springer.com/10.1007/BF02478220</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Fukushima, K. (1969). "Visual feature extraction by a multilayered network of analog threshold elements". IEEE Transactions on Systems Science and Cybernetics. 5 (4): 322–333. doi:10.1109/TSSC.1969.300225. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Fukushima, K.; Miyake, S. (1982). "Neocognitron: A Self-Organizing Neural Network Model for a Mechanism of Visual Pattern Recognition". Competition and Cooperation in Neural Nets. Lecture Notes in Biomathematics. Vol. 45. Springer. pp. 267–285. doi:10.1007/978-3-642-46466-9_18. ISBN 978-3-540-11574-8. {{cite book}}: |journal= ignored (help) <a href="978-3-540-11574-8" target="_blank">978-3-540-11574-8</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Hahnloser, R.; Sarpeshkar, R.; Mahowald, M. A.; Douglas, R. J.; Seung, H. S. (2000). "Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit". Nature. 405 (6789): 947–951. Bibcode:2000Natur.405..947H. doi:10.1038/35016072. PMID 10879535. S2CID 4399014. <a href="/wiki/Nature_(journal)" target="_blank">/wiki/Nature_(journal)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Hahnloser, R.; Seung, H. S. (2001). Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks. NIPS 2001. <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">Xavier Glorot; Antoine Bordes; Yoshua Bengio (2011). Deep sparse rectifier neural networks (PDF). AISTATS. Rectifier and softplus activation functions. The second one is a smooth version of the first. <a href="/wiki/Yoshua_Bengio" target="_blank">/wiki/Yoshua_Bengio</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">Yann LeCun; Leon Bottou; Genevieve B. Orr; Klaus-Robert Müller (1998). "Efficient BackProp" (PDF). In G. Orr; K. Müller (eds.). Neural Networks: Tricks of the Trade. Springer. <a href="/wiki/Yann_LeCun" target="_blank">/wiki/Yann_LeCun</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Xavier Glorot; Antoine Bordes; Yoshua Bengio (2011). Deep sparse rectifier neural networks (PDF). AISTATS. Rectifier and softplus activation functions. The second one is a smooth version of the first. <a href="/wiki/Yoshua_Bengio" target="_blank">/wiki/Yoshua_Bengio</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Andrew L. Maas, Awni Y. Hannun, Andrew Y. Ng (2014). Rectifier Nonlinearities Improve Neural Network Acoustic Models. <a href="https://ai.stanford.edu/~amaas/papers/relu_hybrid_icml2013_final.pdf" target="_blank">https://ai.stanford.edu/~amaas/papers/relu_hybrid_icml2013_final.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">"PyTorch Leaky ReLU docs". <a href="https://pytorch.org/docs/stable/generated/torch.nn.LeakyReLU.html" target="_blank">https://pytorch.org/docs/stable/generated/torch.nn.LeakyReLU.html</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">"TensorFlow Leaky ReLU docs". <a href="https://www.tensorflow.org/api_docs/python/tf/keras/layers/LeakyReLU" target="_blank">https://www.tensorflow.org/api_docs/python/tf/keras/layers/LeakyReLU</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">He, Kaiming; Zhang, Xiangyu; Ren, Shaoqing; Sun, Jian (2015). "Delving Deep into Rectifiers: Surpassing Human-Level Performance on Image Net Classification". arXiv:1502.01852 [cs.CV]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">He, Kaiming; Zhang, Xiangyu; Ren, Shaoqing; Sun, Jian (2015). "Delving Deep into Rectifiers: Surpassing Human-Level Performance on Image Net Classification". arXiv:1502.01852 [cs.CV]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Shang, Wenling; Sohn, Kihyuk; Almeida, Diogo; Lee, Honglak (2016-06-11). "Understanding and Improving Convolutional Neural Networks via Concatenated Rectified Linear Units". Proceedings of the 33rd International Conference on Machine Learning. PMLR: 2217–2225. arXiv:1603.05201. <a href="https://proceedings.mlr.press/v48/shang16.html" target="_blank">https://proceedings.mlr.press/v48/shang16.html</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Çatalbaş, Burak; Morgül, Ömer (16 August 2023). "Deep learning with ExtendeD Exponential Linear Unit (DELU)". Neural Computing and Applications. 35 (30): 22705–22724. Retrieved 20 April 2025. <a href="https://link.springer.com/article/10.1007/s00521-023-08932-z" target="_blank">https://link.springer.com/article/10.1007/s00521-023-08932-z</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Hendrycks, Dan; Gimpel, Kevin (2016). "Gaussian Error Linear Units (GELUs)". arXiv:1606.08415 [cs.LG]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Diganta Misra (23 Aug 2019), Mish: A Self Regularized Non-Monotonic Activation Function (PDF), arXiv:1908.08681v1, retrieved 26 March 2022. <a href="https://www.bmvc2020-conference.com/assets/papers/0928.pdf" target="_blank">https://www.bmvc2020-conference.com/assets/papers/0928.pdf</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">Hendrycks, Dan; Gimpel, Kevin (2016). "Gaussian Error Linear Units (GELUs)". arXiv:1606.08415 [cs.LG]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">Dugas, Charles; Bengio, Yoshua; Bélisle, François; Nadeau, Claude; Garcia, René (2000-01-01). "Incorporating second-order functional knowledge for better option pricing" (PDF). Proceedings of the 13th International Conference on Neural Information Processing Systems (NIPS'00). MIT Press: 451–457. Since the sigmoid h has a positive first derivative, its primitive, which we call softplus, is convex. <a href="http://papers.nips.cc/paper/1920-incorporating-second-order-functional-knowledge-for-better-option-pricing.pdf" target="_blank">http://papers.nips.cc/paper/1920-incorporating-second-order-functional-knowledge-for-better-option-pricing.pdf</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
<li id="fn:29">Xavier Glorot; Antoine Bordes; Yoshua Bengio (2011). Deep sparse rectifier neural networks (PDF). AISTATS. Rectifier and softplus activation functions. The second one is a smooth version of the first. <a href="/wiki/Yoshua_Bengio" target="_blank">/wiki/Yoshua_Bengio</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></li>
<li id="fn:30">"Smooth Rectifier Linear Unit (SmoothReLU) Forward Layer". Developer Guide for Intel Data Analytics Acceleration Library. 2017. Retrieved 2018-12-04. <a href="https://software.intel.com/sites/products/documentation/doclib/daal/daal-user-and-reference-guides/daal_prog_guide/GUID-FAC73B9B-A597-4F7D-A5C4-46707E4A92A0.htm" target="_blank">https://software.intel.com/sites/products/documentation/doclib/daal/daal-user-and-reference-guides/daal_prog_guide/GUID-FAC73B9B-A597-4F7D-A5C4-46707E4A92A0.htm</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></li>
<li id="fn:31">Clevert, Djork-Arné; Unterthiner, Thomas; Hochreiter, Sepp (2015). "Fast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)". arXiv:1511.07289 [cs.LG]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></li>
<li id="fn:32">Diganta Misra (23 Aug 2019), Mish: A Self Regularized Non-Monotonic Activation Function (PDF), arXiv:1908.08681v1, retrieved 26 March 2022. <a href="https://www.bmvc2020-conference.com/assets/papers/0928.pdf" target="_blank">https://www.bmvc2020-conference.com/assets/papers/0928.pdf</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></li>
<li id="fn:33">Shaw, Sweta (2020-05-10). "Activation Functions Compared with Experiments". W&B. Retrieved 2022-07-11. <a href="https://wandb.ai/shweta/Activation%20Functions/reports/Activation-Functions-Compared-with-Experiments--VmlldzoxMDQwOTQ" target="_blank">https://wandb.ai/shweta/Activation%20Functions/reports/Activation-Functions-Compared-with-Experiments--VmlldzoxMDQwOTQ</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></li>
<li id="fn:34">Shaw, Sweta (2020-05-10). "Activation Functions Compared with Experiments". W&B. Retrieved 2022-07-11. <a href="https://wandb.ai/shweta/Activation%20Functions/reports/Activation-Functions-Compared-with-Experiments--VmlldzoxMDQwOTQ" target="_blank">https://wandb.ai/shweta/Activation%20Functions/reports/Activation-Functions-Compared-with-Experiments--VmlldzoxMDQwOTQ</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></li>
<li id="fn:35">Barron, Jonathan T. (22 December 2021). "Squareplus: A Softplus-Like Algebraic Rectifier". arXiv:2112.11687 [cs.NE]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></li>
</ol>

Rectifier (neural networks) open-in-new

Rectifier (neural networks)