HairBSDF, sample_f, cosTheta

Percentage Accurate: 99.5% → 99.5%
Time: 8.1s
Alternatives: 5
Speedup: 1.0×

Specification

?
\[\left(10^{-5} \leq u \land u \leq 1\right) \land \left(0 \leq v \land v \leq 109.746574\right)\]
\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

\\
1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)
\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 5 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.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

\\
1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)
\end{array}

Alternative 1: 99.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))
float code(float u, float v) {
	return 1.0f + (v * logf((u + ((1.0f - u) * expf((-2.0f / v))))));
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log((u + ((1.0e0 - u) * exp(((-2.0e0) / v))))))
end function
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(u + Float32(Float32(Float32(1.0) - u) * exp(Float32(Float32(-2.0) / v)))))))
end
function tmp = code(u, v)
	tmp = single(1.0) + (v * log((u + ((single(1.0) - u) * exp((single(-2.0) / v))))));
end
\begin{array}{l}

\\
1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right)
\end{array}
Derivation
  1. Initial program 99.5%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Add Preprocessing
  3. Add Preprocessing

Alternative 2: 94.5% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 1 + v \cdot \log \left(\left(1 - e^{\frac{-2}{v}}\right) \cdot u\right) \end{array} \]
(FPCore (u v)
 :precision binary32
 (+ 1.0 (* v (log (* (- 1.0 (exp (/ -2.0 v))) u)))))
float code(float u, float v) {
	return 1.0f + (v * logf(((1.0f - expf((-2.0f / v))) * u)));
}
real(4) function code(u, v)
    real(4), intent (in) :: u
    real(4), intent (in) :: v
    code = 1.0e0 + (v * log(((1.0e0 - exp(((-2.0e0) / v))) * u)))
end function
function code(u, v)
	return Float32(Float32(1.0) + Float32(v * log(Float32(Float32(Float32(1.0) - exp(Float32(Float32(-2.0) / v))) * u))))
end
function tmp = code(u, v)
	tmp = single(1.0) + (v * log(((single(1.0) - exp((single(-2.0) / v))) * u)));
end
\begin{array}{l}

