[jvm-packages] efficient optimal # of trees search
Open
- Dominant language
- C++
- Stars
- 28.8k
- Forks
- 8.9k
- Avg merge
- 1d 12h
- Merged PRs (30d)
- 54
Description
when using Spark's cross validation api to search `round` , every experiment is started from iteration 0 which is costly and unnecessary for gbm
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.