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
As pointed out in stan-dev/loo#185, we only need the last M tail indices, so instead of sorting the whole array of weights, we can just sort the upper tail weights, which at least for Vector is faster. We can do this by replacing sortperm with partialsortperm.
The text was updated successfully, but these errors were encountered:
As pointed out in stan-dev/loo#185, we only need the last
M
tail indices, so instead of sorting the whole array of weights, we can just sort the upper tail weights, which at least forVector
is faster. We can do this by replacingsortperm
withpartialsortperm
.The text was updated successfully, but these errors were encountered: