Quotient of sum of exps

Average Error: 0.6 → 1.1

Time: 4.7s

Precision: binary64

Cost: 26184

Math

\[\frac{e^{a}}{e^{a} + e^{b}} \]

↓

\[\begin{array}{l} t_0 := \frac{1}{e^{b} + 1}\\ \mathbf{if}\;e^{b} \leq 0:\\ \;\;\;\;t_0\\ \mathbf{elif}\;e^{b} \leq 1:\\ \;\;\;\;\frac{e^{a}}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))

↓

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (/ 1.0 (+ (exp b) 1.0))))
   (if (<= (exp b) 0.0)
     t_0
     (if (<= (exp b) 1.0) (/ (exp a) (+ (exp a) 1.0)) t_0))))

C

double code(double a, double b) {
	return exp(a) / (exp(a) + exp(b));
}

↓

double code(double a, double b) {
	double t_0 = 1.0 / (exp(b) + 1.0);
	double tmp;
	if (exp(b) <= 0.0) {
		tmp = t_0;
	} else if (exp(b) <= 1.0) {
		tmp = exp(a) / (exp(a) + 1.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = exp(a) / (exp(a) + exp(b))
end function

↓

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_0
    real(8) :: tmp
    t_0 = 1.0d0 / (exp(b) + 1.0d0)
    if (exp(b) <= 0.0d0) then
        tmp = t_0
    else if (exp(b) <= 1.0d0) then
        tmp = exp(a) / (exp(a) + 1.0d0)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	return Math.exp(a) / (Math.exp(a) + Math.exp(b));
}

↓

public static double code(double a, double b) {
	double t_0 = 1.0 / (Math.exp(b) + 1.0);
	double tmp;
	if (Math.exp(b) <= 0.0) {
		tmp = t_0;
	} else if (Math.exp(b) <= 1.0) {
		tmp = Math.exp(a) / (Math.exp(a) + 1.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(a, b):
	return math.exp(a) / (math.exp(a) + math.exp(b))

↓

def code(a, b):
	t_0 = 1.0 / (math.exp(b) + 1.0)
	tmp = 0
	if math.exp(b) <= 0.0:
		tmp = t_0
	elif math.exp(b) <= 1.0:
		tmp = math.exp(a) / (math.exp(a) + 1.0)
	else:
		tmp = t_0
	return tmp

Julia

function code(a, b)
	return Float64(exp(a) / Float64(exp(a) + exp(b)))
end

↓

function code(a, b)
	t_0 = Float64(1.0 / Float64(exp(b) + 1.0))
	tmp = 0.0
	if (exp(b) <= 0.0)
		tmp = t_0;
	elseif (exp(b) <= 1.0)
		tmp = Float64(exp(a) / Float64(exp(a) + 1.0));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp = code(a, b)
	tmp = exp(a) / (exp(a) + exp(b));
end

↓

function tmp_2 = code(a, b)
	t_0 = 1.0 / (exp(b) + 1.0);
	tmp = 0.0;
	if (exp(b) <= 0.0)
		tmp = t_0;
	elseif (exp(b) <= 1.0)
		tmp = exp(a) / (exp(a) + 1.0);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + N[Exp[b], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[a_, b_] := Block[{t$95$0 = N[(1.0 / N[(N[Exp[b], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[Exp[b], $MachinePrecision], 0.0], t$95$0, If[LessEqual[N[Exp[b], $MachinePrecision], 1.0], N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Target

Original	0.6
Target	0.0
Herbie	1.1

\[\frac{1}{1 + e^{b - a}} \]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 b) < 0.0 or 1 < (exp.f64 b)

   1. Initial program 1.0

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in a around 0 1.2

      \[\leadsto \color{blue}{\frac{1}{1 + e^{b}}} \]

   if 0.0 < (exp.f64 b) < 1

   1. Initial program 0.3

      \[\frac{e^{a}}{e^{a} + e^{b}} \]

   2. Taylor expanded in b around 0 1.0

      \[\leadsto \color{blue}{\frac{e^{a}}{1 + e^{a}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 1.1

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{b} \leq 0:\\ \;\;\;\;\frac{1}{e^{b} + 1}\\ \mathbf{elif}\;e^{b} \leq 1:\\ \;\;\;\;\frac{e^{a}}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{e^{b} + 1}\\ \end{array} \]

Alternatives

Alternative 1
Error	1.6
Cost	19784

\[\begin{array}{l} t_0 := \frac{1}{e^{b} + 1}\\ \mathbf{if}\;e^{b} \leq 0:\\ \;\;\;\;t_0\\ \mathbf{elif}\;e^{b} \leq 1:\\ \;\;\;\;\frac{e^{a}}{b + 2}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 2
Error	0.6
Cost	19520

\[\frac{e^{a}}{e^{a} + e^{b}} \]

Alternative 3
Error	13.6
Cost	7124

\[\begin{array}{l} t_0 := \left(1 + \frac{1}{b + 2}\right) + -1\\ \mathbf{if}\;a \leq -7.189191193610731:\\ \;\;\;\;e^{a}\\ \mathbf{elif}\;a \leq 8.561991758250881 \cdot 10^{-259}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;a \leq 2.967442691265062 \cdot 10^{-248}:\\ \;\;\;\;e^{a}\\ \mathbf{elif}\;a \leq 1.4029083934550938 \cdot 10^{-204}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;a \leq 8.036420440878692 \cdot 10^{-189}:\\ \;\;\;\;e^{a}\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 4
Error	2.3
Cost	6984

\[\begin{array}{l} \mathbf{if}\;b \leq -3049840009.9069276:\\ \;\;\;\;e^{a}\\ \mathbf{elif}\;b \leq 9.977351084602414 \cdot 10^{-11}:\\ \;\;\;\;\frac{e^{a}}{b + 2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 5
Error	23.3
Cost	716

\[\begin{array}{l} t_0 := 0.5 + a \cdot 0.25\\ \mathbf{if}\;a \leq -7.189191193610731:\\ \;\;\;\;0\\ \mathbf{elif}\;a \leq -2.060954882439822 \cdot 10^{-252}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;a \leq 5.7980980826062455 \cdot 10^{-297}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \]

Alternative 6
Error	12.9
Cost	708

\[\begin{array}{l} \mathbf{if}\;a \leq -29139.500613890617:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;\left(1 + \frac{1}{b + 2}\right) + -1\\ \end{array} \]

Alternative 7
Error	23.6
Cost	460

\[\begin{array}{l} \mathbf{if}\;a \leq -9.796199297298505 \cdot 10^{-17}:\\ \;\;\;\;0\\ \mathbf{elif}\;a \leq -2.060954882439822 \cdot 10^{-252}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;a \leq 5.7980980826062455 \cdot 10^{-297}:\\ \;\;\;\;0\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \]

Alternative 8
Error	38.7
Cost	64

\[0.5 \]

Reproduce

herbie shell --seed 2022311 
(FPCore (a b)
  :name "Quotient of sum of exps"
  :precision binary64

  :herbie-target
  (/ 1.0 (+ 1.0 (exp (- b a))))

  (/ (exp a) (+ (exp a) (exp b))))