Logistic regression 2

Percentage Accurate: 99.2% → 99.3%

Time: 6.9s

Alternatives: 10

Speedup: 1.7×

• could not determine a ground truth

  1. x = 1.2291800307634401e+270
  2. y = -1.0775283870711602e+41

Specification

Math

\[\begin{array}{l} \\ \log \left(1 + e^{x}\right) - x \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (log (+ 1.0 (exp x))) (* x y)))

C

double code(double x, double y) {
	return log((1.0 + exp(x))) - (x * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = log((1.0d0 + exp(x))) - (x * y)
end function

Java

public static double code(double x, double y) {
	return Math.log((1.0 + Math.exp(x))) - (x * y);
}

Python

def code(x, y):
	return math.log((1.0 + math.exp(x))) - (x * y)

Julia

function code(x, y)
	return Float64(log(Float64(1.0 + exp(x))) - Float64(x * y))
end

MATLAB

function tmp = code(x, y)
	tmp = log((1.0 + exp(x))) - (x * y);
end

Wolfram

code[x_, y_] := N[(N[Log[N[(1.0 + N[Exp[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \log \left(1 + e^{x}\right) - x \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- (log (+ 1.0 (exp x))) (* x y)))

C

double code(double x, double y) {
	return log((1.0 + exp(x))) - (x * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = log((1.0d0 + exp(x))) - (x * y)
end function

Java

public static double code(double x, double y) {
	return Math.log((1.0 + Math.exp(x))) - (x * y);
}

Python

def code(x, y):
	return math.log((1.0 + math.exp(x))) - (x * y)

Julia

function code(x, y)
	return Float64(log(Float64(1.0 + exp(x))) - Float64(x * y))
end

MATLAB

function tmp = code(x, y)
	tmp = log((1.0 + exp(x))) - (x * y);
end

Wolfram

code[x_, y_] := N[(N[Log[N[(1.0 + N[Exp[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(-y, x, \mathsf{log1p}\left(e^{x}\right)\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (fma (- y) x (log1p (exp x))))

C

double code(double x, double y) {
	return fma(-y, x, log1p(exp(x)));
}

Julia

function code(x, y)
	return fma(Float64(-y), x, log1p(exp(x)))
end

Wolfram

code[x_, y_] := N[((-y) * x + N[Log[1 + N[Exp[x], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 98.8%

   \[\log \left(1 + e^{x}\right) - x \cdot y \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

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

   2. sub-neg N/A

      \[\leadsto \color{blue}{\log \left(1 + e^{x}\right) + \left(\mathsf{neg}\left(x \cdot y\right)\right)} \]

   3. +-commutative N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x \cdot y\right)\right) + \log \left(1 + e^{x}\right)} \]

   4. lift-*.f64 N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x \cdot y}\right)\right) + \log \left(1 + e^{x}\right) \]

   5. *-commutative N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{y \cdot x}\right)\right) + \log \left(1 + e^{x}\right) \]

   6. distribute-lft-neg-in N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} + \log \left(1 + e^{x}\right) \]

   7. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(y\right), x, \log \left(1 + e^{x}\right)\right)} \]

   8. lower-neg.f64 98.8

      \[\leadsto \mathsf{fma}\left(\color{blue}{-y}, x, \log \left(1 + e^{x}\right)\right) \]

   9. lift-log.f64 N/A

      \[\leadsto \mathsf{fma}\left(-y, x, \color{blue}{\log \left(1 + e^{x}\right)}\right) \]

   10. lift-+.f64 N/A

       \[\leadsto \mathsf{fma}\left(-y, x, \log \color{blue}{\left(1 + e^{x}\right)}\right) \]

   11. lower-log1p.f64 99.6

       \[\leadsto \mathsf{fma}\left(-y, x, \color{blue}{\mathsf{log1p}\left(e^{x}\right)}\right) \]

4. Applied rewrites 99.6%

   \[\leadsto \color{blue}{\mathsf{fma}\left(-y, x, \mathsf{log1p}\left(e^{x}\right)\right)} \]
5. Add Preprocessing

Alternative 2: 97.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \log \left(1 + e^{x}\right) - x \cdot y\\ \mathbf{if}\;t\_0 \leq 2 \cdot 10^{-13} \lor \neg \left(t\_0 \leq 2\right):\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5, x, \log 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- (log (+ 1.0 (exp x))) (* x y))))
   (if (or (<= t_0 2e-13) (not (<= t_0 2.0)))
     (* (- y) x)
     (fma 0.5 x (log 2.0)))))

C

double code(double x, double y) {
	double t_0 = log((1.0 + exp(x))) - (x * y);
	double tmp;
	if ((t_0 <= 2e-13) || !(t_0 <= 2.0)) {
		tmp = -y * x;
	} else {
		tmp = fma(0.5, x, log(2.0));
	}
	return tmp;
}

Julia

function code(x, y)
	t_0 = Float64(log(Float64(1.0 + exp(x))) - Float64(x * y))
	tmp = 0.0
	if ((t_0 <= 2e-13) || !(t_0 <= 2.0))
		tmp = Float64(Float64(-y) * x);
	else
		tmp = fma(0.5, x, log(2.0));
	end
	return tmp
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Log[N[(1.0 + N[Exp[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 2e-13], N[Not[LessEqual[t$95$0, 2.0]], $MachinePrecision]], N[((-y) * x), $MachinePrecision], N[(0.5 * x + N[Log[2.0], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (log.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x))) (*.f64 x y)) < 2.0000000000000001e-13 or 2 < (-.f64 (log.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x))) (*.f64 x y))

   1. Initial program 97.5%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      5. lower-neg.f64 96.4

         \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

   5. Applied rewrites 96.4%

      \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

   if 2.0000000000000001e-13 < (-.f64 (log.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x))) (*.f64 x y)) < 2

   1. Initial program 100.0%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log 2 + x \cdot \left(\frac{1}{2} - y\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} - y, x, \log 2\right)} \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} - y}, x, \log 2\right) \]

      5. lower-log.f64 98.9

         \[\leadsto \mathsf{fma}\left(0.5 - y, x, \color{blue}{\log 2}\right) \]

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.5 - y, x, \log 2\right)} \]

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(\frac{1}{2} - y\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 3.8%

      \[\leadsto \left(0.5 - y\right) \cdot \color{blue}{x} \]

   9. Taylor expanded in y around 0

      \[\leadsto \log 2 + \color{blue}{\frac{1}{2} \cdot x} \]
   10. Step-by-step derivation

   11. Applied rewrites 97.3%

       \[\leadsto \mathsf{fma}\left(0.5, \color{blue}{x}, \log 2\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\log \left(1 + e^{x}\right) - x \cdot y \leq 2 \cdot 10^{-13} \lor \neg \left(\log \left(1 + e^{x}\right) - x \cdot y \leq 2\right):\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5, x, \log 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.8% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \log \left(1 + e^{x}\right) - x \cdot y\\ \mathbf{if}\;t\_0 \leq 2 \cdot 10^{-13} \lor \neg \left(t\_0 \leq 2\right):\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\log 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (- (log (+ 1.0 (exp x))) (* x y))))
   (if (or (<= t_0 2e-13) (not (<= t_0 2.0))) (* (- y) x) (log 2.0))))

