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

[jvm-packages] efficient optimal # of trees search #3814

CodingCat opened this Issue Oct 19, 2018 · 0 comments


None yet
1 participant

CodingCat commented Oct 19, 2018

when using Spark's cross validation api to search round , every experiment is started from iteration 0 which is costly and unnecessary for gbm

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment