Average Error: 29.1 → 0.4
Time: 2.6s
Precision: binary64
\[\frac{2}{1 + e^{-2 \cdot x}} - 1\]
↓
\[\begin{array}{l} \mathbf{if}\;-2 \cdot x \le -2312.79996024857655 \lor \neg \left(-2 \cdot x \le 1.8253967034533142 \cdot 10^{-13}\right):\\ \;\;\;\;\sqrt[3]{{\left(\frac{2}{1 + e^{-2 \cdot x}} - 1\right)}^{3}}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x - \left(5.55112 \cdot 10^{-17} \cdot {x}^{4} + 0.33333333333333337 \cdot {x}^{3}\right)\\ \end{array}\]
\frac{2}{1 + e^{-2 \cdot x}} - 1
↓
\begin{array}{l}
\mathbf{if}\;-2 \cdot x \le -2312.79996024857655 \lor \neg \left(-2 \cdot x \le 1.8253967034533142 \cdot 10^{-13}\right):\\
\;\;\;\;\sqrt[3]{{\left(\frac{2}{1 + e^{-2 \cdot x}} - 1\right)}^{3}}\\

\mathbf{else}:\\
\;\;\;\;1 \cdot x - \left(5.55112 \cdot 10^{-17} \cdot {x}^{4} + 0.33333333333333337 \cdot {x}^{3}\right)\\

\end{array}
double code(double x, double y) {
	return ((double) (((double) (2.0 / ((double) (1.0 + ((double) exp(((double) (-2.0 * x)))))))) - 1.0));
}
↓
double code(double x, double y) {
	double VAR;
	if (((((double) (-2.0 * x)) <= -2312.7999602485766) || !(((double) (-2.0 * x)) <= 1.8253967034533142e-13))) {
		VAR = ((double) cbrt(((double) pow(((double) (((double) (2.0 / ((double) (1.0 + ((double) exp(((double) (-2.0 * x)))))))) - 1.0)), 3.0))));
	} else {
		VAR = ((double) (((double) (1.0 * x)) - ((double) (((double) (5.551115123125783e-17 * ((double) pow(x, 4.0)))) + ((double) (0.33333333333333337 * ((double) pow(x, 3.0))))))));
	}
	return VAR;
}

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 (* -2.0 x) < -2312.79996024857655 or 1.8253967034533142e-13 < (* -2.0 x)

    1. Initial program 0.4

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

    3. Applied add-cbrt-cube0.4

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

    4. Simplified0.4

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

    if -2312.79996024857655 < (* -2.0 x) < 1.8253967034533142e-13

    1. Initial program 59.4

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

    2. Taylor expanded around 0 0.4

      \[\leadsto \color{blue}{1 \cdot x - \left(5.55112 \cdot 10^{-17} \cdot {x}^{4} + 0.33333333333333337 \cdot {x}^{3}\right)}\]
  3. Recombined 2 regimes into one program.

  4. Final simplification0.4

    \[\leadsto \begin{array}{l} \mathbf{if}\;-2 \cdot x \le -2312.79996024857655 \lor \neg \left(-2 \cdot x \le 1.8253967034533142 \cdot 10^{-13}\right):\\ \;\;\;\;\sqrt[3]{{\left(\frac{2}{1 + e^{-2 \cdot x}} - 1\right)}^{3}}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot x - \left(5.55112 \cdot 10^{-17} \cdot {x}^{4} + 0.33333333333333337 \cdot {x}^{3}\right)\\ \end{array}\]

Reproduce

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