Average Error: 0.5 → 0.6
Time: 2.5s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y) {
	return ((double) (((double) log(((double) (1.0 + ((double) exp(x)))))) - ((double) (x * y))));
}

↓
double code(double x, double y) {
	return ((double) (((double) (((double) log(((double) (((double) pow(1.0, 3.0)) + ((double) pow(((double) exp(x)), 3.0)))))) - ((double) log(((double) (((double) (1.0 * 1.0)) + ((double) (((double) exp(x)) * ((double) (((double) exp(x)) - 1.0)))))))))) - ((double) (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.5
Target0.1
Herbie0.6
\[\]
Derivation
  1. Initial program 0.5
    \[\]
  2. Using strategy rm
  3. Applied flip3-+0.6
    \[\leadsto \]
  4. Applied log-div0.6
    \[\leadsto \]
  5. Simplified0.6
    \[\leadsto \]
  6. Final simplification0.6
    \[\leadsto \]
Reproduce
herbie shell --seed 2020179 
(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 (neg x)))) (* (neg x) (- 1.0 y))))

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