C

double code(double x, double y) {
	double t_0 = log((1.0 + exp(x))) - (x * y);
	double tmp;
	if ((t_0 <= 2e-13) || !(t_0 <= 2.0)) {
		tmp = -y * x;
	} else {
		tmp = log(2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = log((1.0d0 + exp(x))) - (x * y)
    if ((t_0 <= 2d-13) .or. (.not. (t_0 <= 2.0d0))) then
        tmp = -y * x
    else
        tmp = log(2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = Math.log((1.0 + Math.exp(x))) - (x * y);
	double tmp;
	if ((t_0 <= 2e-13) || !(t_0 <= 2.0)) {
		tmp = -y * x;
	} else {
		tmp = Math.log(2.0);
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = math.log((1.0 + math.exp(x))) - (x * y)
	tmp = 0
	if (t_0 <= 2e-13) or not (t_0 <= 2.0):
		tmp = -y * x
	else:
		tmp = math.log(2.0)
	return tmp

Julia

function code(x, y)
	t_0 = Float64(log(Float64(1.0 + exp(x))) - Float64(x * y))
	tmp = 0.0
	if ((t_0 <= 2e-13) || !(t_0 <= 2.0))
		tmp = Float64(Float64(-y) * x);
	else
		tmp = log(2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = log((1.0 + exp(x))) - (x * y);
	tmp = 0.0;
	if ((t_0 <= 2e-13) || ~((t_0 <= 2.0)))
		tmp = -y * x;
	else
		tmp = log(2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[Log[N[(1.0 + N[Exp[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$0, 2e-13], N[Not[LessEqual[t$95$0, 2.0]], $MachinePrecision]], N[((-y) * x), $MachinePrecision], N[Log[2.0], $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (log.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x))) (*.f64 x y)) < 2.0000000000000001e-13 or 2 < (-.f64 (log.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x))) (*.f64 x y))

   1. Initial program 97.5%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      5. lower-neg.f64 96.4

         \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

   5. Applied rewrites 96.4%

      \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

   if 2.0000000000000001e-13 < (-.f64 (log.f64 (+.f64 #s(literal 1 binary64) (exp.f64 x))) (*.f64 x y)) < 2

   1. Initial program 100.0%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. sub-neg N/A

         \[\leadsto \color{blue}{\log \left(1 + e^{x}\right) + \left(\mathsf{neg}\left(x \cdot y\right)\right)} \]

      3. +-commutative N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x \cdot y\right)\right) + \log \left(1 + e^{x}\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x \cdot y}\right)\right) + \log \left(1 + e^{x}\right) \]

      5. *-commutative N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{y \cdot x}\right)\right) + \log \left(1 + e^{x}\right) \]

      6. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} + \log \left(1 + e^{x}\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(y\right), x, \log \left(1 + e^{x}\right)\right)} \]

      8. lower-neg.f64 100.0

         \[\leadsto \mathsf{fma}\left(\color{blue}{-y}, x, \log \left(1 + e^{x}\right)\right) \]

      9. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(-y, x, \color{blue}{\log \left(1 + e^{x}\right)}\right) \]

      10. lift-+.f64 N/A

          \[\leadsto \mathsf{fma}\left(-y, x, \log \color{blue}{\left(1 + e^{x}\right)}\right) \]

      11. lower-log1p.f64 100.0

          \[\leadsto \mathsf{fma}\left(-y, x, \color{blue}{\mathsf{log1p}\left(e^{x}\right)}\right) \]

   4. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-y, x, \mathsf{log1p}\left(e^{x}\right)\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log 2} \]
   6. Step-by-step derivation

      1. lower-log.f64 97.1

         \[\leadsto \color{blue}{\log 2} \]

   7. Applied rewrites 97.1%

      \[\leadsto \color{blue}{\log 2} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\log \left(1 + e^{x}\right) - x \cdot y \leq 2 \cdot 10^{-13} \lor \neg \left(\log \left(1 + e^{x}\right) - x \cdot y \leq 2\right):\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\log 2\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 99.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.9:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, -0.005208333333333333, 0.125\right), x, 0.5 - y\right), x, \log 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.9)
   (* (- y) x)
   (fma
    (fma (fma (* x x) -0.005208333333333333 0.125) x (- 0.5 y))
    x
    (log 2.0))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.9) {
		tmp = -y * x;
	} else {
		tmp = fma(fma(fma((x * x), -0.005208333333333333, 0.125), x, (0.5 - y)), x, log(2.0));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.9)
		tmp = Float64(Float64(-y) * x);
	else
		tmp = fma(fma(fma(Float64(x * x), -0.005208333333333333, 0.125), x, Float64(0.5 - y)), x, log(2.0));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.9], N[((-y) * x), $MachinePrecision], N[(N[(N[(N[(x * x), $MachinePrecision] * -0.005208333333333333 + 0.125), $MachinePrecision] * x + N[(0.5 - y), $MachinePrecision]), $MachinePrecision] * x + N[Log[2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.89999999999999991

   1. Initial program 97.7%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      5. lower-neg.f64 97.7

         \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

   5. Applied rewrites 97.7%

      \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

   if -3.89999999999999991 < x

   1. Initial program 99.4%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log 2 + x \cdot \left(\left(\frac{1}{2} + x \cdot \left(\frac{1}{8} + \frac{-1}{192} \cdot {x}^{2}\right)\right) - y\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\left(\frac{1}{2} + x \cdot \left(\frac{1}{8} + \frac{-1}{192} \cdot {x}^{2}\right)\right) - y, x, \log 2\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(x \cdot \left(\frac{1}{8} + \frac{-1}{192} \cdot {x}^{2}\right) + \frac{1}{2}\right)} - y, x, \log 2\right) \]

      5. associate--l+ N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{x \cdot \left(\frac{1}{8} + \frac{-1}{192} \cdot {x}^{2}\right) + \left(\frac{1}{2} - y\right)}, x, \log 2\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{8} + \frac{-1}{192} \cdot {x}^{2}\right) \cdot x} + \left(\frac{1}{2} - y\right), x, \log 2\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{8} + \frac{-1}{192} \cdot {x}^{2}, x, \frac{1}{2} - y\right)}, x, \log 2\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{-1}{192} \cdot {x}^{2} + \frac{1}{8}}, x, \frac{1}{2} - y\right), x, \log 2\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{{x}^{2} \cdot \frac{-1}{192}} + \frac{1}{8}, x, \frac{1}{2} - y\right), x, \log 2\right) \]

      10. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left({x}^{2}, \frac{-1}{192}, \frac{1}{8}\right)}, x, \frac{1}{2} - y\right), x, \log 2\right) \]

      11. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{-1}{192}, \frac{1}{8}\right), x, \frac{1}{2} - y\right), x, \log 2\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{x \cdot x}, \frac{-1}{192}, \frac{1}{8}\right), x, \frac{1}{2} - y\right), x, \log 2\right) \]

      13. lower--.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, \frac{-1}{192}, \frac{1}{8}\right), x, \color{blue}{\frac{1}{2} - y}\right), x, \log 2\right) \]

      14. lower-log.f64 99.3

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, -0.005208333333333333, 0.125\right), x, 0.5 - y\right), x, \color{blue}{\log 2}\right) \]

   5. Applied rewrites 99.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, -0.005208333333333333, 0.125\right), x, 0.5 - y\right), x, \log 2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.9:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, -0.005208333333333333, 0.125\right), x, 0.5 - y\right), x, \log 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -95:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.125, x, 0.5 - y\right), x, \log 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -95.0) (* (- y) x) (fma (fma 0.125 x (- 0.5 y)) x (log 2.0))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -95.0) {
		tmp = -y * x;
	} else {
		tmp = fma(fma(0.125, x, (0.5 - y)), x, log(2.0));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -95.0)
		tmp = Float64(Float64(-y) * x);
	else
		tmp = fma(fma(0.125, x, Float64(0.5 - y)), x, log(2.0));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -95.0], N[((-y) * x), $MachinePrecision], N[(N[(0.125 * x + N[(0.5 - y), $MachinePrecision]), $MachinePrecision] * x + N[Log[2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -95

   1. Initial program 100.0%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      5. lower-neg.f64 100.0

         \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

   if -95 < x

   1. Initial program 98.3%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log 2 + x \cdot \left(\left(\frac{1}{2} + \frac{1}{8} \cdot x\right) - y\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\left(\frac{1}{2} + \frac{1}{8} \cdot x\right) - y, x, \log 2\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{8} \cdot x + \frac{1}{2}\right)} - y, x, \log 2\right) \]

      5. associate--l+ N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{8} \cdot x + \left(\frac{1}{2} - y\right)}, x, \log 2\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{8}, x, \frac{1}{2} - y\right)}, x, \log 2\right) \]

      7. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{8}, x, \color{blue}{\frac{1}{2} - y}\right), x, \log 2\right) \]

      8. lower-log.f64 98.2

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.125, x, 0.5 - y\right), x, \color{blue}{\log 2}\right) \]

   5. Applied rewrites 98.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.125, x, 0.5 - y\right), x, \log 2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -95:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.125, x, 0.5 - y\right), x, \log 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 99.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.9:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5 - y, x, \log 2\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.9) (* (- y) x) (fma (- 0.5 y) x (log 2.0))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.9) {
		tmp = -y * x;
	} else {
		tmp = fma((0.5 - y), x, log(2.0));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.9)
		tmp = Float64(Float64(-y) * x);
	else
		tmp = fma(Float64(0.5 - y), x, log(2.0));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.9], N[((-y) * x), $MachinePrecision], N[(N[(0.5 - y), $MachinePrecision] * x + N[Log[2.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.89999999999999991

   1. Initial program 97.7%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      5. lower-neg.f64 97.7

         \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

   5. Applied rewrites 97.7%

      \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

   if -3.89999999999999991 < x

   1. Initial program 99.4%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\log 2 + x \cdot \left(\frac{1}{2} - y\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} - y, x, \log 2\right)} \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} - y}, x, \log 2\right) \]

      5. lower-log.f64 99.1

         \[\leadsto \mathsf{fma}\left(0.5 - y, x, \color{blue}{\log 2}\right) \]

   5. Applied rewrites 99.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.5 - y, x, \log 2\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.9:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(0.5 - y, x, \log 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -95:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-y, x, \mathsf{log1p}\left(1\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -95.0) (* (- y) x) (fma (- y) x (log1p 1.0))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -95.0) {
		tmp = -y * x;
	} else {
		tmp = fma(-y, x, log1p(1.0));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -95.0)
		tmp = Float64(Float64(-y) * x);
	else
		tmp = fma(Float64(-y), x, log1p(1.0));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -95.0], N[((-y) * x), $MachinePrecision], N[((-y) * x + N[Log[1 + 1.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -95

   1. Initial program 100.0%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      5. lower-neg.f64 100.0

         \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

   if -95 < x

   1. Initial program 98.3%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. sub-neg N/A

         \[\leadsto \color{blue}{\log \left(1 + e^{x}\right) + \left(\mathsf{neg}\left(x \cdot y\right)\right)} \]

      3. +-commutative N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(x \cdot y\right)\right) + \log \left(1 + e^{x}\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{x \cdot y}\right)\right) + \log \left(1 + e^{x}\right) \]

      5. *-commutative N/A

         \[\leadsto \left(\mathsf{neg}\left(\color{blue}{y \cdot x}\right)\right) + \log \left(1 + e^{x}\right) \]

      6. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} + \log \left(1 + e^{x}\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{neg}\left(y\right), x, \log \left(1 + e^{x}\right)\right)} \]

      8. lower-neg.f64 98.3

         \[\leadsto \mathsf{fma}\left(\color{blue}{-y}, x, \log \left(1 + e^{x}\right)\right) \]

      9. lift-log.f64 N/A

         \[\leadsto \mathsf{fma}\left(-y, x, \color{blue}{\log \left(1 + e^{x}\right)}\right) \]

      10. lift-+.f64 N/A

          \[\leadsto \mathsf{fma}\left(-y, x, \log \color{blue}{\left(1 + e^{x}\right)}\right) \]

      11. lower-log1p.f64 99.4

          \[\leadsto \mathsf{fma}\left(-y, x, \color{blue}{\mathsf{log1p}\left(e^{x}\right)}\right) \]

   4. Applied rewrites 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-y, x, \mathsf{log1p}\left(e^{x}\right)\right)} \]

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(-y, x, \mathsf{log1p}\left(\color{blue}{1}\right)\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 97.9%

      \[\leadsto \mathsf{fma}\left(-y, x, \mathsf{log1p}\left(\color{blue}{1}\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -95:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-y, x, \mathsf{log1p}\left(1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 98.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -95:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\log 2 - x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -95.0) (* (- y) x) (- (log 2.0) (* x y))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -95.0) {
		tmp = -y * x;
	} else {
		tmp = log(2.0) - (x * y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-95.0d0)) then
        tmp = -y * x
    else
        tmp = log(2.0d0) - (x * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -95.0) {
		tmp = -y * x;
	} else {
		tmp = Math.log(2.0) - (x * y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -95.0:
		tmp = -y * x
	else:
		tmp = math.log(2.0) - (x * y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -95.0)
		tmp = Float64(Float64(-y) * x);
	else
		tmp = Float64(log(2.0) - Float64(x * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -95.0)
		tmp = -y * x;
	else
		tmp = log(2.0) - (x * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -95.0], N[((-y) * x), $MachinePrecision], N[(N[Log[2.0], $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -95

   1. Initial program 100.0%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

      2. *-commutative N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

      3. distribute-lft-neg-in N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

      5. lower-neg.f64 100.0

         \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

   if -95 < x

   1. Initial program 98.3%

      \[\log \left(1 + e^{x}\right) - x \cdot y \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \log \color{blue}{2} - x \cdot y \]
   4. Step-by-step derivation

   5. Applied rewrites 97.9%

      \[\leadsto \log \color{blue}{2} - x \cdot y \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -95:\\ \;\;\;\;\left(-y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\log 2 - x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 49.9% accurate, 26.5× speedup

Math

\[\begin{array}{l} \\ \left(-y\right) \cdot x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (- y) x))

C

double code(double x, double y) {
	return -y * x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = -y * x
end function

Java

public static double code(double x, double y) {
	return -y * x;
}

Python

def code(x, y):
	return -y * x

Julia

function code(x, y)
	return Float64(Float64(-y) * x)
end

MATLAB

function tmp = code(x, y)
	tmp = -y * x;
end

Wolfram

code[x_, y_] := N[((-y) * x), $MachinePrecision]

Derivation

1. Initial program 98.8%

   \[\log \left(1 + e^{x}\right) - x \cdot y \]
2. Add Preprocessing

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
4. Step-by-step derivation

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(x \cdot y\right)} \]

   2. *-commutative N/A

      \[\leadsto \mathsf{neg}\left(\color{blue}{y \cdot x}\right) \]

   3. distribute-lft-neg-in N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

   4. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(y\right)\right) \cdot x} \]

   5. lower-neg.f64 45.9

      \[\leadsto \color{blue}{\left(-y\right)} \cdot x \]

5. Applied rewrites 45.9%

   \[\leadsto \color{blue}{\left(-y\right) \cdot x} \]

6. Final simplification 45.9%

   \[\leadsto \left(-y\right) \cdot x \]
7. Add Preprocessing

Alternative 10: 3.6% accurate, 35.3× speedup

Math

\[\begin{array}{l} \\ 0.5 \cdot x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* 0.5 x))

C

double code(double x, double y) {
	return 0.5 * x;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 0.5d0 * x
end function

Java

public static double code(double x, double y) {
	return 0.5 * x;
}

Python

def code(x, y):
	return 0.5 * x

Julia

function code(x, y)
	return Float64(0.5 * x)
end

MATLAB

function tmp = code(x, y)
	tmp = 0.5 * x;
end

Wolfram

code[x_, y_] := N[(0.5 * x), $MachinePrecision]

Derivation

1. Initial program 98.8%

   \[\log \left(1 + e^{x}\right) - x \cdot y \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{\log 2 + x \cdot \left(\frac{1}{2} - y\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{1}{2} - y, x, \log 2\right)} \]

   4. lower--.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{1}{2} - y}, x, \log 2\right) \]

   5. lower-log.f64 85.7

      \[\leadsto \mathsf{fma}\left(0.5 - y, x, \color{blue}{\log 2}\right) \]

5. Applied rewrites 85.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.5 - y, x, \log 2\right)} \]

