UniformSampleCone, z

Percentage Accurate: 99.9% → 99.9%
Time: 8.7s
Alternatives: 3
Speedup: 1.2×

Specification

?
\[\left(\left(2.328306437 \cdot 10^{-10} \leq ux \land ux \leq 1\right) \land \left(2.328306437 \cdot 10^{-10} \leq uy \land uy \leq 1\right)\right) \land \left(0 \leq maxCos \land maxCos \leq 1\right)\]
\[\begin{array}{l} \\ \left(1 - ux\right) + ux \cdot maxCos \end{array} \]
(FPCore (ux uy maxCos) :precision binary32 (+ (- 1.0 ux) (* ux maxCos)))
float code(float ux, float uy, float maxCos) {
	return (1.0f - ux) + (ux * maxCos);
}

real(4) function code(ux, uy, maxcos)
    real(4), intent (in) :: ux
    real(4), intent (in) :: uy
    real(4), intent (in) :: maxcos
    code = (1.0e0 - ux) + (ux * maxcos)
end function

function code(ux, uy, maxCos)
	return Float32(Float32(Float32(1.0) - ux) + Float32(ux * maxCos))
end

function tmp = code(ux, uy, maxCos)
	tmp = (single(1.0) - ux) + (ux * maxCos);
end

\begin{array}{l}

\\
\left(1 - ux\right) + ux \cdot maxCos
\end{array}

Sampling outcomes in binary32 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 3 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: 99.9% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \left(1 - ux\right) + ux \cdot maxCos \end{array} \]
(FPCore (ux uy maxCos) :precision binary32 (+ (- 1.0 ux) (* ux maxCos)))
float code(float ux, float uy, float maxCos) {
	return (1.0f - ux) + (ux * maxCos);
}

real(4) function code(ux, uy, maxcos)
    real(4), intent (in) :: ux
    real(4), intent (in) :: uy
    real(4), intent (in) :: maxcos
    code = (1.0e0 - ux) + (ux * maxcos)
end function

function code(ux, uy, maxCos)
	return Float32(Float32(Float32(1.0) - ux) + Float32(ux * maxCos))
end

function tmp = code(ux, uy, maxCos)
	tmp = (single(1.0) - ux) + (ux * maxCos);
end

\begin{array}{l}

\\
\left(1 - ux\right) + ux \cdot maxCos
\end{array}

Alternative 1: 99.9% accurate, 1.2× speedup?

\[\begin{array}{l} \\ \mathsf{fma}\left(ux, maxCos + -1, 1\right) \end{array} \]
(FPCore (ux uy maxCos) :precision binary32 (fma ux (+ maxCos -1.0) 1.0))
float code(float ux, float uy, float maxCos) {
	return fmaf(ux, (maxCos + -1.0f), 1.0f);
}

function code(ux, uy, maxCos)
	return fma(ux, Float32(maxCos + Float32(-1.0)), Float32(1.0))
end

\begin{array}{l}

