Average Error: 28.8 → 0.1
Time: 2.0s
Precision: binary64
\[\frac{2}{1 + e^{-2 \cdot x}} - 1\]
↓
\[\begin{array}{l} \mathbf{if}\;-2 \cdot x \leq -3.9968126987468144 \lor \neg \left(-2 \cdot x \leq 1.2702003679971944 \cdot 10^{-05}\right):\\ \;\;\;\;\log \left(e^{\frac{2}{1 + e^{-2 \cdot x}}}\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(x + 0.13333333333333333 \cdot {x}^{5}\right) - 0.3333333333333333 \cdot {x}^{3}\\ \end{array}\]
\frac{2}{1 + e^{-2 \cdot x}} - 1
↓
\begin{array}{l}
\mathbf{if}\;-2 \cdot x \leq -3.9968126987468144 \lor \neg \left(-2 \cdot x \leq 1.2702003679971944 \cdot 10^{-05}\right):\\
\;\;\;\;\log \left(e^{\frac{2}{1 + e^{-2 \cdot x}}}\right) - 1\\

\mathbf{else}:\\
\;\;\;\;\left(x + 0.13333333333333333 \cdot {x}^{5}\right) - 0.3333333333333333 \cdot {x}^{3}\\

\end{array}
(FPCore (x y) :precision binary64 (- (/ 2.0 (+ 1.0 (exp (* -2.0 x)))) 1.0))
↓
(FPCore (x y)
 :precision binary64
 (if (or (<= (* -2.0 x) -3.9968126987468144)
         (not (<= (* -2.0 x) 1.2702003679971944e-05)))
   (- (log (exp (/ 2.0 (+ 1.0 (exp (* -2.0 x)))))) 1.0)
   (-
    (+ x (* 0.13333333333333333 (pow x 5.0)))
    (* 0.3333333333333333 (pow x 3.0)))))
double code(double x, double y) {
	return (2.0 / (1.0 + exp(-2.0 * x))) - 1.0;
}
↓
double code(double x, double y) {
	double tmp;
	if (((-2.0 * x) <= -3.9968126987468144) || !((-2.0 * x) <= 1.2702003679971944e-05)) {
		tmp = log(exp(2.0 / (1.0 + exp(-2.0 * x)))) - 1.0;
	} else {
		tmp = (x + (0.13333333333333333 * pow(x, 5.0))) - (0.3333333333333333 * pow(x, 3.0));
	}
	return tmp;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Split input into 2 regimes

  2. if (*.f64 -2 x) < -3.9968126987468144 or 1.2702003679971944e-5 < (*.f64 -2 x)

    1. Initial program 0.1

      \[\frac{2}{1 + e^{-2 \cdot x}} - 1\]
    2. Using strategy rm

    3. Applied add-log-exp_binary640.1

      \[\leadsto \color{blue}{\log \left(e^{\frac{2}{1 + e^{-2 \cdot x}}}\right)} - 1\]

    if -3.9968126987468144 < (*.f64 -2 x) < 1.2702003679971944e-5

    1. Initial program 58.9

      \[\frac{2}{1 + e^{-2 \cdot x}} - 1\]

    2. Taylor expanded around 0 0.2

      \[\leadsto \color{blue}{\left(x + 0.13333333333333333 \cdot {x}^{5}\right) - 0.3333333333333333 \cdot {x}^{3}}\]
  3. Recombined 2 regimes into one program.

  4. Final simplification0.1

    \[\leadsto \begin{array}{l} \mathbf{if}\;-2 \cdot x \leq -3.9968126987468144 \lor \neg \left(-2 \cdot x \leq 1.2702003679971944 \cdot 10^{-05}\right):\\ \;\;\;\;\log \left(e^{\frac{2}{1 + e^{-2 \cdot x}}}\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(x + 0.13333333333333333 \cdot {x}^{5}\right) - 0.3333333333333333 \cdot {x}^{3}\\ \end{array}\]

Reproduce

herbie shell --seed 2020224 
(FPCore (x y)
  :name "Logistic function from Lakshay Garg"
  :precision binary64
  (- (/ 2.0 (+ 1.0 (exp (* -2.0 x)))) 1.0))