6. Taylor expanded in x around inf

   \[\leadsto x \cdot \color{blue}{\left(\frac{1}{2} - y\right)} \]
7. Step-by-step derivation

8. Applied rewrites 33.2%

   \[\leadsto \left(0.5 - y\right) \cdot \color{blue}{x} \]

9. Taylor expanded in y around 0

   \[\leadsto \frac{1}{2} \cdot x \]
10. Step-by-step derivation

11. Applied rewrites 3.6%

    \[\leadsto 0.5 \cdot x \]

12. Final simplification 3.6%

    \[\leadsto 0.5 \cdot x \]
13. Add Preprocessing

Developer Target 1: 99.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0:\\ \;\;\;\;\log \left(1 + e^{x}\right) - x \cdot y\\ \mathbf{else}:\\ \;\;\;\;\log \left(1 + e^{-x}\right) - \left(-x\right) \cdot \left(1 - y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x 0.0)
   (- (log (+ 1.0 (exp x))) (* x y))
   (- (log (+ 1.0 (exp (- x)))) (* (- x) (- 1.0 y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= 0.0) {
		tmp = log((1.0 + exp(x))) - (x * y);
	} else {
		tmp = log((1.0 + exp(-x))) - (-x * (1.0 - y));
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= 0.0d0) then
        tmp = log((1.0d0 + exp(x))) - (x * y)
    else
        tmp = log((1.0d0 + exp(-x))) - (-x * (1.0d0 - y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= 0.0) {
		tmp = Math.log((1.0 + Math.exp(x))) - (x * y);
	} else {
		tmp = Math.log((1.0 + Math.exp(-x))) - (-x * (1.0 - y));
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= 0.0:
		tmp = math.log((1.0 + math.exp(x))) - (x * y)
	else:
		tmp = math.log((1.0 + math.exp(-x))) - (-x * (1.0 - y))
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= 0.0)
		tmp = Float64(log(Float64(1.0 + exp(x))) - Float64(x * y));
	else
		tmp = Float64(log(Float64(1.0 + exp(Float64(-x)))) - Float64(Float64(-x) * Float64(1.0 - y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= 0.0)
		tmp = log((1.0 + exp(x))) - (x * y);
	else
		tmp = log((1.0 + exp(-x))) - (-x * (1.0 - y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, 0.0], N[(N[Log[N[(1.0 + N[Exp[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[(x * y), $MachinePrecision]), $MachinePrecision], N[(N[Log[N[(1.0 + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[((-x) * N[(1.0 - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2024309 
(FPCore (x y)
  :name "Logistic regression 2"
  :precision binary64

  :alt
  (! :herbie-platform default (if (<= x 0) (- (log (+ 1 (exp x))) (* x y)) (- (log (+ 1 (exp (- x)))) (* (- x) (- 1 y)))))

  (- (log (+ 1.0 (exp x))) (* x y)))