Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update rstar tests #393

Merged
merged 2 commits into from
Dec 14, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Project.toml
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@ uuid = "c7f686f2-ff18-58e9-bc7b-31028e88f75d"
keywords = ["markov chain monte carlo", "probablistic programming"]
license = "MIT"
desc = "Chain types and utility functions for MCMC simulations."
version = "5.6.0"
version = "5.6.1"

[deps]
AbstractMCMC = "80f14c24-f653-4e6a-9b94-39d6b0f70001"
Expand Down
2 changes: 1 addition & 1 deletion test/rstar_tests.jl
Original file line number Diff line number Diff line change
Expand Up @@ -31,6 +31,6 @@ classif = DecisionTreeClassifier()
chn_notmixed = Chains(val)

# Restuling R value should be close to two, i.e. the classifier should be able to learn an almost perfect decision boundary between chains.
R = rstar(classif, chn_notmixed)
R = rstar(classif, chn_notmixed; split_chains=1)
@test mean(R) ≈ 2 atol=0.1
end