Average Error: 0.3 → 0.3
Time: 4.8s
Precision: binary64
\[\log \left(1 + e^{x}\right) - x \cdot y \]
↓
\[\mathsf{log1p}\left(e^{x}\right) - x \cdot y \]
\log \left(1 + e^{x}\right) - x \cdot y
↓
\mathsf{log1p}\left(e^{x}\right) - x \cdot y

(FPCore (x y) :precision binary64 (- (log (+ 1.0 (exp x))) (* x y)))
↓
(FPCore (x y) :precision binary64 (- (log1p (exp x)) (* x y)))
double code(double x, double y) {
	return log(1.0 + exp(x)) - (x * y);
}
↓
double code(double x, double y) {
	return log1p(exp(x)) - (x * y);
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.3
Target0.1
Herbie0.3
\[\begin{array}{l} \mathbf{if}\;x \leq 0:\\ \;\;\;\;\log \left(1 + e^{x}\right) - x \cdot y\\ \mathbf{else}:\\ \;\;\;\;\log \left(1 + e^{-x}\right) - \left(-x\right) \cdot \left(1 - y\right)\\ \end{array} \]

Derivation

  1. Initial program 0.3

    \[\log \left(1 + e^{x}\right) - x \cdot y \]

  2. Simplified0.3

    \[\leadsto \color{blue}{\mathsf{log1p}\left(e^{x}\right) - x \cdot y} \]

  3. Final simplification0.3

    \[\leadsto \mathsf{log1p}\left(e^{x}\right) - x \cdot y \]

Reproduce

herbie shell --seed 2022067 
(FPCore (x y)
  :name "Logistic regression 2"
  :precision binary64

  :herbie-target
  (if (<= x 0.0) (- (log (+ 1.0 (exp x))) (* x y)) (- (log (+ 1.0 (exp (- x)))) (* (- x) (- 1.0 y))))

  (- (log (+ 1.0 (exp x))) (* x y)))