Quotient of sum of exps

Average Error: 0.7 → 1.1

Time: 4.8s

Precision: binary64

Cost: 32392

Math

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

↓

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

FPCore

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

↓

(FPCore (a b)
 :precision binary64
 (if (<= (exp b) 0.0)
   (+ (exp b) 1.0)
   (if (<= (exp b) 2e+55)
     (/ (exp a) (+ (exp a) 1.0))
     (exp (- (log1p (exp b)))))))

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.0) {
		tmp = exp(b) + 1.0;
	} else if (exp(b) <= 2e+55) {
		tmp = exp(a) / (exp(a) + 1.0);
	} else {
		tmp = exp(-log1p(exp(b)));
	}
	return tmp;
}

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.0) {
		tmp = Math.exp(b) + 1.0;
	} else if (Math.exp(b) <= 2e+55) {
		tmp = Math.exp(a) / (Math.exp(a) + 1.0);
	} else {
		tmp = Math.exp(-Math.log1p(Math.exp(b)));
	}
	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.0:
		tmp = math.exp(b) + 1.0
	elif math.exp(b) <= 2e+55:
		tmp = math.exp(a) / (math.exp(a) + 1.0)
	else:
		tmp = math.exp(-math.log1p(math.exp(b)))
	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.0)
		tmp = Float64(exp(b) + 1.0);
	elseif (exp(b) <= 2e+55)
		tmp = Float64(exp(a) / Float64(exp(a) + 1.0));
	else
		tmp = exp(Float64(-log1p(exp(b))));
	end
	return 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.0], N[(N[Exp[b], $MachinePrecision] + 1.0), $MachinePrecision], If[LessEqual[N[Exp[b], $MachinePrecision], 2e+55], N[(N[Exp[a], $MachinePrecision] / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[Exp[(-N[Log[1 + N[Exp[b], $MachinePrecision]], $MachinePrecision])], $MachinePrecision]]]

Target

Original	0.7
Target	0.0
Herbie	1.1

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

Derivation

1. Split input into 3 regimes

2. if (exp.f64 b) < 0.0

   1. Initial program 1.9

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

   2. Applied egg-rr 1.9

      \[\leadsto \color{blue}{e^{a - \log \left(e^{a} + e^{b}\right)}} \]

   3. Taylor expanded in a around 0 0.7

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

   4. Simplified 0.7

      \[\leadsto e^{\color{blue}{-\mathsf{log1p}\left(e^{b}\right)}} \]
      Proof
      (neg.f64 (log1p.f64 (exp.f64 b))): 0 points increase in error, 0 points decrease in error
      (neg.f64 (Rewrite<= log1p-def_binary64 (log.f64 (+.f64 1 (exp.f64 b))))): 2 points increase in error, 4 points decrease in error
      (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (log.f64 (+.f64 1 (exp.f64 b))))): 0 points increase in error, 0 points decrease in error

   5. Applied egg-rr 0.7

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

   if 0.0 < (exp.f64 b) < 2.00000000000000002e55

   1. Initial program 0.5

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

   2. Taylor expanded in b around 0 1.7

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

   if 2.00000000000000002e55 < (exp.f64 b)

   1. Initial program 0.3

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

   2. Applied egg-rr 0.0

      \[\leadsto \color{blue}{e^{a - \log \left(e^{a} + e^{b}\right)}} \]

   3. Taylor expanded in a around 0 0.0

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

   4. Simplified 0.0

      \[\leadsto e^{\color{blue}{-\mathsf{log1p}\left(e^{b}\right)}} \]
      Proof
      (neg.f64 (log1p.f64 (exp.f64 b))): 0 points increase in error, 0 points decrease in error
      (neg.f64 (Rewrite<= log1p-def_binary64 (log.f64 (+.f64 1 (exp.f64 b))))): 2 points increase in error, 4 points decrease in error
      (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (log.f64 (+.f64 1 (exp.f64 b))))): 0 points increase in error, 0 points decrease in error
3. Recombined 3 regimes into one program.

4. Final simplification 1.1

   \[\leadsto \begin{array}{l} \mathbf{if}\;e^{b} \leq 0:\\ \;\;\;\;e^{b} + 1\\ \mathbf{elif}\;e^{b} \leq 2 \cdot 10^{+55}:\\ \;\;\;\;\frac{e^{a}}{e^{a} + 1}\\ \mathbf{else}:\\ \;\;\;\;e^{-\mathsf{log1p}\left(e^{b}\right)}\\ \end{array} \]

Alternatives

Alternative 1
Error	1.1
Cost	26184

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

Alternative 2
Error	0.6
Cost	25920

\[e^{a - \log \left(e^{a} + e^{b}\right)} \]

Alternative 3
Error	0.7
Cost	19520

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

Alternative 4
Error	0.8
Cost	13252

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

Alternative 5
Error	13.1
Cost	6860

\[\begin{array}{l} \mathbf{if}\;b \leq -0.35554432063971897:\\ \;\;\;\;e^{a}\\ \mathbf{elif}\;b \leq -1.7064734515785458 \cdot 10^{-143}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;b \leq -1.8250646624268664 \cdot 10^{-171}:\\ \;\;\;\;e^{a}\\ \mathbf{elif}\;b \leq 1.8736831406953582 \cdot 10^{-11}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 6
Error	12.9
Cost	6860

\[\begin{array}{l} \mathbf{if}\;b \leq -51447.591066340196:\\ \;\;\;\;e^{b} + 1\\ \mathbf{elif}\;b \leq -1.7064734515785458 \cdot 10^{-143}:\\ \;\;\;\;0.5\\ \mathbf{elif}\;b \leq -1.8250646624268664 \cdot 10^{-171}:\\ \;\;\;\;e^{a}\\ \mathbf{elif}\;b \leq 1.8736831406953582 \cdot 10^{-11}:\\ \;\;\;\;0.5 + a \cdot 0.25\\ \mathbf{else}:\\ \;\;\;\;0\\ \end{array} \]

Alternative 7
Error	13.7
Cost	708

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

Alternative 8
Error	22.0
Cost	452

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

Alternative 9
Error	22.2
Cost	196

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

Alternative 10
Error	39.0
Cost	64

\[0.5 \]

Reproduce

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