Last updated on 2024-08-16 21:49:02 CEST.
Flavor | Version | Tinstall | Tcheck | Ttotal | Status | Flags |
---|---|---|---|---|---|---|
r-devel-linux-x86_64-debian-clang | 0.3.3 | 6.72 | 70.58 | 77.30 | NOTE | |
r-devel-linux-x86_64-debian-gcc | 0.3.3 | 5.05 | 51.68 | 56.73 | NOTE | |
r-devel-linux-x86_64-fedora-clang | 0.3.3 | 123.34 | NOTE | |||
r-devel-linux-x86_64-fedora-gcc | 0.3.3 | 130.63 | NOTE | |||
r-devel-windows-x86_64 | 0.3.3 | 8.00 | 134.00 | 142.00 | NOTE | |
r-patched-linux-x86_64 | 0.3.3 | 6.86 | 66.12 | 72.98 | NOTE | |
r-release-linux-x86_64 | 0.3.3 | 5.83 | 67.25 | 73.08 | NOTE | |
r-release-macos-arm64 | 0.3.3 | 42.00 | NOTE | |||
r-release-macos-x86_64 | 0.3.3 | 65.00 | NOTE | |||
r-release-windows-x86_64 | 0.3.3 | 7.00 | 136.00 | 143.00 | NOTE | |
r-oldrel-macos-arm64 | 0.3.3 | 43.00 | OK | |||
r-oldrel-macos-x86_64 | 0.3.3 | 68.00 | OK | |||
r-oldrel-windows-x86_64 | 0.3.3 | 10.00 | 119.00 | 129.00 | OK |
Version: 0.3.3
Check: Rd files
Result: NOTE
checkRd: (-1) h2o4gpu.gradient_boosting_classifier.Rd:62: Lost braces; missing escapes or markup?
62 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
checkRd: (-1) h2o4gpu.gradient_boosting_regressor.Rd:64: Lost braces; missing escapes or markup?
64 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
checkRd: (-1) h2o4gpu.random_forest_classifier.Rd:58: Lost braces; missing escapes or markup?
58 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
checkRd: (-1) h2o4gpu.random_forest_regressor.Rd:56: Lost braces; missing escapes or markup?
56 | \item{tree_method}{The tree construction algorithm used in XGBoost Distributed and external memory version only support approximate algorithm. Choices: {‘auto’, ‘exact’, ‘approx’, ‘hist’, ‘gpu_exact’, ‘gpu_hist’} ‘auto’: Use heuristic to choose faster one. - For small to medium dataset, exact greedy will be used. - For very large-dataset, approximate algorithm will be chosen. - Because old behavior is always use exact greedy in single machine, - user will get a message when approximate algorithm is chosen to notify this choice. ‘exact’: Exact greedy algorithm. ‘approx’: Approximate greedy algorithm using sketching and histogram. ‘hist’: Fast histogram optimized approximate greedy algorithm. It uses some performance improvements such as bins caching. ‘gpu_exact’: GPU implementation of exact algorithm. ‘gpu_hist’: GPU implementation of hist algorithm.}
| ^
Flavors: r-devel-linux-x86_64-debian-clang, r-devel-linux-x86_64-debian-gcc, r-devel-linux-x86_64-fedora-clang, r-devel-linux-x86_64-fedora-gcc, r-devel-windows-x86_64, r-patched-linux-x86_64, r-release-linux-x86_64, r-release-macos-arm64, r-release-macos-x86_64, r-release-windows-x86_64
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.