Logistic regression 2

Percentage Accurate: 99.4% → 99.5%

Time: 10.3s

Alternatives: 9

Speedup: 1.0×

• could not determine a ground truth

  1. x = 3.624344527690386e+291
  2. y = 9.167679826015268e-68

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.4% 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.5% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_] := N[(x * (-y) + 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. Step-by-step derivation

   1. cancel-sign-sub-inv 98.8%

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

   2. +-commutative 98.8%

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

   3. distribute-lft-neg-out 98.8%

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

   4. distribute-rgt-neg-out 98.8%

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

   5. fma-def 98.8%

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

   6. log1p-def 98.8%

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

3. Simplified 98.8%

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

4. Final simplification 98.8%

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

Alternative 2: 99.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

def code(x, y):
	return math.log1p(math.exp(x)) - (x * y)

Julia

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

Wolfram

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

Derivation

1. Initial program 98.8%

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

   1. log1p-def 98.8%

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

3. Simplified 98.8%

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

4. Final simplification 98.8%

   \[\leadsto \mathsf{log1p}\left(e^{x}\right) - x \cdot y \]

Alternative 3: 99.2% accurate, 1.8× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (x <= -245000.0) {
		tmp = x * -y;
	} else {
		tmp = log(2.0) + (x * ((x * 0.125) + (0.5 - 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 <= (-245000.0d0)) then
        tmp = x * -y
    else
        tmp = log(2.0d0) + (x * ((x * 0.125d0) + (0.5d0 - y)))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -245000

   1. Initial program 100.0%

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

      1. log1p-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 100.0%

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

      1. associate-*r* 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

   6. Simplified 100.0%

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

   if -245000 < x

   1. Initial program 98.2%

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

      1. log1p-def 98.2%

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

   3. Simplified 98.2%

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

   4. Taylor expanded in x around 0 98.1%

      \[\leadsto \color{blue}{\log 2 + \left(0.125 \cdot {x}^{2} + x \cdot \left(0.5 - y\right)\right)} \]
   5. Step-by-step derivation

      1. *-commutative 98.1%

         \[\leadsto \log 2 + \left(\color{blue}{{x}^{2} \cdot 0.125} + x \cdot \left(0.5 - y\right)\right) \]

      2. unpow2 98.1%

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

      3. associate-*l* 98.1%

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

      4. sub-neg 98.1%

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

      5. mul-1-neg 98.1%

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

      6. distribute-lft-out 98.1%

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

      7. mul-1-neg 98.1%

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

      8. sub-neg 98.1%

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

   6. Simplified 98.1%

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

4. Final simplification 98.8%

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

Alternative 4: 83.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.6 \cdot 10^{-74}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 2.9 \cdot 10^{-21}:\\ \;\;\;\;\log 2 + x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.6e-74)
   (* x (- y))
   (if (<= x 2.9e-21) (+ (log 2.0) (* x 0.5)) (* x (- 0.5 y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.6e-74) {
		tmp = x * -y;
	} else if (x <= 2.9e-21) {
		tmp = log(2.0) + (x * 0.5);
	} else {
		tmp = x * (0.5 - 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 <= (-4.6d-74)) then
        tmp = x * -y
    else if (x <= 2.9d-21) then
        tmp = log(2.0d0) + (x * 0.5d0)
    else
        tmp = x * (0.5d0 - y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.6e-74) {
		tmp = x * -y;
	} else if (x <= 2.9e-21) {
		tmp = Math.log(2.0) + (x * 0.5);
	} else {
		tmp = x * (0.5 - y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.6e-74:
		tmp = x * -y
	elif x <= 2.9e-21:
		tmp = math.log(2.0) + (x * 0.5)
	else:
		tmp = x * (0.5 - y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.6e-74)
		tmp = Float64(x * Float64(-y));
	elseif (x <= 2.9e-21)
		tmp = Float64(log(2.0) + Float64(x * 0.5));
	else
		tmp = Float64(x * Float64(0.5 - y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.6e-74)
		tmp = x * -y;
	elseif (x <= 2.9e-21)
		tmp = log(2.0) + (x * 0.5);
	else
		tmp = x * (0.5 - y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.6e-74], N[(x * (-y)), $MachinePrecision], If[LessEqual[x, 2.9e-21], N[(N[Log[2.0], $MachinePrecision] + N[(x * 0.5), $MachinePrecision]), $MachinePrecision], N[(x * N[(0.5 - y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.59999999999999961e-74

   1. Initial program 100.0%

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

      1. log1p-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 92.2%

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

      1. associate-*r* 92.2%

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

      2. neg-mul-1 92.2%

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

      3. *-commutative 92.2%

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

   6. Simplified 92.2%

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

   if -4.59999999999999961e-74 < x < 2.9e-21

   1. Initial program 100.0%

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

      1. log1p-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 100.0%

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

   5. Taylor expanded in y around 0 75.4%

      \[\leadsto \color{blue}{\log 2 + 0.5 \cdot x} \]

   if 2.9e-21 < x

   1. Initial program 80.5%

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

      1. log1p-def 80.6%

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

   3. Simplified 80.6%

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

   4. Taylor expanded in x around 0 78.5%

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

   5. Taylor expanded in x around inf 66.2%

      \[\leadsto \color{blue}{x \cdot \left(0.5 - y\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 82.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.6 \cdot 10^{-74}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 2.9 \cdot 10^{-21}:\\ \;\;\;\;\log 2 + x \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \end{array} \]

Alternative 5: 99.1% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (x <= -245000.0) {
		tmp = x * -y;
	} else {
		tmp = log(2.0) + (x * (0.5 - 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 <= (-245000.0d0)) then
        tmp = x * -y
    else
        tmp = log(2.0d0) + (x * (0.5d0 - y))
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -245000

   1. Initial program 100.0%

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

      1. log1p-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 100.0%

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

      1. associate-*r* 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

   6. Simplified 100.0%

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

   if -245000 < x

   1. Initial program 98.2%

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

      1. log1p-def 98.2%

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

   3. Simplified 98.2%

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

   4. Taylor expanded in x around 0 97.7%

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

4. Final simplification 98.5%

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

Alternative 6: 98.8% accurate, 1.9× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (x <= -245000.0) {
		tmp = x * -y;
	} 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 <= (-245000.0d0)) then
        tmp = x * -y
    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 <= -245000.0) {
		tmp = x * -y;
	} else {
		tmp = Math.log(2.0) - (x * y);
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -245000.0)
		tmp = Float64(x * Float64(-y));
	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 <= -245000.0)
		tmp = x * -y;
	else
		tmp = log(2.0) - (x * y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -245000

   1. Initial program 100.0%

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

      1. log1p-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 100.0%

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

      1. associate-*r* 100.0%

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

      2. neg-mul-1 100.0%

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

      3. *-commutative 100.0%

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

   6. Simplified 100.0%

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

   if -245000 < x

   1. Initial program 98.2%

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

      1. log1p-def 98.2%

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

   3. Simplified 98.2%

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

   4. Taylor expanded in x around 0 96.8%

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

4. Final simplification 97.9%

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

Alternative 7: 83.6% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-74}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 2.8 \cdot 10^{-21}:\\ \;\;\;\;\log 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.4e-74)
   (* x (- y))
   (if (<= x 2.8e-21) (log 2.0) (* x (- 0.5 y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.4e-74) {
		tmp = x * -y;
	} else if (x <= 2.8e-21) {
		tmp = log(2.0);
	} else {
		tmp = x * (0.5 - 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 <= (-4.4d-74)) then
        tmp = x * -y
    else if (x <= 2.8d-21) then
        tmp = log(2.0d0)
    else
        tmp = x * (0.5d0 - y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.4e-74) {
		tmp = x * -y;
	} else if (x <= 2.8e-21) {
		tmp = Math.log(2.0);
	} else {
		tmp = x * (0.5 - y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.4e-74:
		tmp = x * -y
	elif x <= 2.8e-21:
		tmp = math.log(2.0)
	else:
		tmp = x * (0.5 - y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.4e-74)
		tmp = Float64(x * Float64(-y));
	elseif (x <= 2.8e-21)
		tmp = log(2.0);
	else
		tmp = Float64(x * Float64(0.5 - y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.4e-74)
		tmp = x * -y;
	elseif (x <= 2.8e-21)
		tmp = log(2.0);
	else
		tmp = x * (0.5 - y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.4e-74], N[(x * (-y)), $MachinePrecision], If[LessEqual[x, 2.8e-21], N[Log[2.0], $MachinePrecision], N[(x * N[(0.5 - y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.40000000000000021e-74

   1. Initial program 100.0%

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

      1. log1p-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 92.2%

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

      1. associate-*r* 92.2%

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

      2. neg-mul-1 92.2%

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

      3. *-commutative 92.2%

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

   6. Simplified 92.2%

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

   if -4.40000000000000021e-74 < x < 2.80000000000000004e-21

   1. Initial program 100.0%

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

      1. log1p-def 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 100.0%

      \[\leadsto \color{blue}{\log 2} - x \cdot y \]

   5. Taylor expanded in x around 0 75.4%

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

   if 2.80000000000000004e-21 < x

   1. Initial program 80.5%

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

      1. log1p-def 80.6%

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

   3. Simplified 80.6%

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

   4. Taylor expanded in x around 0 78.5%

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

   5. Taylor expanded in x around inf 66.2%

      \[\leadsto \color{blue}{x \cdot \left(0.5 - y\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 82.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{-74}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 2.8 \cdot 10^{-21}:\\ \;\;\;\;\log 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \end{array} \]

Alternative 8: 53.2% accurate, 51.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

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

   1. log1p-def 98.8%

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

3. Simplified 98.8%

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

4. Taylor expanded in x around inf 56.1%

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

   1. associate-*r* 56.1%

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

   2. neg-mul-1 56.1%

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

   3. *-commutative 56.1%

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

6. Simplified 56.1%

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

7. Final simplification 56.1%

   \[\leadsto x \cdot \left(-y\right) \]

Alternative 9: 3.7% accurate, 69.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

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

   1. log1p-def 98.8%

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

3. Simplified 98.8%

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

4. Taylor expanded in x around 0 80.2%

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

5. Taylor expanded in y around 0 44.0%

   \[\leadsto \color{blue}{\log 2 + 0.5 \cdot x} \]

6. Taylor expanded in x around inf 3.7%

   \[\leadsto \color{blue}{0.5 \cdot x} \]
7. Step-by-step derivation

   1. *-commutative 3.7%

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

8. Simplified 3.7%

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

9. Final simplification 3.7%

   \[\leadsto x \cdot 0.5 \]

Developer target: 99.9% accurate, 1.0× 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 2023307 
(FPCore (x y)
  :name "Logistic regression 2"
  :precision binary64

  :herbie-target
  (if (<= x 0.0) (- (log (+ 1.0 (exp x))) (* x y)) (- (log (+ 1.0 (exp (- x)))) (* (- x) (- 1.0 y))))

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