[ICML 2019, 20 min long talk] Robust Decision Trees Against Adversarial Examples
-
Updated
Sep 30, 2022 - C++
[ICML 2019, 20 min long talk] Robust Decision Trees Against Adversarial Examples
A fast, distributed, high performance gradient boosting (GBT, GBDT, GBRT, GBM or MART) framework based on decision tree algorithms, used for ranking, classification and many other machine learning tasks.
Scalable, Portable and Distributed Gradient Boosting (GBDT, GBRT or GBM) Library, for Python, R, Java, Scala, C++ and more. Runs on single machine, Hadoop, Spark, Dask, Flink and DataFlow
Add a description, image, and links to the gbrt topic page so that developers can more easily learn about it.
To associate your repository with the gbrt topic, visit your repo's landing page and select "manage topics."