Logistic function

Percentage Accurate: 99.8% → 99.8%
Time: 9.8s
Alternatives: 12
Speedup: 1.0×

Specification

?
\[0 \leq s \land s \leq 1.0651631\]
\[\begin{array}{l} \\ \frac{1}{1 + e^{\frac{-x}{s}}} \end{array} \]
(FPCore (x s) :precision binary32 (/ 1.0 (+ 1.0 (exp (/ (- x) s)))))
float code(float x, float s) {
	return 1.0f / (1.0f + expf((-x / s)));
}
real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    code = 1.0e0 / (1.0e0 + exp((-x / s)))
end function
function code(x, s)
	return Float32(Float32(1.0) / Float32(Float32(1.0) + exp(Float32(Float32(-x) / s))))
end
function tmp = code(x, s)
	tmp = single(1.0) / (single(1.0) + exp((-x / s)));
end
\begin{array}{l}

\\
\frac{1}{1 + e^{\frac{-x}{s}}}
\end{array}

Sampling outcomes in binary32 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 12 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{1}{1 + e^{\frac{-x}{s}}} \end{array} \]
(FPCore (x s) :precision binary32 (/ 1.0 (+ 1.0 (exp (/ (- x) s)))))
float code(float x, float s) {
	return 1.0f / (1.0f + expf((-x / s)));
}
real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    code = 1.0e0 / (1.0e0 + exp((-x / s)))
end function
function code(x, s)
	return Float32(Float32(1.0) / Float32(Float32(1.0) + exp(Float32(Float32(-x) / s))))
end
function tmp = code(x, s)
	tmp = single(1.0) / (single(1.0) + exp((-x / s)));
end
\begin{array}{l}

\\
\frac{1}{1 + e^{\frac{-x}{s}}}
\end{array}

Alternative 1: 99.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{1}{1 + e^{\frac{x}{-s}}} \end{array} \]
(FPCore (x s) :precision binary32 (/ 1.0 (+ 1.0 (exp (/ x (- s))))))
float code(float x, float s) {
	return 1.0f / (1.0f + expf((x / -s)));
}
real(4) function code(x, s)
    real(4), intent (in) :: x
    real(4), intent (in) :: s
    code = 1.0e0 / (1.0e0 + exp((x / -s)))
end function
function code(x, s)
	return Float32(Float32(1.0) / Float32(Float32(1.0) + exp(Float32(x / Float32(-s)))))
end
function tmp = code(x, s)
	tmp = single(1.0) / (single(1.0) + exp((x / -s)));
end
\begin{array}{l}

\\
\frac{1}{1 + e^{\frac{x}{-s}}}
\end{array}
Derivation
  1. Initial program 99.8%

    \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
  2. Add Preprocessing
  3. Final simplification99.8%

    \[\leadsto \frac{1}{1 + e^{\frac{x}{-s}}} \]
  4. Add Preprocessing

Alternative 2: 67.5% accurate, 1.4× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq -5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{\frac{x}{s}}{s}, \mathsf{fma}\left(-0.16666666666666666, \frac{x}{s}, 0.5\right), \frac{-1}{s}\right), 2\right)}\\ \end{array} \end{array} \]
(FPCore (x s)
 :precision binary32
 (if (<= (/ x (- s)) -5.0)
   0.5
   (/
    1.0
    (fma
     x
     (fma (/ (/ x s) s) (fma -0.16666666666666666 (/ x s) 0.5) (/ -1.0 s))
     2.0))))
float code(float x, float s) {
	float tmp;
	if ((x / -s) <= -5.0f) {
		tmp = 0.5f;
	} else {
		tmp = 1.0f / fmaf(x, fmaf(((x / s) / s), fmaf(-0.16666666666666666f, (x / s), 0.5f), (-1.0f / s)), 2.0f);
	}
	return tmp;
}
function code(x, s)
	tmp = Float32(0.0)
	if (Float32(x / Float32(-s)) <= Float32(-5.0))
		tmp = Float32(0.5);
	else
		tmp = Float32(Float32(1.0) / fma(x, fma(Float32(Float32(x / s) / s), fma(Float32(-0.16666666666666666), Float32(x / s), Float32(0.5)), Float32(Float32(-1.0) / s)), Float32(2.0)));
	end
	return tmp
end
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;\frac{x}{-s} \leq -5:\\
\;\;\;\;0.5\\

\mathbf{else}:\\
\;\;\;\;\frac{1}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{\frac{x}{s}}{s}, \mathsf{fma}\left(-0.16666666666666666, \frac{x}{s}, 0.5\right), \frac{-1}{s}\right), 2\right)}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (/.f32 (neg.f32 x) s) < -5

    1. Initial program 100.0%

      \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
    2. Add Preprocessing
    3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\frac{1}{2}} \]
    4. Step-by-step derivation
      1. Applied rewrites28.1%

        \[\leadsto \color{blue}{0.5} \]

      if -5 < (/.f32 (neg.f32 x) s)

      1. Initial program 99.7%

        \[\frac{1}{1 + e^{\frac{-x}{s}}} \]
      2. Add Preprocessing
      3. Taylor expanded in x around 0

        \[\leadsto \frac{1}{\color{blue}{2 + x \cdot \left(x \cdot \left(\frac{-1}{6} \cdot \frac{x}{{s}^{3}} + \frac{1}{2} \cdot \frac{1}{{s}^{2}}\right) - \frac{1}{s}\right)}} \]
      4. Step-by-step derivation
        1. +-commutativeN/A

          \[\leadsto \frac{1}{\color{blue}{x \cdot \left(x \cdot \left(\frac{-1}{6} \cdot \frac{x}{{s}^{3}} + \frac{1}{2} \cdot \frac{1}{{s}^{2}}\right) - \frac{1}{s}\right) + 2}} \]
        2. lower-fma.f32N/A

          \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(x, x \cdot \left(\frac{-1}{6} \cdot \frac{x}{{s}^{3}} + \frac{1}{2} \cdot \frac{1}{{s}^{2}}\right) - \frac{1}{s}, 2\right)}} \]
      5. Applied rewrites85.2%

        \[\leadsto \frac{1}{\color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{x}{s \cdot s}, \mathsf{fma}\left(-0.16666666666666666, \frac{x}{s}, 0.5\right), \frac{-1}{s}\right), 2\right)}} \]
      6. Step-by-step derivation
        1. Applied rewrites90.6%

          \[\leadsto \frac{1}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{\frac{x}{s}}{s}, \mathsf{fma}\left(\color{blue}{-0.16666666666666666}, \frac{x}{s}, 0.5\right), \frac{-1}{s}\right), 2\right)} \]
      7. Recombined 2 regimes into one program.
      8. Final simplification67.5%

        \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{x}{-s} \leq -5:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\mathsf{fma}\left(x, \mathsf{fma}\left(\frac{\frac{x}{s}}{s}, \mathsf{fma}\left(-0.16666666666666666, \frac{x}{s}, 0.5\right), \frac{-1}{s}\right), 2\right)}\\ \end{array} \]
      9. Add Preprocessing

      Reproduce

      ?
      herbie shell --seed 2024226 
      (FPCore (x s)
        :name "Logistic function"
        :precision binary32
        :pre (and (<= 0.0 s) (<= s 1.0651631))
        (/ 1.0 (+ 1.0 (exp (/ (- x) s)))))