Disney BSSRDF, sample scattering profile, lower

Percentage Accurate: 61.3% → 99.4%
Time: 12.6s
Alternatives: 15
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 15 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.3% 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: 99.4% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \mathsf{log1p}\left(u \cdot -4\right) \cdot \left(-s\right) \end{array} \]
(FPCore (s u) :precision binary32 (* (log1p (* u -4.0)) (- s)))
float code(float s, float u) {
	return log1pf((u * -4.0f)) * -s;
}
function code(s, u)
	return Float32(log1p(Float32(u * Float32(-4.0))) * Float32(-s))
end
\begin{array}{l}

\\
\mathsf{log1p}\left(u \cdot -4\right) \cdot \left(-s\right)
\end{array}
Derivation
  1. Initial program 63.8%

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

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

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

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\log \left(1 - 4 \cdot u\right)\right)\right)} \cdot s \]
    3. distribute-lft-neg-outN/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\log \left(1 - 4 \cdot u\right) \cdot s\right)} \]
    4. distribute-rgt-neg-inN/A

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

      \[\leadsto \color{blue}{\log \left(1 - 4 \cdot u\right) \cdot \left(\mathsf{neg}\left(s\right)\right)} \]
    6. cancel-sign-sub-invN/A

      \[\leadsto \log \color{blue}{\left(1 + \left(\mathsf{neg}\left(4\right)\right) \cdot u\right)} \cdot \left(\mathsf{neg}\left(s\right)\right) \]
    7. metadata-evalN/A

      \[\leadsto \log \left(1 + \color{blue}{-4} \cdot u\right) \cdot \left(\mathsf{neg}\left(s\right)\right) \]
    8. lower-log1p.f32N/A

      \[\leadsto \color{blue}{\mathsf{log1p}\left(-4 \cdot u\right)} \cdot \left(\mathsf{neg}\left(s\right)\right) \]
    9. *-commutativeN/A

      \[\leadsto \mathsf{log1p}\left(\color{blue}{u \cdot -4}\right) \cdot \left(\mathsf{neg}\left(s\right)\right) \]
    10. lower-*.f32N/A

      \[\leadsto \mathsf{log1p}\left(\color{blue}{u \cdot -4}\right) \cdot \left(\mathsf{neg}\left(s\right)\right) \]
    11. lower-neg.f3299.5

      \[\leadsto \mathsf{log1p}\left(u \cdot -4\right) \cdot \color{blue}{\left(-s\right)} \]
  5. Applied rewrites99.5%

    \[\leadsto \color{blue}{\mathsf{log1p}\left(u \cdot -4\right) \cdot \left(-s\right)} \]
  6. Add Preprocessing

Alternative 2: 94.3% accurate, 1.9× speedup?

\[\begin{array}{l} \\ u \cdot \left(s \cdot \mathsf{fma}\left(u, \frac{64 - u \cdot \left(\mathsf{fma}\left(u, 64, 21.333333333333332\right) \cdot \left(u \cdot 21.333333333333332\right)\right)}{\mathsf{fma}\left(\mathsf{fma}\left(u, 64, 21.333333333333332\right), -u, 8\right)}, 4\right)\right) \end{array} \]
(FPCore (s u)
 :precision binary32
 (*
  u
  (*
   s
   (fma
    u
    (/
     (-
      64.0
      (* u (* (fma u 64.0 21.333333333333332) (* u 21.333333333333332))))
     (fma (fma u 64.0 21.333333333333332) (- u) 8.0))
    4.0))))
float code(float s, float u) {
	return u * (s * fmaf(u, ((64.0f - (u * (fmaf(u, 64.0f, 21.333333333333332f) * (u * 21.333333333333332f)))) / fmaf(fmaf(u, 64.0f, 21.333333333333332f), -u, 8.0f)), 4.0f));
}
function code(s, u)
	return Float32(u * Float32(s * fma(u, Float32(Float32(Float32(64.0) - Float32(u * Float32(fma(u, Float32(64.0), Float32(21.333333333333332)) * Float32(u * Float32(21.333333333333332))))) / fma(fma(u, Float32(64.0), Float32(21.333333333333332)), Float32(-u), Float32(8.0))), Float32(4.0))))
