Quotient of sum of exps

Average Error: 0.7 → 1.3

Time: 5.7s

Precision: binary64

Cost: 26184

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

double code(double a, double b) {
	double tmp;
	if (exp(b) <= 0.999999999999995) {
		tmp = 1.0 / (exp(b) + 1.0);
	} else if (exp(b) <= 1.0) {
		tmp = exp(a) / (exp(a) + 1.0);
	} else {
		tmp = 0.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) :: tmp
    if (exp(b) <= 0.999999999999995d0) then
        tmp = 1.0d0 / (exp(b) + 1.0d0)
    else if (exp(b) <= 1.0d0) then
        tmp = exp(a) / (exp(a) + 1.0d0)
    else
        tmp = 0.0d0
    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 tmp;
	if (Math.exp(b) <= 0.999999999999995) {
		tmp = 1.0 / (Math.exp(b) + 1.0);
	} else if (Math.exp(b) <= 1.0) {
		tmp = Math.exp(a) / (Math.exp(a) + 1.0);
	} else {
		tmp = 0.0;
	}
	return tmp;
}

Python

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

↓

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

Julia

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

↓

function code(a, b)
	tmp = 0.0
	if (exp(b) <= 0.999999999999995)
		tmp = Float64(1.0 / Float64(exp(b) + 1.0));
	elseif (exp(b) <= 1.0)
		tmp = Float64(exp(a) / Float64(exp(a) + 1.0));
	else
		tmp = 0.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)
	tmp = 0.0;
	if (exp(b) <= 0.999999999999995)
		tmp = 1.0 / (exp(b) + 1.0);
	elseif (exp(b) <= 1.0)
		tmp = exp(a) / (exp(a) + 1.0);
	else
		tmp = 0.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_] := If[LessEqual[N[Exp[b], $MachinePrecision], 0.999999999999995], N[(1.0 / N[(N[Exp[b], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[Exp[b], $MachinePrecision], 1.0], N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], 0.0]]

Target

Original	0.7
Target	0.0
Herbie	1.3

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

Derivation

1. Split input into 3 regimes

2. if (exp.f64 b) < 0.999999999999995004

   1. Initial program 2.0

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

   2. Taylor expanded in a around 0 2.4

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

   if 0.999999999999995004 < (exp.f64 b) < 1

   1. Initial program 0.4

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

   2. Taylor expanded in b around 0 0.4

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

   if 1 < (exp.f64 b)

   1. Initial program 0.4

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

   2. Taylor expanded in a around 0 1.5

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

   3. Taylor expanded in b around 0 59.1

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

   4. Applied egg-rr 4.7

      \[\leadsto \color{blue}{\left(1 + \frac{1}{2 + b}\right) - 1} \]

   5. Taylor expanded in b around inf 2.1

      \[\leadsto \color{blue}{1} - 1 \]
3. Recombined 3 regimes into one program.

4. Final simplification 1.3

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

Alternatives

Alternative 1
Error	1.9
Cost	19656

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

Alternative 2
Error	0.7
Cost	19520

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

Alternative 3
Error	11.1
Cost	6724

\[\begin{array}{l} \mathbf{if}\;b \leq 9.8 \cdot 10^{-17}:\\ \;\;\;\;\frac{e^{a}}{2}\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 4
Error	12.9
Cost	708

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

Alternative 5
Error	21.7
Cost	452

\[\begin{array}{l} \mathbf{if}\;b \leq 9.8 \cdot 10^{-17}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 6
Error	21.8
Cost	196

\[\begin{array}{l} \mathbf{if}\;b \leq 9.8 \cdot 10^{-17}:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 7
Error	38.6
Cost	64

\[0.5 \]

Reproduce

herbie shell --seed 2022340 
(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))))