Disney BSSRDF, sample scattering profile, lower

Percentage Accurate: 61.9% → 92.8%
Time: 7.5s
Alternatives: 4
Speedup: 11.4×

Specification

?
\[\left(0 \leq s \land s \leq 256\right) \land \left(2.328306437 \cdot 10^{-10} \leq u \land u \leq 0.25\right)\]
\[\begin{array}{l} \\ s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \end{array} \]
(FPCore (s u) :precision binary32 (* s (log (/ 1.0 (- 1.0 (* 4.0 u))))))
float code(float s, float u) {
	return s * logf((1.0f / (1.0f - (4.0f * u))));
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = s * log((1.0e0 / (1.0e0 - (4.0e0 * u))))
end function
function code(s, u)
	return Float32(s * log(Float32(Float32(1.0) / Float32(Float32(1.0) - Float32(Float32(4.0) * u)))))
end
function tmp = code(s, u)
	tmp = s * log((single(1.0) / (single(1.0) - (single(4.0) * u))));
end
\begin{array}{l}

\\
s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\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 4 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: 61.9% accurate, 1.0× speedup?

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

\\
s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right)
\end{array}

Alternative 1: 92.8% accurate, 0.4× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - u \cdot 4\\ \mathbf{if}\;t\_0 \leq 0.9959999918937683:\\ \;\;\;\;\log \left(\frac{1}{t\_0}\right) \cdot s\\ \mathbf{else}:\\ \;\;\;\;e^{2 \cdot u - \left(\log 0.25 - \log u\right)} \cdot s\\ \end{array} \end{array} \]
(FPCore (s u)
 :precision binary32
 (let* ((t_0 (- 1.0 (* u 4.0))))
   (if (<= t_0 0.9959999918937683)
     (* (log (/ 1.0 t_0)) s)
     (* (exp (- (* 2.0 u) (- (log 0.25) (log u)))) s))))
