You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I wonder if I want to reproduce the paper's results (https://dl.acm.org/doi/10.1145/3656412), what is a proper way to measure the time for running HyBit code?
For example:
using Dice, Distributions
DFiP = DistFix{6, 2}
code = @dice begin
a = bitblast(DFiP, Normal(0, 1), 4, -8.0, 8.0)
b = a < DFiP(0.0)
b
end
@time @show pr(code)
Does this @time include both the computation of the proability format of code and the dice code defined within @dice?
Also, does HyBit provide separate time measurement for total execution time and inference only time that excludes the compilation time?
Hi,
Thank you for the great work!
I wonder if I want to reproduce the paper's results (https://dl.acm.org/doi/10.1145/3656412), what is a proper way to measure the time for running HyBit code?
For example:
Does this @time include both the computation of the proability format of code and the dice code defined within @dice?
Also, does HyBit provide separate time measurement for total execution time and inference only time that excludes the compilation time?
Or maybe HyBit use the same tool "hyperfine" as the Dice paper (https://dl.acm.org/doi/10.1145/3428208)?
Thank you for help.
The text was updated successfully, but these errors were encountered: