| Alternative 1 | |
|---|---|
| Accuracy | 98.7% |
| Cost | 32896 |
\[\begin{array}{l}
t_0 := e^{a} + 1\\
\frac{e^{a}}{t_0} - \frac{e^{a}}{{t_0}^{2}} \cdot b
\end{array}
\]

(FPCore (a b) :precision binary64 (/ (exp a) (+ (exp a) (exp b))))
(FPCore (a b) :precision binary64 (let* ((t_0 (+ (exp a) 1.0))) (- (/ (exp a) t_0) (* (/ (exp a) (pow t_0 2.0)) b))))
double code(double a, double b) {
return exp(a) / (exp(a) + exp(b));
}
double code(double a, double b) {
double t_0 = exp(a) + 1.0;
return (exp(a) / t_0) - ((exp(a) / pow(t_0, 2.0)) * b);
}
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
t_0 = exp(a) + 1.0d0
code = (exp(a) / t_0) - ((exp(a) / (t_0 ** 2.0d0)) * b)
end function
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 = Math.exp(a) + 1.0;
return (Math.exp(a) / t_0) - ((Math.exp(a) / Math.pow(t_0, 2.0)) * b);
}
def code(a, b): return math.exp(a) / (math.exp(a) + math.exp(b))
def code(a, b): t_0 = math.exp(a) + 1.0 return (math.exp(a) / t_0) - ((math.exp(a) / math.pow(t_0, 2.0)) * b)
function code(a, b) return Float64(exp(a) / Float64(exp(a) + exp(b))) end
function code(a, b) t_0 = Float64(exp(a) + 1.0) return Float64(Float64(exp(a) / t_0) - Float64(Float64(exp(a) / (t_0 ^ 2.0)) * b)) end
function tmp = code(a, b) tmp = exp(a) / (exp(a) + exp(b)); end
function tmp = code(a, b) t_0 = exp(a) + 1.0; tmp = (exp(a) / t_0) - ((exp(a) / (t_0 ^ 2.0)) * b); end
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[(N[Exp[a], $MachinePrecision] + 1.0), $MachinePrecision]}, N[(N[(N[Exp[a], $MachinePrecision] / t$95$0), $MachinePrecision] - N[(N[(N[Exp[a], $MachinePrecision] / N[Power[t$95$0, 2.0], $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]]
\frac{e^{a}}{e^{a} + e^{b}}
\begin{array}{l}
t_0 := e^{a} + 1\\
\frac{e^{a}}{t_0} - \frac{e^{a}}{{t_0}^{2}} \cdot b
\end{array}
Herbie found 7 alternatives:
| Alternative | Accuracy | Speedup |
|---|
Results
| Original | 92.6% |
|---|---|
| Target | 100.0% |
| Herbie | 98.7% |
Initial program 92.5%
Taylor expanded in b around 0 99.4%
Simplified99.4%
[Start]99.4% | \[ \frac{e^{a}}{1 + e^{a}} + -1 \cdot \frac{e^{a} \cdot b}{{\left(1 + e^{a}\right)}^{2}}
\] |
|---|---|
mul-1-neg [=>]99.4% | \[ \frac{e^{a}}{1 + e^{a}} + \color{blue}{\left(-\frac{e^{a} \cdot b}{{\left(1 + e^{a}\right)}^{2}}\right)}
\] |
unsub-neg [=>]99.4% | \[ \color{blue}{\frac{e^{a}}{1 + e^{a}} - \frac{e^{a} \cdot b}{{\left(1 + e^{a}\right)}^{2}}}
\] |
associate-/l* [=>]99.4% | \[ \frac{e^{a}}{1 + e^{a}} - \color{blue}{\frac{e^{a}}{\frac{{\left(1 + e^{a}\right)}^{2}}{b}}}
\] |
associate-/r/ [=>]99.4% | \[ \frac{e^{a}}{1 + e^{a}} - \color{blue}{\frac{e^{a}}{{\left(1 + e^{a}\right)}^{2}} \cdot b}
\] |
Final simplification99.4%
| Alternative 1 | |
|---|---|
| Accuracy | 98.7% |
| Cost | 32896 |
| Alternative 2 | |
|---|---|
| Accuracy | 97.8% |
| Cost | 13120 |
| Alternative 3 | |
|---|---|
| Accuracy | 96.4% |
| Cost | 6592 |
| Alternative 4 | |
|---|---|
| Accuracy | 62.6% |
| Cost | 704 |
| Alternative 5 | |
|---|---|
| Accuracy | 60.4% |
| Cost | 320 |
| Alternative 6 | |
|---|---|
| Accuracy | 60.8% |
| Cost | 320 |
| Alternative 7 | |
|---|---|
| Accuracy | 60.0% |
| Cost | 64 |
herbie shell --seed 2023277
(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))))