b parameter of renormalized beta distribution

Percentage Accurate: 99.9% → 99.9%

Time: 6.5s

Precision: binary64

Cost: 832

• 41.8% of points produce a very large (infinite) output. You may want to add a precondition.

\[\left(0 < m \land 0 < v\right) \land v < 0.25\]

Math

\[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]

↓

\[\left(1 - m\right) \cdot \left(\frac{m}{\frac{v}{1 - m}} + -1\right) \]

FPCore

(FPCore (m v) :precision binary64 (* (- (/ (* m (- 1.0 m)) v) 1.0) (- 1.0 m)))

↓

(FPCore (m v) :precision binary64 (* (- 1.0 m) (+ (/ m (/ v (- 1.0 m))) -1.0)))

C

double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
}

↓

double code(double m, double v) {
	return (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0);
}

Fortran

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (((m * (1.0d0 - m)) / v) - 1.0d0) * (1.0d0 - m)
end function

↓

real(8) function code(m, v)
    real(8), intent (in) :: m
    real(8), intent (in) :: v
    code = (1.0d0 - m) * ((m / (v / (1.0d0 - m))) + (-1.0d0))
end function

Java

public static double code(double m, double v) {
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
}

↓

public static double code(double m, double v) {
	return (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0);
}

Python

def code(m, v):
	return (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m)

↓

def code(m, v):
	return (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0)

Julia

function code(m, v)
	return Float64(Float64(Float64(Float64(m * Float64(1.0 - m)) / v) - 1.0) * Float64(1.0 - m))
end

↓

function code(m, v)
	return Float64(Float64(1.0 - m) * Float64(Float64(m / Float64(v / Float64(1.0 - m))) + -1.0))
end

MATLAB

function tmp = code(m, v)
	tmp = (((m * (1.0 - m)) / v) - 1.0) * (1.0 - m);
end

↓

function tmp = code(m, v)
	tmp = (1.0 - m) * ((m / (v / (1.0 - m))) + -1.0);
end

Wolfram

code[m_, v_] := N[(N[(N[(N[(m * N[(1.0 - m), $MachinePrecision]), $MachinePrecision] / v), $MachinePrecision] - 1.0), $MachinePrecision] * N[(1.0 - m), $MachinePrecision]), $MachinePrecision]

↓

code[m_, v_] := N[(N[(1.0 - m), $MachinePrecision] * N[(N[(m / N[(v / N[(1.0 - m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]

2. Simplified 100.0%

   \[\leadsto \color{blue}{\left(1 - m\right) \cdot \left(\frac{m}{\frac{v}{1 - m}} + -1\right)} \]
   Step-by-step derivation

   [Start] 100.0%	\[ \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right) \]
   *-commutative [=>] 100.0%	\[ \color{blue}{\left(1 - m\right) \cdot \left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right)} \]
   sub-neg [=>] 100.0%	\[ \left(1 - m\right) \cdot \color{blue}{\left(\frac{m \cdot \left(1 - m\right)}{v} + \left(-1\right)\right)} \]
   associate-/l* [=>] 100.0%	\[ \left(1 - m\right) \cdot \left(\color{blue}{\frac{m}{\frac{v}{1 - m}}} + \left(-1\right)\right) \]
   metadata-eval [=>] 100.0%	\[ \left(1 - m\right) \cdot \left(\frac{m}{\frac{v}{1 - m}} + \color{blue}{-1}\right) \]

3. Final simplification 100.0%

   \[\leadsto \left(1 - m\right) \cdot \left(\frac{m}{\frac{v}{1 - m}} + -1\right) \]

Alternatives

Alternative 1
Accuracy	99.9%
Cost	832

\[\left(1 - m\right) \cdot \left(\frac{m}{\frac{v}{1 - m}} + -1\right) \]

Alternative 2
Accuracy	99.6%
Cost	836

\[\begin{array}{l} \mathbf{if}\;m \leq 1.62 \cdot 10^{-27}:\\ \;\;\;\;-1 + \left(m + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{m + \left(m \cdot m\right) \cdot \left(m + -2\right)}{v}\\ \end{array} \]

Alternative 3
Accuracy	99.9%
Cost	832

\[\left(1 - m\right) \cdot \left(-1 + \left(1 - m\right) \cdot \frac{m}{v}\right) \]

Alternative 4
Accuracy	84.3%
Cost	712

\[\begin{array}{l} \mathbf{if}\;m \leq 2.15 \cdot 10^{-181}:\\ \;\;\;\;-1\\ \mathbf{elif}\;m \leq 2.6:\\ \;\;\;\;\frac{m}{v}\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(m \cdot \frac{m}{v}\right)\\ \end{array} \]

Alternative 5
Accuracy	97.8%
Cost	708

\[\begin{array}{l} \mathbf{if}\;m \leq 0.43:\\ \;\;\;\;\left(1 - m\right) \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(m \cdot \frac{m}{v}\right)\\ \end{array} \]

Alternative 6
Accuracy	98.3%
Cost	708

\[\begin{array}{l} \mathbf{if}\;m \leq 1.62:\\ \;\;\;\;\left(1 - m\right) \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{m}{v} \cdot \left(m \cdot \left(m + -2\right)\right)\\ \end{array} \]

Alternative 7
Accuracy	98.3%
Cost	708

\[\begin{array}{l} \mathbf{if}\;m \leq 1.62:\\ \;\;\;\;\left(1 - m\right) \cdot \left(-1 + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(m \cdot m\right) \cdot \left(m + -2\right)}{v}\\ \end{array} \]

Alternative 8
Accuracy	97.8%
Cost	580

\[\begin{array}{l} \mathbf{if}\;m \leq 2.6:\\ \;\;\;\;-1 + \left(m + \frac{m}{v}\right)\\ \mathbf{else}:\\ \;\;\;\;m \cdot \left(m \cdot \frac{m}{v}\right)\\ \end{array} \]

Alternative 9
Accuracy	61.8%
Cost	324

\[\begin{array}{l} \mathbf{if}\;m \leq 3.8 \cdot 10^{-181}:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;\frac{m}{v}\\ \end{array} \]

Alternative 10
Accuracy	25.9%
Cost	192

\[m + -1 \]

Alternative 11
Accuracy	23.4%
Cost	64

\[-1 \]

Reproduce

herbie shell --seed 2023165 
(FPCore (m v)
  :name "b parameter of renormalized beta distribution"
  :precision binary64
  :pre (and (and (< 0.0 m) (< 0.0 v)) (< v 0.25))
  (* (- (/ (* m (- 1.0 m)) v) 1.0) (- 1.0 m)))