float code(float s, float u) {
	float t_0 = 1.0f - (u * 4.0f);
	float tmp;
	if (t_0 <= 0.9959999918937683f) {
		tmp = logf((1.0f / t_0)) * s;
	} else {
		tmp = expf(((2.0f * u) - (logf(0.25f) - logf(u)))) * s;
	}
	return tmp;
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    real(4) :: t_0
    real(4) :: tmp
    t_0 = 1.0e0 - (u * 4.0e0)
    if (t_0 <= 0.9959999918937683e0) then
        tmp = log((1.0e0 / t_0)) * s
    else
        tmp = exp(((2.0e0 * u) - (log(0.25e0) - log(u)))) * s
    end if
    code = tmp
end function
function code(s, u)
	t_0 = Float32(Float32(1.0) - Float32(u * Float32(4.0)))
	tmp = Float32(0.0)
	if (t_0 <= Float32(0.9959999918937683))
		tmp = Float32(log(Float32(Float32(1.0) / t_0)) * s);
	else
		tmp = Float32(exp(Float32(Float32(Float32(2.0) * u) - Float32(log(Float32(0.25)) - log(u)))) * s);
	end
	return tmp
end
function tmp_2 = code(s, u)
	t_0 = single(1.0) - (u * single(4.0));
	tmp = single(0.0);
	if (t_0 <= single(0.9959999918937683))
		tmp = log((single(1.0) / t_0)) * s;
	else
		tmp = exp(((single(2.0) * u) - (log(single(0.25)) - log(u)))) * s;
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
t_0 := 1 - u \cdot 4\\
\mathbf{if}\;t\_0 \leq 0.9959999918937683:\\
\;\;\;\;\log \left(\frac{1}{t\_0}\right) \cdot s\\

\mathbf{else}:\\
\;\;\;\;e^{2 \cdot u - \left(\log 0.25 - \log u\right)} \cdot s\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (-.f32 #s(literal 1 binary32) (*.f32 #s(literal 4 binary32) u)) < 0.995999992

    1. Initial program 92.3%

      \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
    2. Add Preprocessing

    if 0.995999992 < (-.f32 #s(literal 1 binary32) (*.f32 #s(literal 4 binary32) u))

    1. Initial program 49.4%

      \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
    2. Add Preprocessing
    3. Applied rewrites70.5%

      \[\leadsto s \cdot \color{blue}{\frac{1}{\frac{-{\left(\mathsf{log1p}\left(-4 \cdot u\right)\right)}^{2}}{{\left(\mathsf{log1p}\left(-4 \cdot u\right)\right)}^{3}}}} \]
    4. Taylor expanded in u around 0

      \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{\frac{1}{4}}{u}}} \]
    5. Step-by-step derivation
      1. lower-/.f3285.1

        \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{0.25}{u}}} \]
    6. Applied rewrites85.1%

      \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{0.25}{u}}} \]
    7. Step-by-step derivation
      1. lift-/.f32N/A

        \[\leadsto s \cdot \color{blue}{\frac{1}{\frac{\frac{1}{4}}{u}}} \]
      2. inv-powN/A

        \[\leadsto s \cdot \color{blue}{{\left(\frac{\frac{1}{4}}{u}\right)}^{-1}} \]
      3. pow-to-expN/A

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

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

        \[\leadsto s \cdot e^{\color{blue}{\log \left(\frac{\frac{1}{4}}{u}\right) \cdot -1}} \]
      6. lower-log.f3283.2

        \[\leadsto s \cdot e^{\color{blue}{\log \left(\frac{0.25}{u}\right)} \cdot -1} \]
    8. Applied rewrites83.2%

      \[\leadsto s \cdot \color{blue}{e^{\log \left(\frac{0.25}{u}\right) \cdot -1}} \]
    9. Taylor expanded in u around 0

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

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

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

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

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

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

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

        \[\leadsto s \cdot e^{2 \cdot u - \color{blue}{\left(\log \frac{1}{4} - \log u\right)}} \]
      8. remove-double-negN/A

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

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

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

        \[\leadsto s \cdot e^{2 \cdot u - \left(\log \frac{1}{4} - -1 \cdot \color{blue}{\left(\mathsf{neg}\left(\log u\right)\right)}\right)} \]
      12. log-recN/A

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

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

        \[\leadsto s \cdot e^{2 \cdot u - \left(\color{blue}{\log \frac{1}{4}} - -1 \cdot \log \left(\frac{1}{u}\right)\right)} \]
      15. log-recN/A

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

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

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

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

        \[\leadsto s \cdot e^{2 \cdot u - \left(\log \frac{1}{4} - \color{blue}{\log u}\right)} \]
      20. lower-log.f3292.8

        \[\leadsto s \cdot e^{2 \cdot u - \left(\log 0.25 - \color{blue}{\log u}\right)} \]
    11. Applied rewrites92.8%

      \[\leadsto s \cdot e^{\color{blue}{2 \cdot u - \left(\log 0.25 - \log u\right)}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification92.7%

    \[\leadsto \begin{array}{l} \mathbf{if}\;1 - u \cdot 4 \leq 0.9959999918937683:\\ \;\;\;\;\log \left(\frac{1}{1 - u \cdot 4}\right) \cdot s\\ \mathbf{else}:\\ \;\;\;\;e^{2 \cdot u - \left(\log 0.25 - \log u\right)} \cdot s\\ \end{array} \]
  5. Add Preprocessing

Alternative 2: 89.1% accurate, 0.9× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 1 - u \cdot 4\\ \mathbf{if}\;t\_0 \leq 0.999750018119812:\\ \;\;\;\;\log \left(\frac{1}{t\_0}\right) \cdot s\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{0.25}{u}} \cdot s\\ \end{array} \end{array} \]
(FPCore (s u)
 :precision binary32
 (let* ((t_0 (- 1.0 (* u 4.0))))
   (if (<= t_0 0.999750018119812)
     (* (log (/ 1.0 t_0)) s)
     (* (/ 1.0 (/ 0.25 u)) s))))
float code(float s, float u) {
	float t_0 = 1.0f - (u * 4.0f);
	float tmp;
	if (t_0 <= 0.999750018119812f) {
		tmp = logf((1.0f / t_0)) * s;
	} else {
		tmp = (1.0f / (0.25f / u)) * s;
	}
	return tmp;
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    real(4) :: t_0
    real(4) :: tmp
    t_0 = 1.0e0 - (u * 4.0e0)
    if (t_0 <= 0.999750018119812e0) then
        tmp = log((1.0e0 / t_0)) * s
    else
        tmp = (1.0e0 / (0.25e0 / u)) * s
    end if
    code = tmp
end function
function code(s, u)
	t_0 = Float32(Float32(1.0) - Float32(u * Float32(4.0)))
	tmp = Float32(0.0)
	if (t_0 <= Float32(0.999750018119812))
		tmp = Float32(log(Float32(Float32(1.0) / t_0)) * s);
	else
		tmp = Float32(Float32(Float32(1.0) / Float32(Float32(0.25) / u)) * s);
	end
	return tmp
end
function tmp_2 = code(s, u)
	t_0 = single(1.0) - (u * single(4.0));
	tmp = single(0.0);
	if (t_0 <= single(0.999750018119812))
		tmp = log((single(1.0) / t_0)) * s;
	else
		tmp = (single(1.0) / (single(0.25) / u)) * s;
	end
	tmp_2 = tmp;
end
\begin{array}{l}

\\
\begin{array}{l}
t_0 := 1 - u \cdot 4\\
\mathbf{if}\;t\_0 \leq 0.999750018119812:\\
\;\;\;\;\log \left(\frac{1}{t\_0}\right) \cdot s\\

\mathbf{else}:\\
\;\;\;\;\frac{1}{\frac{0.25}{u}} \cdot s\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if (-.f32 #s(literal 1 binary32) (*.f32 #s(literal 4 binary32) u)) < 0.999750018

    1. Initial program 87.2%

      \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
    2. Add Preprocessing

    if 0.999750018 < (-.f32 #s(literal 1 binary32) (*.f32 #s(literal 4 binary32) u))

    1. Initial program 42.3%

      \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
    2. Add Preprocessing
    3. Applied rewrites86.8%

      \[\leadsto s \cdot \color{blue}{\frac{1}{\frac{-{\left(\mathsf{log1p}\left(-4 \cdot u\right)\right)}^{2}}{{\left(\mathsf{log1p}\left(-4 \cdot u\right)\right)}^{3}}}} \]
    4. Taylor expanded in u around 0

      \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{\frac{1}{4}}{u}}} \]
    5. Step-by-step derivation
      1. lower-/.f3291.0

        \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{0.25}{u}}} \]
    6. Applied rewrites91.0%

      \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{0.25}{u}}} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification89.4%

    \[\leadsto \begin{array}{l} \mathbf{if}\;1 - u \cdot 4 \leq 0.999750018119812:\\ \;\;\;\;\log \left(\frac{1}{1 - u \cdot 4}\right) \cdot s\\ \mathbf{else}:\\ \;\;\;\;\frac{1}{\frac{0.25}{u}} \cdot s\\ \end{array} \]
  5. Add Preprocessing

