symmetry log of sum of exp

Average Error: 46.1% → 0.85%

Time: 16.7s

Precision: binary64

Cost: 25924

\[ \begin{array}{c}[a, b] = \mathsf{sort}([a, b])\\ \end{array} \]

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

Java

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

↓

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

Python

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

↓

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

Julia

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

↓

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

Wolfram

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

↓

code[a_, b_] := If[LessEqual[N[Exp[a], $MachinePrecision], 0.0], N[(b / N[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision], N[Log[1 + N[(N[Exp[a], $MachinePrecision] + N[(Exp[b] - 1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (exp.f64 a) < 0.0

   1. Initial program 91.12

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

   2. Taylor expanded in b around 0 0

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

   3. Simplified 0

      \[\leadsto \color{blue}{\mathsf{log1p}\left(e^{a}\right) + \frac{b}{1 + e^{a}}} \]
      Proof

      [Start] 0	\[ \log \left(1 + e^{a}\right) + \frac{b}{1 + e^{a}} \]
      log1p-def [=>] 0	\[ \color{blue}{\mathsf{log1p}\left(e^{a}\right)} + \frac{b}{1 + e^{a}} \]

   4. Taylor expanded in b around inf 0

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

   if 0.0 < (exp.f64 a)

   1. Initial program 2.14

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

   2. Applied egg-rr 3.55

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

   3. Simplified 1.68

      \[\leadsto \color{blue}{\mathsf{log1p}\left(e^{a} + \mathsf{expm1}\left(b\right)\right)} \]
      Proof

      [Start] 3.55	\[ \log \left(\sqrt{e^{a} + e^{b}}\right) + \log \left(\sqrt{e^{a} + e^{b}}\right) \]
      log-prod [<=] 4.35	\[ \color{blue}{\log \left(\sqrt{e^{a} + e^{b}} \cdot \sqrt{e^{a} + e^{b}}\right)} \]
      rem-square-sqrt [=>] 2.14	\[ \log \color{blue}{\left(e^{a} + e^{b}\right)} \]
      log1p-expm1 [<=] 2.14	\[ \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\log \left(e^{a} + e^{b}\right)\right)\right)} \]
      expm1-def [<=] 2.14	\[ \mathsf{log1p}\left(\color{blue}{e^{\log \left(e^{a} + e^{b}\right)} - 1}\right) \]
      rem-exp-log [=>] 2.14	\[ \mathsf{log1p}\left(\color{blue}{\left(e^{a} + e^{b}\right)} - 1\right) \]
      associate--l+ [=>] 1.76	\[ \mathsf{log1p}\left(\color{blue}{e^{a} + \left(e^{b} - 1\right)}\right) \]
      expm1-def [=>] 1.68	\[ \mathsf{log1p}\left(e^{a} + \color{blue}{\mathsf{expm1}\left(b\right)}\right) \]

3. Recombined 2 regimes into one program.

4. Final simplification 0.85

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

Alternatives

Alternative 1
Error	1.05%
Cost	25924

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

Alternative 2
Error	1.65%
Cost	20036

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

Alternative 3
Error	1.59%
Cost	19648

\[\mathsf{log1p}\left(e^{a}\right) + \frac{b}{e^{a} + 1} \]

Alternative 4
Error	2.29%
Cost	13636

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

Alternative 5
Error	2.76%
Cost	13508

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

Alternative 6
Error	2.38%
Cost	13508

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

Alternative 7
Error	2.87%
Cost	13252

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

Alternative 8
Error	43%
Cost	6852

\[\begin{array}{l} \mathbf{if}\;a \leq -175:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;b \cdot 0.5 + \log 2\\ \end{array} \]

Alternative 9
Error	43.09%
Cost	6724

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

Alternative 10
Error	43.65%
Cost	6596

\[\begin{array}{l} \mathbf{if}\;a \leq -130:\\ \;\;\;\;b \cdot 0.5\\ \mathbf{else}:\\ \;\;\;\;\log 2\\ \end{array} \]

Alternative 11
Error	88.06%
Cost	192

\[b \cdot 0.5 \]

Reproduce

herbie shell --seed 2023090 
(FPCore (a b)
  :name "symmetry log of sum of exp"
  :precision binary64
  (log (+ (exp a) (exp b))))