end
\begin{array}{l}

\\
u \cdot \left(s \cdot \mathsf{fma}\left(u, \frac{64 - u \cdot \left(\mathsf{fma}\left(u, 64, 21.333333333333332\right) \cdot \left(u \cdot 21.333333333333332\right)\right)}{\mathsf{fma}\left(\mathsf{fma}\left(u, 64, 21.333333333333332\right), -u, 8\right)}, 4\right)\right)
\end{array}
Derivation
  1. Initial program 61.3%

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

    \[\leadsto \color{blue}{u \cdot \left(4 \cdot s + u \cdot \left(8 \cdot s + u \cdot \left(\frac{64}{3} \cdot s + 64 \cdot \left(s \cdot u\right)\right)\right)\right)} \]
  4. Applied rewrites92.6%

    \[\leadsto \color{blue}{\left(u \cdot s\right) \cdot \mathsf{fma}\left(u, \mathsf{fma}\left(u, \mathsf{fma}\left(u, 64, 21.333333333333332\right), 8\right), 4\right)} \]
  5. Step-by-step derivation
    1. Applied rewrites92.6%

      \[\leadsto \left(u \cdot s\right) \cdot \mathsf{fma}\left(u, \frac{64}{8 - u \cdot \mathsf{fma}\left(u, 64, 21.333333333333332\right)} - \color{blue}{\frac{u \cdot \left(\mathsf{fma}\left(u, 64, 21.333333333333332\right) \cdot \left(u \cdot \mathsf{fma}\left(u, 64, 21.333333333333332\right)\right)\right)}{8 - u \cdot \mathsf{fma}\left(u, 64, 21.333333333333332\right)}}, 4\right) \]
    2. Taylor expanded in u around 0

      \[\leadsto \left(u \cdot s\right) \cdot \mathsf{fma}\left(u, \frac{64}{8 - u \cdot \mathsf{fma}\left(u, 64, \frac{64}{3}\right)} - \frac{u \cdot \left(\mathsf{fma}\left(u, 64, \frac{64}{3}\right) \cdot \left(u \cdot \frac{64}{3}\right)\right)}{8 - u \cdot \mathsf{fma}\left(u, 64, \frac{64}{3}\right)}, 4\right) \]
    3. Step-by-step derivation
      1. Applied rewrites94.0%

        \[\leadsto \left(u \cdot s\right) \cdot \mathsf{fma}\left(u, \frac{64}{8 - u \cdot \mathsf{fma}\left(u, 64, 21.333333333333332\right)} - \frac{u \cdot \left(\mathsf{fma}\left(u, 64, 21.333333333333332\right) \cdot \left(u \cdot 21.333333333333332\right)\right)}{8 - u \cdot \mathsf{fma}\left(u, 64, 21.333333333333332\right)}, 4\right) \]
      2. Step-by-step derivation
        1. Applied rewrites94.3%

          \[\leadsto \left(s \cdot \mathsf{fma}\left(u, \frac{64 - u \cdot \left(\mathsf{fma}\left(u, 64, 21.333333333333332\right) \cdot \left(u \cdot 21.333333333333332\right)\right)}{\mathsf{fma}\left(\mathsf{fma}\left(u, 64, 21.333333333333332\right), -u, 8\right)}, 4\right)\right) \cdot \color{blue}{u} \]
        2. Final simplification94.3%

          \[\leadsto u \cdot \left(s \cdot \mathsf{fma}\left(u, \frac{64 - u \cdot \left(\mathsf{fma}\left(u, 64, 21.333333333333332\right) \cdot \left(u \cdot 21.333333333333332\right)\right)}{\mathsf{fma}\left(\mathsf{fma}\left(u, 64, 21.333333333333332\right), -u, 8\right)}, 4\right)\right) \]
        3. Add Preprocessing

        Reproduce

        ?
        herbie shell --seed 2024222 
        (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))))))