\\
\mathsf{fma}\left(ux, maxCos + -1, 1\right)
\end{array}
Derivation

  1. Initial program 99.9%

    \[\left(1 - ux\right) + ux \cdot maxCos \]
  2. Add Preprocessing

  3. Taylor expanded in ux around 0

    \[\leadsto \color{blue}{1 + ux \cdot \left(maxCos - 1\right)} \]
  4. Step-by-step derivation

    1. +-commutativeN/A

      \[\leadsto \color{blue}{ux \cdot \left(maxCos - 1\right) + 1} \]

    2. rgt-mult-inverseN/A

      \[\leadsto ux \cdot \left(maxCos - 1\right) + \color{blue}{ux \cdot \frac{1}{ux}} \]

    3. distribute-lft-inN/A

      \[\leadsto \color{blue}{ux \cdot \left(\left(maxCos - 1\right) + \frac{1}{ux}\right)} \]

    4. +-commutativeN/A

      \[\leadsto ux \cdot \color{blue}{\left(\frac{1}{ux} + \left(maxCos - 1\right)\right)} \]

    5. associate--l+N/A

      \[\leadsto ux \cdot \color{blue}{\left(\left(\frac{1}{ux} + maxCos\right) - 1\right)} \]

    6. remove-double-negN/A

      \[\leadsto ux \cdot \left(\left(\frac{1}{ux} + \color{blue}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(maxCos\right)\right)\right)\right)}\right) - 1\right) \]

    7. mul-1-negN/A

      \[\leadsto ux \cdot \left(\left(\frac{1}{ux} + \left(\mathsf{neg}\left(\color{blue}{-1 \cdot maxCos}\right)\right)\right) - 1\right) \]

    8. sub-negN/A

      \[\leadsto ux \cdot \left(\color{blue}{\left(\frac{1}{ux} - -1 \cdot maxCos\right)} - 1\right) \]

    9. associate--r+N/A

      \[\leadsto ux \cdot \color{blue}{\left(\frac{1}{ux} - \left(-1 \cdot maxCos + 1\right)\right)} \]

    10. +-commutativeN/A

      \[\leadsto ux \cdot \left(\frac{1}{ux} - \color{blue}{\left(1 + -1 \cdot maxCos\right)}\right) \]

    11. sub-negN/A

      \[\leadsto ux \cdot \color{blue}{\left(\frac{1}{ux} + \left(\mathsf{neg}\left(\left(1 + -1 \cdot maxCos\right)\right)\right)\right)} \]

    12. distribute-lft-inN/A

      \[\leadsto \color{blue}{ux \cdot \frac{1}{ux} + ux \cdot \left(\mathsf{neg}\left(\left(1 + -1 \cdot maxCos\right)\right)\right)} \]

    13. rgt-mult-inverseN/A

      \[\leadsto \color{blue}{1} + ux \cdot \left(\mathsf{neg}\left(\left(1 + -1 \cdot maxCos\right)\right)\right) \]

    14. distribute-rgt-neg-inN/A

      \[\leadsto 1 + \color{blue}{\left(\mathsf{neg}\left(ux \cdot \left(1 + -1 \cdot maxCos\right)\right)\right)} \]

    15. mul-1-negN/A

      \[\leadsto 1 + \color{blue}{-1 \cdot \left(ux \cdot \left(1 + -1 \cdot maxCos\right)\right)} \]

    16. +-commutativeN/A

      \[\leadsto \color{blue}{-1 \cdot \left(ux \cdot \left(1 + -1 \cdot maxCos\right)\right) + 1} \]

    17. mul-1-negN/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(ux \cdot \left(1 + -1 \cdot maxCos\right)\right)\right)} + 1 \]

    18. distribute-rgt-neg-inN/A

      \[\leadsto \color{blue}{ux \cdot \left(\mathsf{neg}\left(\left(1 + -1 \cdot maxCos\right)\right)\right)} + 1 \]

    19. accelerator-lowering-fma.f32N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(ux, \mathsf{neg}\left(\left(1 + -1 \cdot maxCos\right)\right), 1\right)} \]

  5. Simplified100.0%

    \[\leadsto \color{blue}{\mathsf{fma}\left(ux, maxCos + -1, 1\right)} \]
  6. Add Preprocessing

Alternative 2: 98.2% accurate, 3.0× speedup?

\[\begin{array}{l} \\ 1 - ux \end{array} \]
(FPCore (ux uy maxCos) :precision binary32 (- 1.0 ux))
float code(float ux, float uy, float maxCos) {
	return 1.0f - ux;
}

real(4) function code(ux, uy, maxcos)
    real(4), intent (in) :: ux
    real(4), intent (in) :: uy
    real(4), intent (in) :: maxcos
    code = 1.0e0 - ux
end function

function code(ux, uy, maxCos)
	return Float32(Float32(1.0) - ux)
end

function tmp = code(ux, uy, maxCos)
	tmp = single(1.0) - ux;
end

\begin{array}{l}

\\
1 - ux
\end{array}
Derivation

  1. Initial program 99.9%

    \[\left(1 - ux\right) + ux \cdot maxCos \]
  2. Add Preprocessing

  3. Taylor expanded in maxCos around 0

    \[\leadsto \color{blue}{1 - ux} \]
  4. Step-by-step derivation

    1. --lowering--.f3296.9

      \[\leadsto \color{blue}{1 - ux} \]

  5. Simplified96.9%

    \[\leadsto \color{blue}{1 - ux} \]
  6. Add Preprocessing

Alternative 3: 72.3% accurate, 12.0× speedup?

\[\begin{array}{l} \\ 1 \end{array} \]
(FPCore (ux uy maxCos) :precision binary32 1.0)
float code(float ux, float uy, float maxCos) {
	return 1.0f;
}

real(4) function code(ux, uy, maxcos)
    real(4), intent (in) :: ux
    real(4), intent (in) :: uy
    real(4), intent (in) :: maxcos
    code = 1.0e0
end function

function code(ux, uy, maxCos)
	return Float32(1.0)
end

function tmp = code(ux, uy, maxCos)
	tmp = single(1.0);
end

\begin{array}{l}

\\
1
\end{array}
Derivation

  1. Initial program 99.9%

    \[\left(1 - ux\right) + ux \cdot maxCos \]
  2. Add Preprocessing

  3. Taylor expanded in ux around 0

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

    1. Simplified70.7%

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

    Reproduce

    ?
    herbie shell --seed 2024196 
(FPCore (ux uy maxCos)
  :name "UniformSampleCone, z"
  :precision binary32
  :pre (and (and (and (<= 2.328306437e-10 ux) (<= ux 1.0)) (and (<= 2.328306437e-10 uy) (<= uy 1.0))) (and (<= 0.0 maxCos) (<= maxCos 1.0)))
  (+ (- 1.0 ux) (* ux maxCos)))