Statistics.Sample:$skurtosis from math-functions-0.1.5.2

Percentage Accurate: 94.6% → 99.9%
Time: 4.9s
Alternatives: 6
Speedup: 1.0×

Specification

?
\[\begin{array}{l} \\ \frac{x}{y \cdot y} - 3 \end{array} \]
(FPCore (x y) :precision binary64 (- (/ x (* y y)) 3.0))
double code(double x, double y) {
	return (x / (y * y)) - 3.0;
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x / (y * y)) - 3.0d0
end function
public static double code(double x, double y) {
	return (x / (y * y)) - 3.0;
}
def code(x, y):
	return (x / (y * y)) - 3.0
function code(x, y)
	return Float64(Float64(x / Float64(y * y)) - 3.0)
end
function tmp = code(x, y)
	tmp = (x / (y * y)) - 3.0;
end
code[x_, y_] := N[(N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]
\begin{array}{l}

\\
\frac{x}{y \cdot y} - 3
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 6 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 94.6% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \frac{x}{y \cdot y} - 3 \end{array} \]
(FPCore (x y) :precision binary64 (- (/ x (* y y)) 3.0))
double code(double x, double y) {
	return (x / (y * y)) - 3.0;
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x / (y * y)) - 3.0d0
end function
public static double code(double x, double y) {
	return (x / (y * y)) - 3.0;
}
def code(x, y):
	return (x / (y * y)) - 3.0
function code(x, y)
	return Float64(Float64(x / Float64(y * y)) - 3.0)
end
function tmp = code(x, y)
	tmp = (x / (y * y)) - 3.0;
end
code[x_, y_] := N[(N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]
\begin{array}{l}

\\
\frac{x}{y \cdot y} - 3
\end{array}

Alternative 1: 99.9% accurate, 0.6× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-289}:\\ \;\;\;\;\frac{\frac{x}{y}}{y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y \cdot y} - 3\\ \end{array} \end{array} \]
(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 5e-289) (/ (/ x y) y) (- (/ x (* y y)) 3.0)))
double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e-289) {
		tmp = (x / y) / y;
	} else {
		tmp = (x / (y * y)) - 3.0;
	}
	return tmp;
}
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 5d-289) then
        tmp = (x / y) / y
    else
        tmp = (x / (y * y)) - 3.0d0
    end if
    code = tmp
end function
public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e-289) {
		tmp = (x / y) / y;
	} else {
		tmp = (x / (y * y)) - 3.0;
	}
	return tmp;
}
def code(x, y):
	tmp = 0
	if (y * y) <= 5e-289:
		tmp = (x / y) / y
	else:
		tmp = (x / (y * y)) - 3.0
	return tmp
function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 5e-289)
		tmp = Float64(Float64(x / y) / y);
	else
		tmp = Float64(Float64(x / Float64(y * y)) - 3.0);
	end
	return tmp
end
function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 5e-289)
		tmp = (x / y) / y;
	else
		tmp = (x / (y * y)) - 3.0;
	end
	tmp_2 = tmp;
