<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ojs</journal-id>
      <journal-title-group>
        <journal-title>Open Journal of Statistics</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2161-7198</issn>
      <issn pub-type="ppub">2161-718X</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ojs.2026.165024</article-id>
      <article-id pub-id-type="publisher-id">ojs-154967</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Physics</subject>
          <subject>Mathematics</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>A Note on Link Functions in Generalized Linear Models and Activation Functions in Deep Learning: An Alternative Activation Function</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Nawata</surname>
            <given-names>Kazumitsu</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> University of Tokyo, Bunkyo-ku, Tokyo, Japan </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The author declares no conflicts of interest regarding the publication of this note.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>08</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <volume>16</volume>
      <issue>05</issue>
      <fpage>513</fpage>
      <lpage>523</lpage>
      <history>
        <date date-type="received">
          <day>26</day>
          <month>09</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>26</day>
          <month>10</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>29</day>
          <month>10</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ojs.2026.165024">https://doi.org/10.4236/ojs.2026.165024</self-uri>
      <abstract>
        <p>The generalized linear model (GLM) is widely used in econometrics and statistics. In a GLM, a location parameter of the dependent variable—typically the expected value or mean—is linked to a linear combination of independent variables through a link function. The choice of link function is determined by the distribution of the error term. In contrast, activation functions are used in the convolutional layers of deep learning (DL) models. Common activation functions include the indicator (step) function, sigmoid, rectified linear unit (ReLU), and leaky ReLU. Although the universal approximation theorem shows that DL models using these activation functions can approximate a wide class of functions, major challenges remain, including overfitting, local minima, and substantial computational requirements. It is therefore essential to select an appropriate activation function. Link functions in GLMs and activation functions in DL are closely related and often coincide. In this note, we examine the similarities between these functions and propose an activation function derived from the truncated mean. We focus on the theoretical and methodological aspects rather than practical applications. The relationship between link functions and activation functions remains conjectural and warrants further research.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Generalized Linear Model</kwd>
        <kwd>Deep Learning</kwd>
        <kwd>Activation Function</kwd>
        <kwd>ReLU</kwd>
        <kwd>Tobit Model</kwd>
        <kwd>Truncated Mean</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Generalized linear models (GLMs) are widely used for data analysis in econometrics and statistics [<xref ref-type="bibr" rid="B2">2</xref>]-[<xref ref-type="bibr" rid="B6">6</xref>]. In a GLM, a location parameter (usually the expected value or mean) of a dependent variable is linked to a linear combination of independent variables through a link function. The choice of link function is determined by either the underlying error distribution (such as logistic, Poisson, gamma, or inverse-gamma) or the observational structure (such as censoring or truncation).</p>
      <p>In contrast, activation functions are used in deep learning (DL) models [<xref ref-type="bibr" rid="B7">7</xref>][<xref ref-type="bibr" rid="B8">8</xref>]. Certain DL architectures typically consist of two types of layers: convolutional and pooling. Nawata [<xref ref-type="bibr" rid="B9">9</xref>][<xref ref-type="bibr" rid="B10">10</xref>] proposed the grouping-adjusted median estimator (GAME). However, GAME focuses mainly on the pooling stage, and activation functions in the convolutional stage have not been fully examined. Common activation functions include the step (or indicator) function used in threshold models [<xref ref-type="bibr" rid="B11">11</xref>]-[<xref ref-type="bibr" rid="B14">14</xref>], the sigmoid function [<xref ref-type="bibr" rid="B15">15</xref>]-[<xref ref-type="bibr" rid="B18">18</xref>], the rectified linear unit (ReLU) [<xref ref-type="bibr" rid="B19">19</xref>]-[<xref ref-type="bibr" rid="B24">24</xref>], and the leaky ReLU [<xref ref-type="bibr" rid="B25">25</xref>]-[<xref ref-type="bibr" rid="B29">29</xref>]. Although the universal approximation theorem [<xref ref-type="bibr" rid="B30">30</xref>]-[<xref ref-type="bibr" rid="B33">33</xref>] shows that most functions can be approximated using these activation functions in DL models, several major challenges remain, including overfitting, multiple local minima, and substantial computational requirements.</p>
      <p>These issues become particularly serious in large language models (LLMs), which may contain trillions of unknown parameters due to their numerous layers and nodes (neurons). Selecting an appropriate activation function is therefore critical. Link functions and activation functions are closely related and often coincide. In this note, we examine the similarities between these functions and propose an alternative activation function derived from the conditional expectation (truncated mean) of a truncated model. Our focus is on the theoretical and methodological aspects rather than practical applications.</p>
    </sec>
    <sec id="sec2">
      <title>2. Link and Activation Functions</title>
      <p>In this note, we consider the expected value (hereafter, the mean) and other location parameters, such as the median. Following Nawata [<xref ref-type="bibr" rid="B34">34</xref>], the GLM is specified as</p>
      <disp-formula id="FD1">
        <label>(1)</label>
        <mml:math>
          <mml:mrow>
            <mml:msubsup>
              <mml:mi>y</mml:mi>
              <mml:mi>i</mml:mi>
              <mml:mtext>*</mml:mtext>
            </mml:msubsup>
            <mml:mo>=</mml:mo>
            <mml:msub>
              <mml:msup>
                <mml:mi>x</mml:mi>
                <mml:mo>′</mml:mo>
              </mml:msup>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mi>β</mml:mi>
            <mml:mo>+</mml:mo>
            <mml:msub>
              <mml:mi>u</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <disp-formula id="FD2">
        <mml:math>
          <mml:mrow>
            <mml:msub>
              <mml:mi>y</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>g</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msubsup>
                  <mml:mi>y</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mtext>*</mml:mtext>
                </mml:msubsup>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mtext> * </mml:mtext></mml:msubsup></mml:mrow></mml:math></inline-formula> is an unobserved latent variable, and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is an observed dependent variable. <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mi> β </mml:mi></mml:math></inline-formula> are vectors of independent variables (including a constant term) and unknown parameters, respectively, and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is an error term. <inline-formula><mml:math><mml:mrow><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a monotonically increasing function such that <inline-formula><mml:math><mml:mrow><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> z </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> ≥ </mml:mo><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> z </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> if <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> z </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> ≥ </mml:mo><mml:msub><mml:mi> z </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> . If it is not uniformly monotonically increasing, we consider a local interval in which <inline-formula><mml:math><mml:mrow><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is monotonic. If it is monotonically decreasing, we use <inline-formula><mml:math><mml:mrow><mml:mo> − </mml:mo><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . Let <inline-formula><mml:math><mml:mi> ℒ </mml:mi></mml:math></inline-formula> denote a function that gives a suitable location parameter of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
      <p>Usually, we consider the mean,</p>
      <disp-formula id="FD3">
        <label>(2)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>ℒ</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mi>E</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>y</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:msub>
              <mml:mi>E</mml:mi>
              <mml:mi>u</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>{</mml:mo>
              <mml:mrow>
                <mml:mi>g</mml:mi>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:msubsup>
                      <mml:mi>y</mml:mi>
                      <mml:mi>i</mml:mi>
                      <mml:mtext>*</mml:mtext>
                    </mml:msubsup>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>}</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> E </mml:mi><mml:mi> u </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denotes the expected value with respect to <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , and <inline-formula><mml:math><mml:mi> ℒ </mml:mi></mml:math></inline-formula> depends on the distribution of the error term. However, when the median is used as the location parameter, we obtain </p>
      <disp-formula id="FD4">
        <label>(3)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>ℒ</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>y</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mi>M</mml:mi>
            <mml:mi>e</mml:mi>
            <mml:mi>d</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>y</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mi>M</mml:mi>
            <mml:mi>e</mml:mi>
            <mml:mi>d</mml:mi>
            <mml:mrow>
              <mml:mo>{</mml:mo>
              <mml:mrow>
                <mml:mi>g</mml:mi>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:msubsup>
                      <mml:mi>y</mml:mi>
                      <mml:mi>i</mml:mi>
                      <mml:mtext>*</mml:mtext>
                    </mml:msubsup>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>}</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mi>g</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><inline-formula><mml:math><mml:mrow><mml:mi> M </mml:mi><mml:mi> e </mml:mi><mml:mi> d </mml:mi></mml:mrow></mml:math></inline-formula> denotes the median with respect to the error term. The result does not depend on the distribution of the error term, provided that its median is zero. In this sense, the estimator is robust. </p>
      <p>In the binary response model, <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> takes the value 0 or 1 and is given by <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> y </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mtext> * </mml:mtext></mml:msubsup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:msup><mml:mi> x </mml:mi><mml:mo> ′ </mml:mo></mml:msup><mml:mi> i </mml:mi></mml:msub><mml:mi> β </mml:mi><mml:mo> + </mml:mo><mml:msub><mml:mi> u </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . We obtain</p>
      <disp-formula id="FD5">
        <label>(4)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>ℒ</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>y</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mrow>
              <mml:mo>{</mml:mo>
              <mml:mrow>
                <mml:mtable columnalign="left">
                  <mml:mtr columnalign="left">
                    <mml:mtd columnalign="left">
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>E</mml:mi>
                          <mml:mi>u</mml:mi>
                        </mml:msub>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>y</mml:mi>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                        <mml:mo>=</mml:mo>
                        <mml:mi>F</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:msub>
                              <mml:msup>
                                <mml:mi>x</mml:mi>
                                <mml:mo>′</mml:mo>
                              </mml:msup>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                            <mml:mi>β</mml:mi>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mtd>
                    <mml:mtd columnalign="left">
                      <mml:mrow>
                        <mml:mtext>for the mean</mml:mtext>
                      </mml:mrow>
                    </mml:mtd>
                  </mml:mtr>
                  <mml:mtr columnalign="left">
                    <mml:mtd columnalign="left">
                      <mml:mrow>
                        <mml:mn>1</mml:mn>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:msub>
                              <mml:msup>
                                <mml:mi>x</mml:mi>
                                <mml:mo>′</mml:mo>
                              </mml:msup>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                            <mml:mi>β</mml:mi>
                            <mml:mo>&gt;</mml:mo>
                            <mml:mn>0</mml:mn>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mtd>
                    <mml:mtd columnalign="left">
                      <mml:mrow>
                        <mml:mtext>for the median</mml:mtext>
                      </mml:mrow>
                    </mml:mtd>
                  </mml:mtr>
                </mml:mtable>
              </mml:mrow>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Here, <inline-formula><mml:math><mml:mrow><mml:mn> 1 </mml:mn><mml:mrow><mml:mo> ( </mml:mo><mml:mi> A </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the indicator function, which takes the value 1 if <inline-formula><mml:math><mml:mi> A </mml:mi></mml:math></inline-formula> is true and 0 otherwise, and <inline-formula><mml:math><mml:mi> F </mml:mi></mml:math></inline-formula> is the distribution function of <inline-formula><mml:math><mml:mrow><mml:mo> − </mml:mo><mml:msub><mml:mi> u </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> . Assuming a distribution symmetric about zero, we treat <inline-formula><mml:math><mml:mi> F </mml:mi></mml:math></inline-formula> as the distribution function of <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> itself. Under the standard logistic distribution,</p>
      <disp-formula id="FD6">
        <label>(5)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>F</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>z</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mfrac>
              <mml:mrow>
                <mml:mtext>exp</mml:mtext>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mi>z</mml:mi>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mrow>
                <mml:mn>1</mml:mn>
                <mml:mo>+</mml:mo>
                <mml:mtext>exp</mml:mtext>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mi>z</mml:mi>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
            </mml:mfrac>
            <mml:mo>,</mml:mo>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>we obtain the logit model. </p>
      <p>When the median is used, the model becomes semiparametric. No specific distribution function is required, and the resulting estimator is robust. However, Nawata [<xref ref-type="bibr" rid="B35">35</xref>] showed that such robust estimators cannot be <inline-formula><mml:math><mml:mrow><mml:msqrt><mml:mi> n </mml:mi></mml:msqrt></mml:mrow></mml:math></inline-formula> -consistent and are less efficient than the maximum likelihood estimator (MLE) in the binary response model.</p>
      <p>These link functions are similar to the activation functions <inline-formula><mml:math><mml:mrow><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> used in DL. The step function in threshold models is equivalent to the indicator function in the median case. However, threshold models and their corresponding activation function have a major drawback: the derivative is zero except at the jump discontinuity, causing backpropagation to fail and making optimization difficult. This is consistent with the inefficiency of the median estimator in the binary response model. The sigmoid function corresponds to the logistic distribution function. Even when the sigmoid function is used as an activation function, the vanishing gradient problem—in which the derivative approaches zero—makes learning extremely slow and computationally expensive.</p>
      <p>For censored regression or Tobit models, <inline-formula><mml:math><mml:mrow><mml:mi> g </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mtext> max </mml:mtext><mml:mrow><mml:mo> { </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mi> z </mml:mi></mml:mrow><mml:mo> } </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and</p>
      <disp-formula id="FD7">
        <label>(6)</label>
        <mml:math>
          <mml:mrow>
            <mml:msub>
              <mml:mi>y</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>g</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
                <mml:mo>+</mml:mo>
                <mml:msub>
                  <mml:mi>u</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mtext>max</mml:mtext>
            <mml:mrow>
              <mml:mo>{</mml:mo>
              <mml:mrow>
                <mml:mn>0</mml:mn>
                <mml:mo>,</mml:mo>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
                <mml:mo>+</mml:mo>
                <mml:msub>
                  <mml:mi>u</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>}</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>The MLE, which assumes a specific distribution for the error term (usually normal or logistic), is widely used in these models. However, it is inconsistent when the distribution is misspecified. Powell [<xref ref-type="bibr" rid="B36">36</xref>] considers the least absolute deviations estimator (PLAD), which minimizes</p>
      <disp-formula id="FD8">
        <label>(7)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:mi>S</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mstyle displaystyle="true">
              <mml:msubsup>
                <mml:mo>∑</mml:mo>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mo>=</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mi>n</mml:mi>
              </mml:msubsup>
              <mml:mrow>
                <mml:mrow>
                  <mml:mo>|</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>y</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                    <mml:mo>−</mml:mo>
                    <mml:mtext>max</mml:mtext>
                    <mml:mrow>
                      <mml:mo>{</mml:mo>
                      <mml:mrow>
                        <mml:mn>0</mml:mn>
                        <mml:mo>,</mml:mo>
                        <mml:msub>
                          <mml:msup>
                            <mml:mi>x</mml:mi>
                            <mml:mo>′</mml:mo>
                          </mml:msup>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                        <mml:mi>β</mml:mi>
                      </mml:mrow>
                      <mml:mo>}</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>|</mml:mo>
                </mml:mrow>
              </mml:mrow>
            </mml:mstyle>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>PLAD is the GLM estimator that uses the median as the location parameter and is consistent when the median of the error term is zero. Its drawbacks are that (i) multiple local minima make the estimator difficult to compute (Nawata [<xref ref-type="bibr" rid="B37">37</xref>]) and (ii) its asymptotic variance is much larger than that of the MLE, making it inefficient. </p>
      <p>In DL, the ReLU function,</p>
      <disp-formula id="FD9">
        <label>(8)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>h</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mtext>max</mml:mtext>
            <mml:mrow>
              <mml:mo>{</mml:mo>
              <mml:mrow>
                <mml:mn>0</mml:mn>
                <mml:mo>,</mml:mo>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
              </mml:mrow>
              <mml:mo>}</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>is widely used as an activation function, corresponding to the GLM link function when the error term has a median of zero. Its derivative satisfies <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> z </mml:mi></mml:mrow></mml:mrow><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> if <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> z </mml:mi><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula><inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> h </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> z </mml:mi></mml:mrow></mml:mrow><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> if <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> z </mml:mi><mml:mo> &lt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> ; the function is not differentiable at <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> z </mml:mi><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> . This means that (i) information from observations with <inline-formula><mml:math><mml:mrow><mml:msub><mml:msup><mml:mi> x </mml:mi><mml:mo> ′ </mml:mo></mml:msup><mml:mi> i </mml:mi></mml:msub><mml:mi> β </mml:mi><mml:mo> &lt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> is used only through their sign, (ii) the first derivative is discontinuous and jumps at zero, and (iii) the second derivative is zero at any differentiable point. Lin <italic>et al.</italic> ([<xref ref-type="bibr" rid="B38">38</xref>], p. 2) state “ReLU-based functions that eliminate negative values appear to constrain representational capacity in ANNs”. By analogy with PLAD, problems of multiple local minima are expected. These issues make computation difficult, especially during backpropagation. Therefore, alternatives such as sigmoid linear unit (SiLU or Swish) [<xref ref-type="bibr" rid="B39">39</xref>], leaky ReLU, softplus [<xref ref-type="bibr" rid="B40">40</xref>], and Gaussian error linear units (GELUs) [<xref ref-type="bibr" rid="B41">41</xref>] functions are also used, as they have been reported to improve performance [<xref ref-type="bibr" rid="B39">39</xref>]. The leaky ReLU function is,</p>
      <disp-formula id="FD10">
        <label>(9)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>h</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>a</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mtext>max</mml:mtext>
            <mml:mrow>
              <mml:mo>{</mml:mo>
              <mml:mrow>
                <mml:mi>a</mml:mi>
                <mml:mo>⋅</mml:mo>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:msub>
                  <mml:msup>
                    <mml:mi>x</mml:mi>
                    <mml:mo>′</mml:mo>
                  </mml:msup>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mi>β</mml:mi>
              </mml:mrow>
              <mml:mo>}</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>where <inline-formula><mml:math><mml:mi> a </mml:mi></mml:math></inline-formula> is a small positive constant. The derivative is 1 for <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> z </mml:mi><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mi> a </mml:mi></mml:math></inline-formula> for <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> z </mml:mi><mml:mo> &lt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> . However, the modifications (including other functions previously described) are ad hoc and lack theoretical justification. Moreover, the derivative remains discontinuous at zero, and the fundamental problems of the ReLU function persist. As in the binary case, it is natural to consider the mean.</p>
    </sec>
    <sec id="sec3">
      <title>3. Modification of the ReLU Function Based on the Truncated Mean</title>
      <sec id="sec3dot1">
        <title>3.1. Truncated Mean</title>
        <p>The ReLU function is closely related to the link function in GLMs that use the median as a location parameter. However, this approach has the limitations described in the previous section. In binary models, taking the mean of a binary variable under a logistic error distribution yields the sigmoid function. We therefore consider the mean of the ReLU function with an error term, given by</p>
        <disp-formula id="FD11">
          <label>(10)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:msup>
                      <mml:mi>x</mml:mi>
                      <mml:mo>′</mml:mo>
                    </mml:msup>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mi>β</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>σ</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>E</mml:mi>
                <mml:mi>u</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mi>max</mml:mi>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:mn>0</mml:mn>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:msup>
                          <mml:mi>x</mml:mi>
                          <mml:mo>′</mml:mo>
                        </mml:msup>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mi>β</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mi>u</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                  <mml:mo>|</mml:mo>
                  <mml:msubsup>
                    <mml:mi>y</mml:mi>
                    <mml:mi>i</mml:mi>
                    <mml:mo>*</mml:mo>
                  </mml:msubsup>
                  <mml:mo>&gt;</mml:mo>
                  <mml:mn>0</mml:mn>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> follows the normal distribution with mean zero and variance <inline-formula><mml:math><mml:mrow><mml:msup><mml:mi> σ </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math><mml:mrow><mml:mi> N </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:msup><mml:mi> σ </mml:mi><mml:mn> 2 </mml:mn></mml:msup></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> .</p>
        <p>Considering the truncated mean when <inline-formula><mml:math><mml:mrow><mml:msub><mml:msup><mml:mi> x </mml:mi><mml:mo> ′ </mml:mo></mml:msup><mml:mi> i </mml:mi></mml:msub><mml:mi> β </mml:mi><mml:mo> + </mml:mo><mml:msub><mml:mi> u </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> (the truncated case in GLMs; Amemiya ([<xref ref-type="bibr" rid="B42">42</xref>], pp. 366-373)), we obtain</p>
        <disp-formula id="FD12">
          <label>(11)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:msup>
                      <mml:mi>x</mml:mi>
                      <mml:mo>′</mml:mo>
                    </mml:msup>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mi>β</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>σ</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:msup>
                  <mml:mi>x</mml:mi>
                  <mml:mo>′</mml:mo>
                </mml:msup>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mi>β</mml:mi>
              <mml:mo>+</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mo>⋅</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:msup>
                      <mml:mi>x</mml:mi>
                      <mml:mo>′</mml:mo>
                    </mml:msup>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mi>α</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>where <inline-formula><mml:math><mml:mrow><mml:mi> ϕ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> Φ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are the density and distribution functions of the standard normal distribution, respectively, and <inline-formula><mml:math><mml:mrow><mml:mi> λ </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mi> z </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the inverse of the Mills ratio. <xref ref-type="fig" rid="fig1">Figure 1</xref> shows <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> z </mml:mi><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> . It converges to <italic>z</italic> and zero as <inline-formula><mml:math><mml:mrow><mml:mi> z </mml:mi><mml:mo> → </mml:mo><mml:mi> ∞ </mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> z </mml:mi><mml:mo> → </mml:mo><mml:mo> − </mml:mo><mml:mi> ∞ </mml:mi></mml:mrow></mml:math></inline-formula> , respectively. Hereafter, we refer to the function in Equation (11) as the truncated mean function (TMF). Signals are often unobservable when they are significantly smaller than the background noise, as in astronomical or medical data, making it natural to consider truncated observations. For instance, in astronomy, a zero value at an observation point can have two different meanings. One is that there are no stars or galaxies at that location. The other is that they are present, but their signals are too weak to be detected. These two situations have very different implications for analyzing the structure of space. Therefore, it is reasonable to use only observations that exceed the observational detection limit. The estimator based on the TMF, known as Heckman’s two-step estimator [<xref ref-type="bibr" rid="B43">43</xref>][<xref ref-type="bibr" rid="B44">44</xref>], is widely used in econometrics. The TMF is infinitely differentiable for any real value of z, and its first derivative is given by</p>
        <disp-formula id="FD13">
          <label>(12)</label>
          <mml:math>
            <mml:mrow>
              <mml:mrow>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:msub>
                    <mml:mi>h</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>/</mml:mo>
                <mml:mrow>
                  <mml:mo>∂</mml:mo>
                  <mml:mi>z</mml:mi>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>−</mml:mo>
              <mml:mi>w</mml:mi>
              <mml:mo>⋅</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>w</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>−</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:msup>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>w</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:msup>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Although multicollinearity can severely affect Heckman’s two-step estimator [<xref ref-type="bibr" rid="B45">45</xref>]-[<xref ref-type="bibr" rid="B47">47</xref>], this issue does not occur when the TMF is used as an activation function. </p>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/1242057-rId139.jpeg?20261029033125" />
        </fig>
        <p>Figure 1. <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> z </mml:mi><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
        <p><xref ref-type="fig" rid="fig2">Figure 2</xref> shows <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mrow><mml:mo> ∂ </mml:mo><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> z </mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> . <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mrow><mml:mo> ∂ </mml:mo><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> z </mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> converges to 1 and 0 as <inline-formula><mml:math><mml:mrow><mml:mi> z </mml:mi><mml:mo> → </mml:mo><mml:mi> ∞ </mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:mi> z </mml:mi><mml:mo> → </mml:mo><mml:mo> − </mml:mo><mml:mi> ∞ </mml:mi></mml:mrow></mml:math></inline-formula> , respectively. The first derivatives of ReLU and leaky ReLU are discontinuous at zero, and their second derivatives vanish at any differentiable point, hindering optimization. This highlights an advantage of the TMF.</p>
        <p>The TMF can approximate a piecewise-linear function or the leaky ReLU function, and vice versa. <xref ref-type="fig" rid="fig3">Figure 3</xref> and <xref ref-type="fig" rid="fig4">Figure 4</xref> show the zero-adjusted TMF with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow></mml:math></inline-formula> and 0.5, respectively, together with the corresponding leaky ReLU functions. The zero-adjusted TMF equals zero at <inline-formula><mml:math><mml:mrow><mml:mi> z </mml:mi><mml:mo> = </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> . The correlation coefficients between the paired functions over (−3, 3) are 0.9996 and 0.9957, respectively. Consequently,</p>
        <disp-formula id="FD14">
          <label>(13)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>z</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>σ</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>z</mml:mi>
              <mml:mo>+</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mo>⋅</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>z</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD15">
          <mml:math>
            <mml:mrow>
              <mml:msubsup>
                <mml:mi>h</mml:mi>
                <mml:mi>t</mml:mi>
                <mml:mtext>*</mml:mtext>
              </mml:msubsup>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>z</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>σ</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>z</mml:mi>
              <mml:mo>+</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mo>⋅</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mi>z</mml:mi>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>−</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mo>⋅</mml:mo>
              <mml:mi>λ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mn>0</mml:mn>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>z</mml:mi>
              <mml:mo>+</mml:mo>
              <mml:mi>σ</mml:mi>
              <mml:mo>⋅</mml:mo>
              <mml:mrow>
                <mml:mo>{</mml:mo>
                <mml:mrow>
                  <mml:mi>λ</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>z</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mn>0.7979</mml:mn>
                </mml:mrow>
                <mml:mo>}</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>may serve as better activation functions than the leaky ReLU functions. This fact gives rise to the hypothesis that the leaky ReLU and other alternatives might improve the performance because they are approximations of the TMF. </p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/1242057-rId161.jpeg?20261029033125" />
        </fig>
        <p>Figure 2. <inline-formula><mml:math><mml:mrow><mml:mrow><mml:mrow><mml:mo> ∂ </mml:mo><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mo> ∂ </mml:mo><mml:mi> z </mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
        <fig id="fig3">
          <label>Figure 3</label>
          <graphic xlink:href="https://html.scirp.org/file/1242057-rId166.jpeg?20261029033125" />
        </fig>
        <p>Figure 3. The function <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> z </mml:mi><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> − </mml:mo><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.1 </mml:mn></mml:mrow></mml:math></inline-formula> and values fitted using the leaky ReLU function.</p>
        <fig id="fig4">
          <label>Figure 4</label>
          <graphic xlink:href="https://html.scirp.org/file/1242057-rId171.jpeg?20261029033125" />
        </fig>
        <p>Figure 4. The function <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> z </mml:mi><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> − </mml:mo><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 0 </mml:mn><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 0.5 </mml:mn></mml:mrow></mml:math></inline-formula> and values fitted using the leaky ReLU function.</p>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Logistic Distribution</title>
        <p>We focus on the normal distribution because of its widespread use and well-established properties. However, the logistic distribution function can also be used. The standard logistic distribution has a standard deviation of 1.814. <xref ref-type="fig" rid="fig5">Figure 5</xref> shows the TMF for the normal distribution with parameter <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1.814 </mml:mn></mml:mrow></mml:math></inline-formula> alongside that for the standard logistic distribution, suggesting that the two functions can be used interchangeably with similar effects.</p>
        <fig id="fig5">
          <label>Figure 5</label>
          <graphic xlink:href="https://html.scirp.org/file/1242057-rId178.jpeg?20261029033126" />
        </fig>
        <p>Figure 5. Truncated mean values for the logistic and normal distributions with scale parameter <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1.814 </mml:mn></mml:mrow></mml:math></inline-formula> .</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Censored Mean</title>
        <p>In the previous section, we considered the truncated mean conditional on <inline-formula><mml:math><mml:mrow><mml:msubsup><mml:mi> y </mml:mi><mml:mi> i </mml:mi><mml:mtext> * </mml:mtext></mml:msubsup><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> . We can also consider the censored mean, or the unconditional expected value in the censored model, given by</p>
        <disp-formula id="FD16">
          <label>(14)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mi>c</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:msup>
                      <mml:mi>x</mml:mi>
                      <mml:mo>′</mml:mo>
                    </mml:msup>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mi>β</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>σ</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>E</mml:mi>
                <mml:mi>u</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:mi>max</mml:mi>
                  <mml:mrow>
                    <mml:mo>{</mml:mo>
                    <mml:mrow>
                      <mml:mn>0</mml:mn>
                      <mml:mo>,</mml:mo>
                      <mml:msub>
                        <mml:msup>
                          <mml:mi>x</mml:mi>
                          <mml:mo>′</mml:mo>
                        </mml:msup>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mi>β</mml:mi>
                      <mml:mo>+</mml:mo>
                      <mml:msub>
                        <mml:mi>u</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>}</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mi>Φ</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:msub>
                        <mml:msup>
                          <mml:mi>x</mml:mi>
                          <mml:mo>′</mml:mo>
                        </mml:msup>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mi>β</mml:mi>
                    </mml:mrow>
                    <mml:mo>/</mml:mo>
                    <mml:mi>σ</mml:mi>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>⋅</mml:mo>
              <mml:msub>
                <mml:mi>h</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:msup>
                      <mml:mi>x</mml:mi>
                      <mml:mo>′</mml:mo>
                    </mml:msup>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mi>β</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>σ</mml:mi>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>This formulation is rarely used, and its properties in GLMs have not been fully investigated. <xref ref-type="fig" rid="fig6">Figure 6</xref> shows <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> t </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> z </mml:mi><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math><mml:mrow><mml:msub><mml:mi> h </mml:mi><mml:mi> c </mml:mi></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mi> z </mml:mi><mml:mo> , </mml:mo><mml:mi> σ </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math><mml:mrow><mml:mi> σ </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow></mml:math></inline-formula> . In the negative domain, the censored mean function declines rapidly, and the value of <inline-formula><mml:math><mml:mi> a </mml:mi></mml:math></inline-formula> becomes extremely close to zero when the function is approximated using a leaky ReLU function. Although this function could be a candidate activation function, we do not analyze its properties further in this note.</p>
        <fig id="fig6">
          <label>Figure 6</label>
          <graphic xlink:href="https://html.scirp.org/file/1242057-rId193.jpeg?20261029033126" />
        </fig>
        <p>Figure 6. Truncated and censored mean values.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Conclusions</title>
      <p>Link functions in GLMs and activation functions in the convolutional layers of DL share important similarities. In this note, we demonstrated that GLM link functions correspond to the activation functions used in binary models. The step function in threshold models is equivalent to the indicator function in the median case. The sigmoid function represents the mean of the indicator function under the assumption that the error term in the GLM follows a logistic distribution.</p>
      <p>When the ReLU function is used, the model corresponds to the median regression model in GLMs. Its disadvantages include the fact that observations in the negative region have no effect and its first derivative takes only the values zero or one, complicating optimization. Powell [<xref ref-type="bibr" rid="B36">36</xref>] proposed the least absolute deviations estimator, but estimation remains difficult because of differentiability issues and multiple local minima. Although the leaky ReLU function is also used, it lacks theoretical justification, and computational challenges persist.</p>
      <p>To address these issues, we propose using the TMF as an alternative activation function, derived by applying a truncated normal model. The TMF is widely used in GLMs, such as in Heckman’s two-step estimator [<xref ref-type="bibr" rid="B43">43</xref>][<xref ref-type="bibr" rid="B44">44</xref>]. It is infinitely differentiable, and its second derivative is non-zero at any point, which may facilitate optimization. It is also well approximated by the leaky ReLU function.</p>
      <p>The relationship between link functions and activation functions remains an open question. Evaluating the performance of the TMF in DL models is both necessary and compelling, representing an important direction for future research that will be highly valuable for advancing DL methodology. In this note, we focus on the theoretical and methodological aspects, leaving practical applications for future work.</p>
    </sec>
    <sec id="sec5">
      <title>Acknowledgements</title>
      <p>The author would like to thank an anonymous referee for his/her helpful comments and suggestions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">McCullagh, P. and Nelder, J.A. (1989) Generalized Linear Models. Second Edition, Chapman &amp; Hall.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>McCullagh, P.</string-name>
              <string-name>Nelder, J.A.</string-name>
              <string-name>Edition, C</string-name>
            </person-group>
            <year>1989</year>
            <article-title>Generalized Linear Models</article-title>
            <source>Second Edition</source>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Olsson, U. (2002) Generalized Linear Models, an Applied Approach. Studentlitteratur.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Olsson, U.</string-name>
            </person-group>
            <year>2002</year>
            <article-title>Generalized Linear Models, an Applied Approach</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Islam, M.A. and Biswas, S.C. (2025) Generalized Linear Models and Extensions. Springer Nature.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Islam, M.A.</string-name>
              <string-name>Biswas, S.C.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Generalized Linear Models and Extensions</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Wood, S.N. (2025) Generalized Additive Models. <italic>Annual Review of Statistics and Its Application</italic>, 12, 497-526. https://doi.org/10.1146/annurev-statistics-112723-034249 <pub-id pub-id-type="doi">10.1146/annurev-statistics-112723-034249</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1146/annurev-statistics-112723-034249">https://doi.org/10.1146/annurev-statistics-112723-034249</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Wood, S.N.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Generalized Additive Models</article-title>
            <source>Annual Review of Statistics and Its Application</source>
            <volume>12</volume>
            <pub-id pub-id-type="doi">10.1146/annurev-statistics-112723-034249</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Correia, S., Guimarães, P. and Zylkin, T. (2026) Verifying the Existence of Maximum Likelihood Estimates for Generalized Linear Models. <italic>Econometric Reviews</italic>, 45, 1270-1305. https://doi.org/10.1080/07474938.2026.2673989 <pub-id pub-id-type="doi">10.1080/07474938.2026.2673989</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/07474938.2026.2673989">https://doi.org/10.1080/07474938.2026.2673989</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Correia, S.</string-name>
              <string-name>Zylkin, T.</string-name>
            </person-group>
            <year>2026</year>
            <article-title>Verifying the Existence of Maximum Likelihood Estimates for Generalized Linear Models</article-title>
            <source>Econometric Reviews</source>
            <volume>45</volume>
            <pub-id pub-id-type="doi">10.1080/07474938.2026.2673989</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Dubey, S.R., Singh, S.K. and Chaudhuri, B.B. (2022) Activation Functions in Deep Learning: A Comprehensive Survey and Benchmark. <italic>Neurocomputing</italic>, 503, 92-108. https://doi.org/10.1016/j.neucom.2022.06.111 <pub-id pub-id-type="doi">10.1016/j.neucom.2022.06.111</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.neucom.2022.06.111">https://doi.org/10.1016/j.neucom.2022.06.111</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Dubey, S.R.</string-name>
              <string-name>Singh, S.K.</string-name>
              <string-name>Chaudhuri, B.B.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Activation Functions in Deep Learning: A Comprehensive Survey and Benchmark</article-title>
            <source>Neurocomputing</source>
            <volume>503</volume>
            <pub-id pub-id-type="doi">10.1016/j.neucom.2022.06.111</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bishop, C.M. and Bishop, H. (2024) Deep Learning: Foundation and Concepts. Springer.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bishop, C.M.</string-name>
              <string-name>Bishop, H.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Deep Learning: Foundation and Concepts</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Nawata, K. (1990) Robust Estimation Based on Grouped-Adjusted Data in Censored Regression Models. <italic>Journal of Econometrics</italic>, 43, 337-362. https://doi.org/10.1016/0304-4076(90)90124-c <pub-id pub-id-type="doi">10.1016/0304-4076(90)90124-c</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0304-4076(90)90124-c">https://doi.org/10.1016/0304-4076(90)90124-c</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
            </person-group>
            <year>1990</year>
            <article-title>Robust Estimation Based on Grouped-Adjusted Data in Censored Regression Models</article-title>
            <source>Journal of Econometrics</source>
            <volume>4076</volume>
            <issue>90</issue>
            <pub-id pub-id-type="doi">10.1016/0304-4076(90)90124-c</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Nawata, K. (2026) Estimating the Rectified Linear Unit Activation Function in Deep Learning Using the Grouping-Adjusted Median Estimator: An Evaluation of Max Pooling. <italic>Open Jou</italic><italic>rnal of Statistics</italic>, 16, 1-15. https://doi.org/10.4236/ojs.2026.161001 <pub-id pub-id-type="doi">10.4236/ojs.2026.161001</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4236/ojs.2026.161001">https://doi.org/10.4236/ojs.2026.161001</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
            </person-group>
            <year>2026</year>
            <article-title>Estimating the Rectified Linear Unit Activation Function in Deep Learning Using the Grouping-Adjusted Median Estimator: An Evaluation of Max Pooling</article-title>
            <source>Open Journal of Statistics</source>
            <volume>16</volume>
            <pub-id pub-id-type="doi">10.4236/ojs.2026.161001</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Behboodi, A., Rauhut, H. and Schnoor, E. (2020) Generalization Bounds for Deep Thresholding Networks. https://arxiv.org/abs/2010.15658v1</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Behboodi, A.</string-name>
              <string-name>Rauhut, H.</string-name>
              <string-name>Schnoor, E.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Generalization Bounds for Deep Thresholding Networks</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Imaizumi, M. and Schmidt-Hieber, J. (2023) On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization. <italic>IEEE Transactions on Information Theor</italic><italic>y</italic>, 69, 1203-1223. https://doi.org/10.1109/tit.2022.3215088 <pub-id pub-id-type="doi">10.1109/tit.2022.3215088</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tit.2022.3215088">https://doi.org/10.1109/tit.2022.3215088</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Imaizumi, M.</string-name>
              <string-name>Schmidt-Hieber, J.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization</article-title>
            <source>IEEE Transactions on Information Theory</source>
            <volume>69</volume>
            <pub-id pub-id-type="doi">10.1109/tit.2022.3215088</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Ergen, T., Gulluk, H.I., Lacotte, J. and Pilanci, M. (2023) Globally Optimal Training of Neural Networks with Threshold Activation Functions. https://arxiv.org/abs/2303.03382</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Ergen, T.</string-name>
              <string-name>Gulluk, H.I.</string-name>
              <string-name>Lacotte, J.</string-name>
              <string-name>Pilanci, M.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>Globally Optimal Training of Neural Networks with Threshold Activation Functions</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Dhayalkar, S.R. (2025) Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory. https://arxiv.org/abs/2505.11694</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Dhayalkar, S.R.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Rumelhart, D.E., Hinton, G.E. and Williams, R.J. (1986) Learning Representations by Back-Propagating Errors. <italic>Nature</italic>, 323, 533-536. https://doi.org/10.1038/323533a0 <pub-id pub-id-type="doi">10.1038/323533a0</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/323533a0">https://doi.org/10.1038/323533a0</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Rumelhart, D.E.</string-name>
              <string-name>Hinton, G.E.</string-name>
              <string-name>Williams, R.J.</string-name>
            </person-group>
            <year>1986</year>
            <article-title>Learning Representations by Back-Propagating Errors</article-title>
            <source>Nature</source>
            <volume>323</volume>
            <pub-id pub-id-type="doi">10.1038/323533a0</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Roodschild, M., Gotay Sardiñas, J. and Will, A. (2020) A New Approach for the Vanishing Gradient Problem on Sigmoid Activation. <italic>Progress in Artificial Intelligence</italic>, 9, 351-360. https://doi.org/10.1007/s13748-020-00218-y <pub-id pub-id-type="doi">10.1007/s13748-020-00218-y</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s13748-020-00218-y">https://doi.org/10.1007/s13748-020-00218-y</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Roodschild, M.</string-name>
              <string-name>Will, A.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>A New Approach for the Vanishing Gradient Problem on Sigmoid Activation</article-title>
            <source>Progress in Artificial Intelligence</source>
            <volume>9</volume>
            <pub-id pub-id-type="doi">10.1007/s13748-020-00218-y</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mulindwa, D.B. and Du, S. (2023) An N-Sigmoid Activation Function to Improve the Squeeze-And-Excitation for 2D and 3D Deep Networks. <italic>Electronics</italic>, 12, Article No. 911. https://doi.org/10.3390/electronics12040911 <pub-id pub-id-type="doi">10.3390/electronics12040911</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/electronics12040911">https://doi.org/10.3390/electronics12040911</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mulindwa, D.B.</string-name>
              <string-name>Du, S.</string-name>
            </person-group>
            <year>2023</year>
            <article-title>An N-Sigmoid Activation Function to Improve the Squeeze-And-Excitation for 2D and 3D Deep Networks</article-title>
            <source>Electronics</source>
            <volume>12</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/electronics12040911</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Huang, H., Feng, S., Li, J., Guan, T. and Zhu, H. (2025) Adaptive Belief Rule Base Modeling of Complex Industrial Systems Based on Sigmoid Functions. <italic>Entropy</italic>, 27, Article No. 1157. https://doi.org/10.3390/e27111157 <pub-id pub-id-type="doi">10.3390/e27111157</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/e27111157">https://doi.org/10.3390/e27111157</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Huang, H.</string-name>
              <string-name>Feng, S.</string-name>
              <string-name>Li, J.</string-name>
              <string-name>Guan, T.</string-name>
              <string-name>Zhu, H.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Adaptive Belief Rule Base Modeling of Complex Industrial Systems Based on Sigmoid Functions</article-title>
            <source>Entropy</source>
            <volume>27</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/e27111157</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B18">
        <label>18.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bai, Y. (2022) ReLU-Function and Derived Function Review. <italic>SHS Web of Conferences</italic>, 144, Article No. 02006. https://doi.org/10.1051/shsconf/202214402006 <pub-id pub-id-type="doi">10.1051/shsconf/202214402006</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1051/shsconf/202214402006">https://doi.org/10.1051/shsconf/202214402006</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bai, Y.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>ReLU-Function and Derived Function Review</article-title>
            <source>SHS Web of Conferences</source>
            <volume>144</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1051/shsconf/202214402006</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B19">
        <label>19.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Nworu, C.C., Ekpenyong, E.J., Chisimkwuo, J., Onyeukwu, C.N., Okwara, G. and Agwu, O.J. (2022) The Effects of Modified ReLU Activation Functions in Image Classification. <italic>Biomedical Engineering and Medical Devices</italic>, 7, Article ID: 1000237.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nworu, C.C.</string-name>
              <string-name>Ekpenyong, E.J.</string-name>
              <string-name>Chisimkwuo, J.</string-name>
              <string-name>Onyeukwu, C.N.</string-name>
              <string-name>Okwara, G.</string-name>
              <string-name>Agwu, O.J.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>The Effects of Modified ReLU Activation Functions in Image Classification</article-title>
            <source>Biomedical Engineering and Medical Devices</source>
            <volume>7</volume>
            <fpage>100023</fpage>
            <elocation-id>ID</elocation-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B20">
        <label>20.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Sooksatra, K., Hamerly, G. and Rivas, P. (2024) Is ReLU Adversarially Robust? https://arxiv.org/abs/2405.03777</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Sooksatra, K.</string-name>
              <string-name>Hamerly, G.</string-name>
              <string-name>Rivas, P.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Is ReLU Adversarially Robust? https://arxiv</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B21">
        <label>21.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Zhang, S., Lu, J. and Zhao, H. (2024) Deep Network Approximation: Beyond ReLU to Diverse. <italic>Activation Functions Journal of Machine Learning Research</italic>, 25, 1-39.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Zhang, S.</string-name>
              <string-name>Lu, J.</string-name>
              <string-name>Zhao, H.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Deep Network Approximation: Beyond ReLU to Diverse</article-title>
            <source>Activation Functions Journal of Machine Learning Research</source>
            <volume>25</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B22">
        <label>22.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Horuz, C.C., Kasenbacher, G., Higuchi, S., Kairat, S., Stoltz, J., Pesl, M., <italic>et al.</italic> (2025) The Resurrection of the ReLU. https://arxiv.org/abs/2505.22074</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Horuz, C.C.</string-name>
              <string-name>Kasenbacher, G.</string-name>
              <string-name>Higuchi, S.</string-name>
              <string-name>Kairat, S.</string-name>
              <string-name>Stoltz, J.</string-name>
              <string-name>Pesl, M.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>The Resurrection of the ReLU</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B23">
        <label>23.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Agarap, A.F. (2026) Deep Learning Using Rectified Linear Units (ReLU). https://arxiv.org/abs/1803.08375</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Agarap, A.F.</string-name>
            </person-group>
            <year>2026</year>
            <article-title>Deep Learning Using Rectified Linear Units (ReLU)</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B24">
        <label>24.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Maniatopoulos, A. and Mitianoudis, N. (2021) Learnable Leaky ReLU (LeLeLU): An Alternative Accuracy-Optimized Activation Function. <italic>Information</italic>, 12, Article No. 513. https://doi.org/10.3390/info12120513 <pub-id pub-id-type="doi">10.3390/info12120513</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/info12120513">https://doi.org/10.3390/info12120513</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Maniatopoulos, A.</string-name>
              <string-name>Mitianoudis, N.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>Learnable Leaky ReLU (LeLeLU): An Alternative Accuracy-Optimized Activation Function</article-title>
            <source>Information</source>
            <volume>12</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/info12120513</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B25">
        <label>25.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Mastromichalakis, S. (2021) ALReLU: A Different Approach on Leaky ReLU Activation Function to Improve Neural Networks Performance. https://arxiv.org/abs/2012.07564</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Mastromichalakis, S.</string-name>
            </person-group>
            <year>2021</year>
            <article-title>ALReLU: A Different Approach on Leaky ReLU Activation Function to Improve Neural Networks Performance</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B26">
        <label>26.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Frei, S., Vardi, G., Bartlett, P.L., Srebro, N. and Hu, W. (2022) Implicit Bias in Leaky ReLU Networks Trained on High-Dimensional Data. https://arxiv.org/abs/2210.07082</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Frei, S.</string-name>
              <string-name>Vardi, G.</string-name>
              <string-name>Bartlett, P.L.</string-name>
              <string-name>Srebro, N.</string-name>
              <string-name>Hu, W.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Implicit Bias in Leaky ReLU Networks Trained on High-Dimensional Data</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B27">
        <label>27.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Mujhid, A., Surono, S., Irsalinda, N. and Thobirin, A. (2022) Comparison and Combination of Leaky ReLU and ReLU Activation Function and Three Optimizers on Deep CNN for COVID-19 Detection. In: Tallón-Ballesteros, A.J., Ed., <italic>Fuzzy Systems and Data Mining VIII</italic>, IOS Press, 50-57. https://doi.org/10.3233/faia220369 <pub-id pub-id-type="doi">10.3233/faia220369</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3233/faia220369">https://doi.org/10.3233/faia220369</ext-link></mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Mujhid, A.</string-name>
              <string-name>Surono, S.</string-name>
              <string-name>Irsalinda, N.</string-name>
              <string-name>Thobirin, A.</string-name>
              <string-name>Ballesteros, A.J.</string-name>
              <string-name>VIII, I</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Comparison and Combination of Leaky ReLU and ReLU Activation Function and Three Optimizers on Deep CNN for COVID-19 Detection</article-title>
            <source>In: Tallón-Ballesteros</source>
            <volume>50</volume>
            <pub-id pub-id-type="doi">10.3233/faia220369</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B28">
        <label>28.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Neufeld, A. and Nguyen, T.A. (2026) Multilevel Picard Approximations and Deep Neural Networks with ReLU, Leaky ReLU, and Softplus Activation Overcome the Curse of Dimensionality When Approximating Semilinear Parabolic Partial Differential Equations in Lp-Sense. <italic>Journal of Computational and Applied Mathematics</italic>, 487, Article ID: 117736. https://doi.org/10.1016/j.cam.2026.117736 <pub-id pub-id-type="doi">10.1016/j.cam.2026.117736</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cam.2026.117736">https://doi.org/10.1016/j.cam.2026.117736</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Neufeld, A.</string-name>
              <string-name>Nguyen, T.A.</string-name>
              <string-name>ReLU, L</string-name>
            </person-group>
            <year>2026</year>
            <article-title>Multilevel Picard Approximations and Deep Neural Networks with ReLU, Leaky ReLU, and Softplus Activation Overcome the Curse of Dimensionality When Approximating Semilinear Parabolic Partial Differential Equations in Lp-Sense</article-title>
            <source>Journal of Computational and Applied Mathematics</source>
            <volume>487</volume>
            <fpage>117736</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.cam.2026.117736</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B29">
        <label>29.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Tikk, D., Kóczy, L.T. and Gedeon, T.D. (2003) A Survey on Universal Approximation and Its Limits in Soft Computing Techniques. <italic>International Journal of Approximate Reasoning</italic>, 33, 185-202. https://doi.org/10.1016/s0888-613x(03)00021-5 <pub-id pub-id-type="doi">10.1016/s0888-613x(03)00021-5</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/s0888-613x(03)00021-5">https://doi.org/10.1016/s0888-613x(03)00021-5</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Tikk, D.</string-name>
              <string-name>Gedeon, T.D.</string-name>
            </person-group>
            <year>2003</year>
            <article-title>A Survey on Universal Approximation and Its Limits in Soft Computing Techniques</article-title>
            <source>International Journal of Approximate Reasoning</source>
            <volume>33</volume>
            <pub-id pub-id-type="doi">10.1016/s0888-613x(03)00021-5</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B30">
        <label>30.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Kidger, P. and Lyons, T. (2020) Universal Approximation with Deep Narrow Networks. <italic>Proceedings of Machine Learning Research</italic>, 125, 1-22.</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Kidger, P.</string-name>
              <string-name>Lyons, T.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Universal Approximation with Deep Narrow Networks</article-title>
            <source>Proceedings of Machine Learning Research</source>
            <volume>125</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B31">
        <label>31.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Augustine, M.T. (2024) A Survey on Universal Approximation Theorems. https://arxiv.org/abs/2407.12895</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Augustine, M.T.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>A Survey on Universal Approximation Theorems</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B32">
        <label>32.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Kratsios, A., Cheng, T.S. and Roy, D. (2025) Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data. https://arxiv.org/abs/2509.00924</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Kratsios, A.</string-name>
              <string-name>Cheng, T.S.</string-name>
              <string-name>Roy, D.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B33">
        <label>33.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Nawata, K. (1997) Estimation of Generalised Regression Models by the Grouping Method. <italic>Mathematics and Computers in Simulation</italic>, 43, 503-510. https://doi.org/10.1016/s0378-4754(97)00038-4 <pub-id pub-id-type="doi">10.1016/s0378-4754(97)00038-4</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/s0378-4754(97)00038-4">https://doi.org/10.1016/s0378-4754(97)00038-4</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
            </person-group>
            <year>1997</year>
            <article-title>Estimation of Generalised Regression Models by the Grouping Method</article-title>
            <source>Mathematics and Computers in Simulation</source>
            <volume>4754</volume>
            <issue>97</issue>
            <pub-id pub-id-type="doi">10.1016/s0378-4754(97)00038-4</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B34">
        <label>34.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Nawata, K. (1989) Semiparametric Estimation and Efficiency Bounds of Binary Choice Models When the Models Contain One Continuous Variable. <italic>Economics Letters</italic>, 31, 21-26. https://doi.org/10.1016/0165-1765(89)90105-5 <pub-id pub-id-type="doi">10.1016/0165-1765(89)90105-5</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0165-1765(89)90105-5">https://doi.org/10.1016/0165-1765(89)90105-5</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
            </person-group>
            <year>1989</year>
            <article-title>Semiparametric Estimation and Efficiency Bounds of Binary Choice Models When the Models Contain One Continuous Variable</article-title>
            <source>Economics Letters</source>
            <volume>1765</volume>
            <issue>89</issue>
            <pub-id pub-id-type="doi">10.1016/0165-1765(89)90105-5</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B35">
        <label>35.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Powell, J.L. (1986) Censored Regression Quantiles. <italic>Journal of Econometrics</italic>, 32, 143-155. https://doi.org/10.1016/0304-4076(86)90016-3 <pub-id pub-id-type="doi">10.1016/0304-4076(86)90016-3</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0304-4076(86)90016-3">https://doi.org/10.1016/0304-4076(86)90016-3</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Powell, J.L.</string-name>
            </person-group>
            <year>1986</year>
            <article-title>Censored Regression Quantiles</article-title>
            <source>Journal of Econometrics</source>
            <volume>4076</volume>
            <issue>86</issue>
            <pub-id pub-id-type="doi">10.1016/0304-4076(86)90016-3</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B36">
        <label>36.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Nawata, K. (1994) Notes on Estimation of the Tobit Models by Powell’s Least Absolute Deviations Estimator. <italic>Economic Studies Quarterly</italic>, 45, 339-346.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
            </person-group>
            <year>1994</year>
            <article-title>Notes on Estimation of the Tobit Models by Powell’s Least Absolute Deviations Estimator</article-title>
            <source>Economic Studies Quarterly</source>
            <volume>45</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B37">
        <label>37.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Lin, W., Piao, Z. and Fung, C.C.A. (2025) Delving into Unsupervised Hebbian Learning from Artificial Intelligence Perspectives. <italic>Machine Learning and Knowledge Extraction</italic>, 7, Article No. 143. https://doi.org/10.3390/make7040143 <pub-id pub-id-type="doi">10.3390/make7040143</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/make7040143">https://doi.org/10.3390/make7040143</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Lin, W.</string-name>
              <string-name>Piao, Z.</string-name>
              <string-name>Fung, C.C.A.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>Delving into Unsupervised Hebbian Learning from Artificial Intelligence Perspectives</article-title>
            <source>Machine Learning and Knowledge Extraction</source>
            <volume>7</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.3390/make7040143</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B38">
        <label>38.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Ramachandran, P., Zoph, B. and Le, B.Q.V. (2017) Searching for Activation Functions. https://arxiv.org/abs/1710.05941</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Ramachandran, P.</string-name>
              <string-name>Zoph, B.</string-name>
              <string-name>Le, B.Q.V.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Searching for Activation Functions</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B39">
        <label>39.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhao, H., Liu, F., Li, L. and Luo, C. (2018) A Novel Softplus Linear Unit for Deep Convolutional Neural Networks. <italic>Applied Intelligence</italic>, 48, 1707-1720. https://doi.org/10.1007/s10489-017-1028-7 <pub-id pub-id-type="doi">10.1007/s10489-017-1028-7</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10489-017-1028-7">https://doi.org/10.1007/s10489-017-1028-7</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhao, H.</string-name>
              <string-name>Liu, F.</string-name>
              <string-name>Li, L.</string-name>
              <string-name>Luo, C.</string-name>
            </person-group>
            <year>2018</year>
            <article-title>A Novel Softplus Linear Unit for Deep Convolutional Neural Networks</article-title>
            <source>Applied Intelligence</source>
            <volume>48</volume>
            <pub-id pub-id-type="doi">10.1007/s10489-017-1028-7</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B40">
        <label>40.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Hendrycks, D. and Gimpel, K. (2016) Gaussian Error Linear Units (GELUs). https://arxiv.org/abs/1606.08415</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Hendrycks, D.</string-name>
              <string-name>Gimpel, K.</string-name>
            </person-group>
            <year>2016</year>
            <article-title>Gaussian Error Linear Units (GELUs)</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B41">
        <label>41.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">Amemiya, T. (1985) Advanced Econometrics. Harvard University Press.</mixed-citation>
          <element-citation publication-type="book">
            <person-group person-group-type="author">
              <string-name>Amemiya, T.</string-name>
            </person-group>
            <year>1985</year>
            <article-title>Advanced Econometrics</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B42">
        <label>42.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Heckman, J.J. (1976) The Common Structure of Statistical Models of Truncation, Sample Selection and Limited Dependent Variables and a Simple Estimator for Such Models. <italic>Annals of Economic and Social Measurement</italic>, 5, 475-492.</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Heckman, J.J.</string-name>
              <string-name>Truncation, S</string-name>
            </person-group>
            <year>1976</year>
            <article-title>The Common Structure of Statistical Models of Truncation, Sample Selection and Limited Dependent Variables and a Simple Estimator for Such Models</article-title>
            <source>Annals of Economic and Social Measurement</source>
            <volume>5</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B43">
        <label>43.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Heckman, J.J. (1979) Sample Selection Bias as a Specification Error. <italic>Econometrica</italic>, 47, 153-161. https://doi.org/10.2307/1912352 <pub-id pub-id-type="doi">10.2307/1912352</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.2307/1912352">https://doi.org/10.2307/1912352</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Heckman, J.J.</string-name>
            </person-group>
            <year>1979</year>
            <article-title>Sample Selection Bias as a Specification Error</article-title>
            <source>Econometrica</source>
            <volume>47</volume>
            <pub-id pub-id-type="doi">10.2307/1912352</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B44">
        <label>44.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Nawata, K. (1993) A Note on the Estimation of Models with Sample-Selection Biases. <italic>Economics Letters</italic>, 42, 15-24. https://doi.org/10.1016/0165-1765(93)90167-b <pub-id pub-id-type="doi">10.1016/0165-1765(93)90167-b</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0165-1765(93)90167-b">https://doi.org/10.1016/0165-1765(93)90167-b</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
            </person-group>
            <year>1993</year>
            <article-title>A Note on the Estimation of Models with Sample-Selection Biases</article-title>
            <source>Economics Letters</source>
            <volume>1765</volume>
            <issue>93</issue>
            <pub-id pub-id-type="doi">10.1016/0165-1765(93)90167-b</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B45">
        <label>45.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Nawata, K. (1994) Estimation of Sample Selection Bias Models by the Maximum Likelihood Estimator and Heckman’s Two-Step Estimator. <italic>Economics Letters</italic>, 45, 33-40. https://doi.org/10.1016/0165-1765(94)90053-1 <pub-id pub-id-type="doi">10.1016/0165-1765(94)90053-1</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0165-1765(94)90053-1">https://doi.org/10.1016/0165-1765(94)90053-1</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
            </person-group>
            <year>1994</year>
            <article-title>Estimation of Sample Selection Bias Models by the Maximum Likelihood Estimator and Heckman’s Two-Step Estimator</article-title>
            <source>Economics Letters</source>
            <volume>1765</volume>
            <issue>94</issue>
            <pub-id pub-id-type="doi">10.1016/0165-1765(94)90053-1</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B46">
        <label>46.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Nawata, K. and Nagase, N. (1996) Estimation of Sample Selection Bias Models. <italic>Econometric Reviews</italic>, 15, 387-400. https://doi.org/10.1080/07474939608800363 <pub-id pub-id-type="doi">10.1080/07474939608800363</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/07474939608800363">https://doi.org/10.1080/07474939608800363</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Nawata, K.</string-name>
              <string-name>Nagase, N.</string-name>
            </person-group>
            <year>1996</year>
            <article-title>Estimation of Sample Selection Bias Models</article-title>
            <source>Econometric Reviews</source>
            <volume>15</volume>
            <pub-id pub-id-type="doi">10.1080/07474939608800363</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>