SIRUS.jl
SIRUS.jl copied to clipboard
Does a non-greedy approach improve accuracy?
Non-greedy binary splitting shouldn’t be too expensive. Number of points to check is q * sqrt(p)
versus (q * sqrt(p))^2
. Maybe only enable for reasonably low p
and q
.