Logistic regression 2

Percentage Accurate: 99.3% → 98.7%

Time: 7.6s

Alternatives: 7

Speedup: 1.0×

• could not determine a ground truth

  1. x = 7.538920791390774e+217
  2. y = 1.181235991314458e+223

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.3% 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: 98.7% accurate, 1.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -8e7

   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(y \cdot x\right)} \]
   5. Step-by-step derivation

      1. associate-*r* 100.0%

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

      2. *-commutative 100.0%

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

      3. mul-1-neg 100.0%

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

   6. Simplified 100.0%

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

   if -8e7 < x

   1. Initial program 99.5%

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

      1. log1p-def 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in x around 0 99.6%

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

4. Final simplification 99.7%

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

Alternative 2: 99.3% 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 99.6%

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

   1. sub-neg 99.6%

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

   2. +-commutative 99.6%

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

   3. distribute-rgt-neg-in 99.6%

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

   4. fma-def 99.6%

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

   5. log1p-def 99.6%

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

3. Simplified 99.6%

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

4. Final simplification 99.6%

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

Alternative 3: 99.3% 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 99.6%

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

   1. log1p-def 99.6%

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

3. Simplified 99.6%

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

4. Final simplification 99.6%

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

Alternative 4: 98.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -80000000:\\ \;\;\;\;-x \cdot y\\ \mathbf{else}:\\ \;\;\;\;\log 2 - x \cdot y\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

   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(y \cdot x\right)} \]
   5. Step-by-step derivation

      1. associate-*r* 100.0%

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

      2. *-commutative 100.0%

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

      3. mul-1-neg 100.0%

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

   6. Simplified 100.0%

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

   if -8e7 < x

   1. Initial program 99.5%

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

      1. log1p-def 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in x around 0 99.4%

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

4. Final simplification 99.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -80000000:\\ \;\;\;\;-x \cdot y\\ \mathbf{else}:\\ \;\;\;\;\log 2 - x \cdot y\\ \end{array} \]

Alternative 5: 82.4% accurate, 2.0× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.5e-30) (- (* x y)) (if (<= x 1e-74) (log 2.0) (* x (- 0.5 y)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.5e-30) {
		tmp = -(x * y);
	} else if (x <= 1e-74) {
		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 <= (-3.5d-30)) then
        tmp = -(x * y)
    else if (x <= 1d-74) 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 <= -3.5e-30) {
		tmp = -(x * y);
	} else if (x <= 1e-74) {
		tmp = Math.log(2.0);
	} else {
		tmp = x * (0.5 - y);
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.5e-30)
		tmp = Float64(-Float64(x * y));
	elseif (x <= 1e-74)
		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 <= -3.5e-30)
		tmp = -(x * y);
	elseif (x <= 1e-74)
		tmp = log(2.0);
	else
		tmp = x * (0.5 - y);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -3.5000000000000003e-30

   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 97.8%

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

      1. associate-*r* 97.8%

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

      2. *-commutative 97.8%

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

      3. mul-1-neg 97.8%

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

   6. Simplified 97.8%

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

   if -3.5000000000000003e-30 < x < 9.99999999999999958e-75

   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 82.5%

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

   if 9.99999999999999958e-75 < x

   1. Initial program 96.5%

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

      1. log1p-def 96.5%

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

   3. Simplified 96.5%

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

   4. Taylor expanded in x around 0 100.0%

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

   5. Taylor expanded in x around inf 72.7%

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

4. Final simplification 86.5%

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

Alternative 6: 53.1% accurate, 51.8× speedup

Math

\[\begin{array}{l} \\ -x \cdot y \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(-Float64(x * y))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. log1p-def 99.6%

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

3. Simplified 99.6%

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

4. Taylor expanded in x around inf 50.5%

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

   1. associate-*r* 50.5%

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

   2. *-commutative 50.5%

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

   3. mul-1-neg 50.5%

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

6. Simplified 50.5%

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

7. Final simplification 50.5%

   \[\leadsto -x \cdot y \]

Alternative 7: 3.6% 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 99.6%

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

   1. log1p-def 99.6%

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

3. Simplified 99.6%

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

4. Taylor expanded in x around 0 83.7%

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

5. Taylor expanded in y around 0 51.6%

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

6. Taylor expanded in x around inf 3.4%

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

   1. *-commutative 3.4%

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

8. Simplified 3.4%

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

9. Final simplification 3.4%

   \[\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 2023172 
(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)))