Logistic regression 2

Percentage Accurate: 99.4% → 99.5%

Time: 12.5s

Alternatives: 8

Speedup: 1.0×

• could not determine a ground truth

  1. x = 7.725198566575825e+306
  2. y = 8.971018035184052e-144

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-define 98.9%

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

   6. log1p-define 98.9%

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

3. Simplified 98.9%

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

5. Final simplification 98.9%

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

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-define 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. Add Preprocessing

5. Final simplification 98.8%

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

Alternative 3: 78.2% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-131}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 1.1 \cdot 10^{-99}:\\ \;\;\;\;\log 2\\ \mathbf{elif}\;x \leq 3.5 \cdot 10^{-55}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \mathbf{else}:\\ \;\;\;\;\log 2 + x \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.5e-131)
   (* x (- y))
   (if (<= x 1.1e-99)
     (log 2.0)
     (if (<= x 3.5e-55) (* x (- 0.5 y)) (+ (log 2.0) (* x 0.5))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.5e-131) {
		tmp = x * -y;
	} else if (x <= 1.1e-99) {
		tmp = log(2.0);
	} else if (x <= 3.5e-55) {
		tmp = x * (0.5 - y);
	} else {
		tmp = log(2.0) + (x * 0.5);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-3.5d-131)) then
        tmp = x * -y
    else if (x <= 1.1d-99) then
        tmp = log(2.0d0)
    else if (x <= 3.5d-55) then
        tmp = x * (0.5d0 - y)
    else
        tmp = log(2.0d0) + (x * 0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -3.5e-131) {
		tmp = x * -y;
	} else if (x <= 1.1e-99) {
		tmp = Math.log(2.0);
	} else if (x <= 3.5e-55) {
		tmp = x * (0.5 - y);
	} else {
		tmp = Math.log(2.0) + (x * 0.5);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3.5e-131:
		tmp = x * -y
	elif x <= 1.1e-99:
		tmp = math.log(2.0)
	elif x <= 3.5e-55:
		tmp = x * (0.5 - y)
	else:
		tmp = math.log(2.0) + (x * 0.5)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.5e-131)
		tmp = Float64(x * Float64(-y));
	elseif (x <= 1.1e-99)
		tmp = log(2.0);
	elseif (x <= 3.5e-55)
		tmp = Float64(x * Float64(0.5 - y));
	else
		tmp = Float64(log(2.0) + Float64(x * 0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3.5e-131)
		tmp = x * -y;
	elseif (x <= 1.1e-99)
		tmp = log(2.0);
	elseif (x <= 3.5e-55)
		tmp = x * (0.5 - y);
	else
		tmp = log(2.0) + (x * 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.5e-131], N[(x * (-y)), $MachinePrecision], If[LessEqual[x, 1.1e-99], N[Log[2.0], $MachinePrecision], If[LessEqual[x, 3.5e-55], N[(x * N[(0.5 - y), $MachinePrecision]), $MachinePrecision], N[(N[Log[2.0], $MachinePrecision] + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if x < -3.5000000000000002e-131

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 91.9%

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

      1. associate-*r* 91.9%

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

      2. neg-mul-1 91.9%

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

      3. *-commutative 91.9%

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

   5. Simplified 91.9%

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

   if -3.5000000000000002e-131 < x < 1.10000000000000002e-99

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 86.8%

      \[\leadsto \color{blue}{\log \left(1 + e^{x}\right)} \]
   4. Step-by-step derivation

      1. log1p-define 86.8%

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

   5. Simplified 86.8%

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

   6. Taylor expanded in x around 0 86.8%

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

   if 1.10000000000000002e-99 < x < 3.50000000000000025e-55

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 100.0%

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

   4. Taylor expanded in x around inf 70.6%

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

   if 3.50000000000000025e-55 < x

   1. Initial program 83.8%

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

   3. Taylor expanded in y around 0 62.6%

      \[\leadsto \color{blue}{\log \left(1 + e^{x}\right)} \]
   4. Step-by-step derivation

      1. log1p-define 62.6%

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

   5. Simplified 62.6%

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

   6. Taylor expanded in x around 0 57.0%

      \[\leadsto \color{blue}{\log 2 + 0.5 \cdot x} \]
3. Recombined 4 regimes into one program.

4. Final simplification 86.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-131}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 1.1 \cdot 10^{-99}:\\ \;\;\;\;\log 2\\ \mathbf{elif}\;x \leq 3.5 \cdot 10^{-55}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \mathbf{else}:\\ \;\;\;\;\log 2 + x \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 78.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-131}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 1.1 \cdot 10^{-99}:\\ \;\;\;\;\log 2\\ \mathbf{elif}\;x \leq 5.6 \cdot 10^{-55}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \mathbf{else}:\\ \;\;\;\;\log 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.5e-131)
   (* x (- y))
   (if (<= x 1.1e-99)
     (log 2.0)
     (if (<= x 5.6e-55) (* x (- 0.5 y)) (log 2.0)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.5e-131) {
		tmp = x * -y;
	} else if (x <= 1.1e-99) {
		tmp = log(2.0);
	} else if (x <= 5.6e-55) {
		tmp = x * (0.5 - y);
	} 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) :: tmp
    if (x <= (-3.5d-131)) then
        tmp = x * -y
    else if (x <= 1.1d-99) then
        tmp = log(2.0d0)
    else if (x <= 5.6d-55) then
        tmp = x * (0.5d0 - y)
    else
        tmp = log(2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -3.5e-131) {
		tmp = x * -y;
	} else if (x <= 1.1e-99) {
		tmp = Math.log(2.0);
	} else if (x <= 5.6e-55) {
		tmp = x * (0.5 - y);
	} else {
		tmp = Math.log(2.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -3.5e-131:
		tmp = x * -y
	elif x <= 1.1e-99:
		tmp = math.log(2.0)
	elif x <= 5.6e-55:
		tmp = x * (0.5 - y)
	else:
		tmp = math.log(2.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.5e-131)
		tmp = Float64(x * Float64(-y));
	elseif (x <= 1.1e-99)
		tmp = log(2.0);
	elseif (x <= 5.6e-55)
		tmp = Float64(x * Float64(0.5 - y));
	else
		tmp = log(2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -3.5e-131)
		tmp = x * -y;
	elseif (x <= 1.1e-99)
		tmp = log(2.0);
	elseif (x <= 5.6e-55)
		tmp = x * (0.5 - y);
	else
		tmp = log(2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.5e-131], N[(x * (-y)), $MachinePrecision], If[LessEqual[x, 1.1e-99], N[Log[2.0], $MachinePrecision], If[LessEqual[x, 5.6e-55], N[(x * N[(0.5 - y), $MachinePrecision]), $MachinePrecision], N[Log[2.0], $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.5000000000000002e-131

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 91.9%

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

      1. associate-*r* 91.9%

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

      2. neg-mul-1 91.9%

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

      3. *-commutative 91.9%

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

   5. Simplified 91.9%

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

   if -3.5000000000000002e-131 < x < 1.10000000000000002e-99 or 5.59999999999999968e-55 < x

   1. Initial program 97.9%

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

   3. Taylor expanded in y around 0 83.6%

      \[\leadsto \color{blue}{\log \left(1 + e^{x}\right)} \]
   4. Step-by-step derivation

      1. log1p-define 83.6%

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

   5. Simplified 83.6%

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

   6. Taylor expanded in x around 0 82.5%

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

   if 1.10000000000000002e-99 < x < 5.59999999999999968e-55

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 100.0%

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

   4. Taylor expanded in x around inf 70.6%

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

4. Final simplification 86.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{-131}:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{elif}\;x \leq 1.1 \cdot 10^{-99}:\\ \;\;\;\;\log 2\\ \mathbf{elif}\;x \leq 5.6 \cdot 10^{-55}:\\ \;\;\;\;x \cdot \left(0.5 - y\right)\\ \mathbf{else}:\\ \;\;\;\;\log 2\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 99.3% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -880

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. 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)} \]

   5. Simplified 100.0%

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

   if -880 < 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 97.4%

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

      1. *-commutative 97.4%

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

   5. Simplified 97.4%

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

4. Final simplification 98.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -880:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;\log 2 + x \cdot \left(\left(0.5 + x \cdot 0.125\right) - y\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 -880:\\ \;\;\;\;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 -880.0) (* x (- y)) (+ (log 2.0) (* x (- 0.5 y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -880.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 <= (-880.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 <= -880.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 <= -880.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 <= -880.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 <= -880.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, -880.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 < -880

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. 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)} \]

   5. Simplified 100.0%

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

   if -880 < 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 97.3%

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

4. Final simplification 98.2%

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

Alternative 7: 98.6% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

code[x_, y_] := If[LessEqual[x, -880.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 < -880

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 100.0%

      \[\leadsto \color{blue}{-1 \cdot \left(x \cdot y\right)} \]
   4. 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)} \]

   5. Simplified 100.0%

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

   if -880 < 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 96.9%

      \[\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 -880:\\ \;\;\;\;x \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;\log 2 - x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 50.8% 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. Add Preprocessing

3. Taylor expanded in x around inf 50.4%

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

   1. associate-*r* 50.4%

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

   2. neg-mul-1 50.4%

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

   3. *-commutative 50.4%

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

5. Simplified 50.4%

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

6. Final simplification 50.4%

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

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 2024095 
(FPCore (x y)
  :name "Logistic regression 2"
  :precision binary64

  :alt
  (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)))