Alternative 3: 73.5% accurate, 4.5× speedup?

\[\begin{array}{l} \\ \frac{1}{\frac{0.25}{u}} \cdot s \end{array} \]
(FPCore (s u) :precision binary32 (* (/ 1.0 (/ 0.25 u)) s))
float code(float s, float u) {
	return (1.0f / (0.25f / u)) * s;
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = (1.0e0 / (0.25e0 / u)) * s
end function
function code(s, u)
	return Float32(Float32(Float32(1.0) / Float32(Float32(0.25) / u)) * s)
end
function tmp = code(s, u)
	tmp = (single(1.0) / (single(0.25) / u)) * s;
end
\begin{array}{l}

\\
\frac{1}{\frac{0.25}{u}} \cdot s
\end{array}
Derivation
  1. Initial program 62.0%

    \[s \cdot \log \left(\frac{1}{1 - 4 \cdot u}\right) \]
  2. Add Preprocessing
  3. Applied rewrites50.1%

    \[\leadsto s \cdot \color{blue}{\frac{1}{\frac{-{\left(\mathsf{log1p}\left(-4 \cdot u\right)\right)}^{2}}{{\left(\mathsf{log1p}\left(-4 \cdot u\right)\right)}^{3}}}} \]
  4. Taylor expanded in u around 0

    \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{\frac{1}{4}}{u}}} \]
  5. Step-by-step derivation
    1. lower-/.f3272.1

      \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{0.25}{u}}} \]
  6. Applied rewrites72.1%

    \[\leadsto s \cdot \frac{1}{\color{blue}{\frac{0.25}{u}}} \]
  7. Final simplification72.1%

    \[\leadsto \frac{1}{\frac{0.25}{u}} \cdot s \]
  8. Add Preprocessing

Alternative 4: 73.6% accurate, 11.4× speedup?

\[\begin{array}{l} \\ \left(u \cdot 4\right) \cdot s \end{array} \]
(FPCore (s u) :precision binary32 (* (* u 4.0) s))
float code(float s, float u) {
	return (u * 4.0f) * s;
}
real(4) function code(s, u)
    real(4), intent (in) :: s
    real(4), intent (in) :: u
    code = (u * 4.0e0) * s
end function
function code(s, u)
	return Float32(Float32(u * Float32(4.0)) * s)
end
function tmp = code(s, u)
	tmp = (u * single(4.0)) * s;
end
\begin{array}{l}

\\
\left(u \cdot 4\right) \cdot s
\end{array}
Derivation
  1. Initial program 62.0%

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

    \[\leadsto s \cdot \color{blue}{\left(4 \cdot u\right)} \]
  4. Step-by-step derivation
    1. *-commutativeN/A

      \[\leadsto s \cdot \color{blue}{\left(u \cdot 4\right)} \]
    2. lower-*.f3272.1

      \[\leadsto s \cdot \color{blue}{\left(u \cdot 4\right)} \]
  5. Applied rewrites72.1%

    \[\leadsto s \cdot \color{blue}{\left(u \cdot 4\right)} \]
  6. Final simplification72.1%

    \[\leadsto \left(u \cdot 4\right) \cdot s \]
  7. Add Preprocessing

Reproduce

?
herbie shell --seed 2024266 
(FPCore (s u)
  :name "Disney BSSRDF, sample scattering profile, lower"
  :precision binary32
  :pre (and (and (<= 0.0 s) (<= s 256.0)) (and (<= 2.328306437e-10 u) (<= u 0.25)))
  (* s (log (/ 1.0 (- 1.0 (* 4.0 u))))))