\\
1 + v \cdot \log \left(\left(1 - e^{\frac{-2}{v}}\right) \cdot u\right)
\end{array}
Derivation
  1. Initial program 99.5%

    \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in v around inf

    \[\leadsto 1 + v \cdot \log \color{blue}{\left(1 + -2 \cdot \frac{1 - u}{v}\right)} \]
  4. Step-by-step derivation
    1. +-commutativeN/A

      \[\leadsto 1 + v \cdot \log \color{blue}{\left(-2 \cdot \frac{1 - u}{v} + 1\right)} \]
    2. *-commutativeN/A

      \[\leadsto 1 + v \cdot \log \left(\color{blue}{\frac{1 - u}{v} \cdot -2} + 1\right) \]
    3. lower-fma.f32N/A

      \[\leadsto 1 + v \cdot \log \color{blue}{\left(\mathsf{fma}\left(\frac{1 - u}{v}, -2, 1\right)\right)} \]
    4. lower-/.f32N/A

      \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(\color{blue}{\frac{1 - u}{v}}, -2, 1\right)\right) \]
    5. lower--.f3287.1

      \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(\frac{\color{blue}{1 - u}}{v}, -2, 1\right)\right) \]
  5. Applied rewrites87.1%

    \[\leadsto 1 + v \cdot \log \color{blue}{\left(\mathsf{fma}\left(\frac{1 - u}{v}, -2, 1\right)\right)} \]
  6. Taylor expanded in u around inf

    \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(-1 \cdot \frac{u}{v}, -2, 1\right)\right) \]
  7. Step-by-step derivation
    1. Applied rewrites87.1%

      \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(\frac{-u}{v}, -2, 1\right)\right) \]
    2. Taylor expanded in u around inf

      \[\leadsto 1 + v \cdot \log \color{blue}{\left(u \cdot \left(1 + -1 \cdot e^{\frac{-2}{v}}\right)\right)} \]
    3. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto 1 + v \cdot \log \color{blue}{\left(\left(1 + -1 \cdot e^{\frac{-2}{v}}\right) \cdot u\right)} \]
      2. lower-*.f32N/A

        \[\leadsto 1 + v \cdot \log \color{blue}{\left(\left(1 + -1 \cdot e^{\frac{-2}{v}}\right) \cdot u\right)} \]
      3. mul-1-negN/A

        \[\leadsto 1 + v \cdot \log \left(\left(1 + \color{blue}{\left(\mathsf{neg}\left(e^{\frac{-2}{v}}\right)\right)}\right) \cdot u\right) \]
      4. unsub-negN/A

        \[\leadsto 1 + v \cdot \log \left(\color{blue}{\left(1 - e^{\frac{-2}{v}}\right)} \cdot u\right) \]
      5. lower--.f32N/A

        \[\leadsto 1 + v \cdot \log \left(\color{blue}{\left(1 - e^{\frac{-2}{v}}\right)} \cdot u\right) \]
      6. lower-exp.f32N/A

        \[\leadsto 1 + v \cdot \log \left(\left(1 - \color{blue}{e^{\frac{-2}{v}}}\right) \cdot u\right) \]
      7. lower-/.f3293.9

        \[\leadsto 1 + v \cdot \log \left(\left(1 - e^{\color{blue}{\frac{-2}{v}}}\right) \cdot u\right) \]
    4. Applied rewrites93.9%

      \[\leadsto 1 + v \cdot \log \color{blue}{\left(\left(1 - e^{\frac{-2}{v}}\right) \cdot u\right)} \]
    5. Add Preprocessing

    Alternative 3: 87.5% accurate, 1.8× speedup?

    \[\begin{array}{l} \\ 1 + v \cdot \log \left(\frac{u}{v} \cdot 2\right) \end{array} \]
    (FPCore (u v) :precision binary32 (+ 1.0 (* v (log (* (/ u v) 2.0)))))
    float code(float u, float v) {
    	return 1.0f + (v * logf(((u / v) * 2.0f)));
    }
    
    real(4) function code(u, v)
        real(4), intent (in) :: u
        real(4), intent (in) :: v
        code = 1.0e0 + (v * log(((u / v) * 2.0e0)))
    end function
    
    function code(u, v)
    	return Float32(Float32(1.0) + Float32(v * log(Float32(Float32(u / v) * Float32(2.0)))))
    end
    
    function tmp = code(u, v)
    	tmp = single(1.0) + (v * log(((u / v) * single(2.0))));
    end
    
    \begin{array}{l}
    
    \\
    1 + v \cdot \log \left(\frac{u}{v} \cdot 2\right)
    \end{array}
    
    Derivation
    1. Initial program 99.5%

      \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in v around inf

      \[\leadsto 1 + v \cdot \log \color{blue}{\left(1 + -2 \cdot \frac{1 - u}{v}\right)} \]
    4. Step-by-step derivation
      1. +-commutativeN/A

        \[\leadsto 1 + v \cdot \log \color{blue}{\left(-2 \cdot \frac{1 - u}{v} + 1\right)} \]
      2. *-commutativeN/A

        \[\leadsto 1 + v \cdot \log \left(\color{blue}{\frac{1 - u}{v} \cdot -2} + 1\right) \]
      3. lower-fma.f32N/A

        \[\leadsto 1 + v \cdot \log \color{blue}{\left(\mathsf{fma}\left(\frac{1 - u}{v}, -2, 1\right)\right)} \]
      4. lower-/.f32N/A

        \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(\color{blue}{\frac{1 - u}{v}}, -2, 1\right)\right) \]
      5. lower--.f3287.1

        \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(\frac{\color{blue}{1 - u}}{v}, -2, 1\right)\right) \]
    5. Applied rewrites85.8%

      \[\leadsto 1 + v \cdot \log \color{blue}{\left(\mathsf{fma}\left(\frac{1 - u}{v}, -2, 1\right)\right)} \]
    6. Taylor expanded in u around inf

      \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(-1 \cdot \frac{u}{v}, -2, 1\right)\right) \]
    7. Step-by-step derivation
      1. Applied rewrites85.1%

        \[\leadsto 1 + v \cdot \log \left(\mathsf{fma}\left(\frac{-u}{v}, -2, 1\right)\right) \]
      2. Taylor expanded in u around inf

        \[\leadsto 1 + v \cdot \log \left(2 \cdot \color{blue}{\frac{u}{v}}\right) \]
      3. Step-by-step derivation
        1. Applied rewrites87.5%

          \[\leadsto 1 + v \cdot \log \left(\frac{u}{v} \cdot \color{blue}{2}\right) \]
        2. Add Preprocessing

        Alternative 4: 86.9% accurate, 231.0× speedup?

        \[\begin{array}{l} \\ 1 \end{array} \]
        (FPCore (u v) :precision binary32 1.0)
        float code(float u, float v) {
        	return 1.0f;
        }
        
        real(4) function code(u, v)
            real(4), intent (in) :: u
            real(4), intent (in) :: v
            code = 1.0e0
        end function
        
        function code(u, v)
        	return Float32(1.0)
        end
        
        function tmp = code(u, v)
        	tmp = single(1.0);
        end
        
        \begin{array}{l}
        
        \\
        1
        \end{array}
        
        Derivation
        1. Initial program 99.5%

          \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
        2. Add Preprocessing
        3. Taylor expanded in v around 0

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

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

          Alternative 5: 5.9% accurate, 231.0× speedup?

          \[\begin{array}{l} \\ -1 \end{array} \]
          (FPCore (u v) :precision binary32 -1.0)
          float code(float u, float v) {
          	return -1.0f;
          }
          
          real(4) function code(u, v)
              real(4), intent (in) :: u
              real(4), intent (in) :: v
              code = -1.0e0
          end function
          
          function code(u, v)
          	return Float32(-1.0)
          end
          
          function tmp = code(u, v)
          	tmp = single(-1.0);
          end
          
          \begin{array}{l}
          
          \\
          -1
          \end{array}
          
          Derivation
          1. Initial program 99.5%

            \[1 + v \cdot \log \left(u + \left(1 - u\right) \cdot e^{\frac{-2}{v}}\right) \]
          2. Add Preprocessing
          3. Taylor expanded in u around 0

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

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

            Reproduce

            ?
            herbie shell --seed 2024318 
            (FPCore (u v)
              :name "HairBSDF, sample_f, cosTheta"
              :precision binary32
              :pre (and (and (<= 1e-5 u) (<= u 1.0)) (and (<= 0.0 v) (<= v 109.746574)))
              (+ 1.0 (* v (log (+ u (* (- 1.0 u) (exp (/ -2.0 v))))))))