end
code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e-289], N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision], N[(N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;y \cdot y \leq 5 \cdot 10^{-289}:\\
\;\;\;\;\frac{\frac{x}{y}}{y}\\

\mathbf{else}:\\
\;\;\;\;\frac{x}{y \cdot y} - 3\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (*.f64 y y) < 5.00000000000000029e-289

    1. Initial program 73.6%

      \[\frac{x}{y \cdot y} - 3 \]
    2. Add Preprocessing
    3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]
    4. Step-by-step derivation
      1. lower-/.f64N/A

        \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]
      2. unpow2N/A

        \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]
      3. lower-*.f6473.6

        \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]
    5. Applied rewrites73.6%

      \[\leadsto \color{blue}{\frac{x}{y \cdot y}} \]
    6. Step-by-step derivation
      1. Applied rewrites99.9%

        \[\leadsto \frac{\frac{x}{y}}{\color{blue}{y}} \]

      if 5.00000000000000029e-289 < (*.f64 y y)

      1. Initial program 99.9%

        \[\frac{x}{y \cdot y} - 3 \]
      2. Add Preprocessing
    7. Recombined 2 regimes into one program.
    8. Add Preprocessing

    Alternative 2: 93.8% accurate, 0.3× speedup?

    \[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{x}{y \cdot y}\\ \mathbf{if}\;t\_0 \leq -3:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_0 \leq 3:\\ \;\;\;\;-3\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]
    (FPCore (x y)
     :precision binary64
     (let* ((t_0 (/ x (* y y))))
       (if (<= t_0 -3.0) t_0 (if (<= t_0 3.0) -3.0 t_0))))
    double code(double x, double y) {
    	double t_0 = x / (y * y);
    	double tmp;
    	if (t_0 <= -3.0) {
    		tmp = t_0;
    	} else if (t_0 <= 3.0) {
    		tmp = -3.0;
    	} else {
    		tmp = t_0;
    	}
    	return tmp;
    }
    
    real(8) function code(x, y)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        real(8) :: t_0
        real(8) :: tmp
        t_0 = x / (y * y)
        if (t_0 <= (-3.0d0)) then
            tmp = t_0
        else if (t_0 <= 3.0d0) then
            tmp = -3.0d0
        else
            tmp = t_0
        end if
        code = tmp
    end function
    
    public static double code(double x, double y) {
    	double t_0 = x / (y * y);
    	double tmp;
    	if (t_0 <= -3.0) {
    		tmp = t_0;
    	} else if (t_0 <= 3.0) {
    		tmp = -3.0;
    	} else {
    		tmp = t_0;
    	}
    	return tmp;
    }
    
    def code(x, y):
    	t_0 = x / (y * y)
    	tmp = 0
    	if t_0 <= -3.0:
    		tmp = t_0
    	elif t_0 <= 3.0:
    		tmp = -3.0
    	else:
    		tmp = t_0
    	return tmp
    
    function code(x, y)
    	t_0 = Float64(x / Float64(y * y))
    	tmp = 0.0
    	if (t_0 <= -3.0)
    		tmp = t_0;
    	elseif (t_0 <= 3.0)
    		tmp = -3.0;
    	else
    		tmp = t_0;
    	end
    	return tmp
    end
    
    function tmp_2 = code(x, y)
    	t_0 = x / (y * y);
    	tmp = 0.0;
    	if (t_0 <= -3.0)
    		tmp = t_0;
    	elseif (t_0 <= 3.0)
    		tmp = -3.0;
    	else
    		tmp = t_0;
    	end
    	tmp_2 = tmp;
    end
    
    code[x_, y_] := Block[{t$95$0 = N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -3.0], t$95$0, If[LessEqual[t$95$0, 3.0], -3.0, t$95$0]]]
    
    \begin{array}{l}
    
    \\
    \begin{array}{l}
    t_0 := \frac{x}{y \cdot y}\\
    \mathbf{if}\;t\_0 \leq -3:\\
    \;\;\;\;t\_0\\
    
    \mathbf{elif}\;t\_0 \leq 3:\\
    \;\;\;\;-3\\
    
    \mathbf{else}:\\
    \;\;\;\;t\_0\\
    
    
    \end{array}
    \end{array}
    
    Derivation
    1. Split input into 2 regimes
    2. if (/.f64 x (*.f64 y y)) < -3 or 3 < (/.f64 x (*.f64 y y))

      1. Initial program 86.1%

        \[\frac{x}{y \cdot y} - 3 \]
      2. Add Preprocessing
      3. Taylor expanded in x around inf

        \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]
      4. Step-by-step derivation
        1. lower-/.f64N/A

          \[\leadsto \color{blue}{\frac{x}{{y}^{2}}} \]
        2. unpow2N/A

          \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]
        3. lower-*.f6484.7

          \[\leadsto \frac{x}{\color{blue}{y \cdot y}} \]
      5. Applied rewrites84.7%

        \[\leadsto \color{blue}{\frac{x}{y \cdot y}} \]

      if -3 < (/.f64 x (*.f64 y y)) < 3

      1. Initial program 100.0%

        \[\frac{x}{y \cdot y} - 3 \]
      2. Add Preprocessing
      3. Taylor expanded in x around 0

        \[\leadsto \color{blue}{-3} \]
      4. Step-by-step derivation
        1. Applied rewrites99.3%

          \[\leadsto \color{blue}{-3} \]
      5. Recombined 2 regimes into one program.
      6. Add Preprocessing

      Alternative 3: 99.9% accurate, 0.5× speedup?

      \[\begin{array}{l} \\ \frac{\frac{1}{y}}{\frac{y}{x}} - 3 \end{array} \]
      (FPCore (x y) :precision binary64 (- (/ (/ 1.0 y) (/ y x)) 3.0))
      double code(double x, double y) {
      	return ((1.0 / y) / (y / x)) - 3.0;
      }
      
      real(8) function code(x, y)
          real(8), intent (in) :: x
          real(8), intent (in) :: y
          code = ((1.0d0 / y) / (y / x)) - 3.0d0
      end function
      
      public static double code(double x, double y) {
      	return ((1.0 / y) / (y / x)) - 3.0;
      }
      
      def code(x, y):
      	return ((1.0 / y) / (y / x)) - 3.0
      
      function code(x, y)
      	return Float64(Float64(Float64(1.0 / y) / Float64(y / x)) - 3.0)
      end
      
      function tmp = code(x, y)
      	tmp = ((1.0 / y) / (y / x)) - 3.0;
      end
      
      code[x_, y_] := N[(N[(N[(1.0 / y), $MachinePrecision] / N[(y / x), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]
      
      \begin{array}{l}
      
      \\
      \frac{\frac{1}{y}}{\frac{y}{x}} - 3
      \end{array}
      
      Derivation
      1. Initial program 93.3%

        \[\frac{x}{y \cdot y} - 3 \]
      2. Add Preprocessing
      3. Step-by-step derivation
        1. lift-/.f64N/A

          \[\leadsto \color{blue}{\frac{x}{y \cdot y}} - 3 \]
        2. clear-numN/A

          \[\leadsto \color{blue}{\frac{1}{\frac{y \cdot y}{x}}} - 3 \]
        3. lift-*.f64N/A

          \[\leadsto \frac{1}{\frac{\color{blue}{y \cdot y}}{x}} - 3 \]
        4. associate-/l*N/A

          \[\leadsto \frac{1}{\color{blue}{y \cdot \frac{y}{x}}} - 3 \]
        5. associate-/r*N/A

          \[\leadsto \color{blue}{\frac{\frac{1}{y}}{\frac{y}{x}}} - 3 \]
        6. lower-/.f64N/A

          \[\leadsto \color{blue}{\frac{\frac{1}{y}}{\frac{y}{x}}} - 3 \]
        7. lower-/.f64N/A

          \[\leadsto \frac{\color{blue}{\frac{1}{y}}}{\frac{y}{x}} - 3 \]
        8. lower-/.f6499.9

          \[\leadsto \frac{\frac{1}{y}}{\color{blue}{\frac{y}{x}}} - 3 \]
      4. Applied rewrites99.9%

        \[\leadsto \color{blue}{\frac{\frac{1}{y}}{\frac{y}{x}}} - 3 \]
      5. Add Preprocessing

      Alternative 4: 99.9% accurate, 0.8× speedup?

      \[\begin{array}{l} \\ \frac{\frac{x}{y}}{y} - 3 \end{array} \]
      (FPCore (x y) :precision binary64 (- (/ (/ x y) y) 3.0))
      double code(double x, double y) {
      	return ((x / y) / y) - 3.0;
      }
      
      real(8) function code(x, y)
          real(8), intent (in) :: x
          real(8), intent (in) :: y
          code = ((x / y) / y) - 3.0d0
      end function
      
      public static double code(double x, double y) {
      	return ((x / y) / y) - 3.0;
      }
      
      def code(x, y):
      	return ((x / y) / y) - 3.0
      
      function code(x, y)
      	return Float64(Float64(Float64(x / y) / y) - 3.0)
      end
      
      function tmp = code(x, y)
      	tmp = ((x / y) / y) - 3.0;
      end
      
      code[x_, y_] := N[(N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision] - 3.0), $MachinePrecision]
      
      \begin{array}{l}
      
      \\
      \frac{\frac{x}{y}}{y} - 3
      \end{array}
      
      Derivation
      1. Initial program 93.3%

        \[\frac{x}{y \cdot y} - 3 \]
      2. Add Preprocessing
      3. Step-by-step derivation
        1. lift-/.f64N/A

          \[\leadsto \color{blue}{\frac{x}{y \cdot y}} - 3 \]
        2. lift-*.f64N/A

          \[\leadsto \frac{x}{\color{blue}{y \cdot y}} - 3 \]
        3. associate-/r*N/A

          \[\leadsto \color{blue}{\frac{\frac{x}{y}}{y}} - 3 \]
        4. lower-/.f64N/A

          \[\leadsto \color{blue}{\frac{\frac{x}{y}}{y}} - 3 \]
        5. lower-/.f6499.9

          \[\leadsto \frac{\color{blue}{\frac{x}{y}}}{y} - 3 \]
      4. Applied rewrites99.9%

        \[\leadsto \color{blue}{\frac{\frac{x}{y}}{y}} - 3 \]
      5. Add Preprocessing

      Alternative 5: 94.6% accurate, 1.0× speedup?

      \[\begin{array}{l} \\ \frac{x}{y \cdot y} - 3 \end{array} \]
      (FPCore (x y) :precision binary64 (- (/ x (* y y)) 3.0))
      double code(double x, double y) {
      	return (x / (y * y)) - 3.0;
      }
      
      real(8) function code(x, y)
          real(8), intent (in) :: x
          real(8), intent (in) :: y
          code = (x / (y * y)) - 3.0d0
      end function
      
      public static double code(double x, double y) {
      	return (x / (y * y)) - 3.0;
      }
      
      def code(x, y):
      	return (x / (y * y)) - 3.0
      
      function code(x, y)
      	return Float64(Float64(x / Float64(y * y)) - 3.0)
      end
      
      function tmp = code(x, y)
      	tmp = (x / (y * y)) - 3.0;
      end
      
      code[x_, y_] := N[(N[(x / N[(y * y), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]
      
      \begin{array}{l}
      
      \\
      \frac{x}{y \cdot y} - 3
      \end{array}
      
      Derivation
      1. Initial program 93.3%

        \[\frac{x}{y \cdot y} - 3 \]
      2. Add Preprocessing
      3. Add Preprocessing

      Alternative 6: 51.0% accurate, 20.0× speedup?

      \[\begin{array}{l} \\ -3 \end{array} \]
      (FPCore (x y) :precision binary64 -3.0)
      double code(double x, double y) {
      	return -3.0;
      }
      
      real(8) function code(x, y)
          real(8), intent (in) :: x
          real(8), intent (in) :: y
          code = -3.0d0
      end function
      
      public static double code(double x, double y) {
      	return -3.0;
      }
      
      def code(x, y):
      	return -3.0
      
      function code(x, y)
      	return -3.0
      end
      
      function tmp = code(x, y)
      	tmp = -3.0;
      end
      
      code[x_, y_] := -3.0
      
      \begin{array}{l}
      
      \\
      -3
      \end{array}
      
      Derivation
      1. Initial program 93.3%

        \[\frac{x}{y \cdot y} - 3 \]
      2. Add Preprocessing
      3. Taylor expanded in x around 0

        \[\leadsto \color{blue}{-3} \]
      4. Step-by-step derivation
        1. Applied rewrites52.8%

          \[\leadsto \color{blue}{-3} \]
        2. Add Preprocessing

        Developer Target 1: 99.9% accurate, 0.8× speedup?

        \[\begin{array}{l} \\ \frac{\frac{x}{y}}{y} - 3 \end{array} \]
        (FPCore (x y) :precision binary64 (- (/ (/ x y) y) 3.0))
        double code(double x, double y) {
        	return ((x / y) / y) - 3.0;
        }
        
        real(8) function code(x, y)
            real(8), intent (in) :: x
            real(8), intent (in) :: y
            code = ((x / y) / y) - 3.0d0
        end function
        
        public static double code(double x, double y) {
        	return ((x / y) / y) - 3.0;
        }
        
        def code(x, y):
        	return ((x / y) / y) - 3.0
        
        function code(x, y)
        	return Float64(Float64(Float64(x / y) / y) - 3.0)
        end
        
        function tmp = code(x, y)
        	tmp = ((x / y) / y) - 3.0;
        end
        
        code[x_, y_] := N[(N[(N[(x / y), $MachinePrecision] / y), $MachinePrecision] - 3.0), $MachinePrecision]
        
        \begin{array}{l}
        
        \\
        \frac{\frac{x}{y}}{y} - 3
        \end{array}
        

        Reproduce

        ?
        herbie shell --seed 2024233 
        (FPCore (x y)
          :name "Statistics.Sample:$skurtosis from math-functions-0.1.5.2"
          :precision binary64
        
          :alt
          (! :herbie-platform default (- (/ (/ x y) y) 3))
        
          (- (/ x (* y y)) 3.0))