RobustTrees
Robust decision trees
An implementation of robust decision tree based models against adversarial examples using the XGBoost framework.
[ICML 2019, 20 min long talk] Robust Decision Trees Against Adversarial Examples
67 stars
7 watching
11 forks
Language: C++
last commit: almost 4 years agoLinked from 1 awesome list
adversarial-examplesdecision-treesgbdtgbmgbrtrobust-decision-treesxgboost
Related projects:
| Repository | Description | Stars |
|---|---|---|
| An approach to create adversarial examples for tree-based ensemble models | 22 | |
| An implementation of a binary decision tree using ActionScript 3.0 for AI bot/agent in video games. | 3 | |
| Provides a framework for computing tight certificates of adversarial robustness for randomly smoothed classifiers. | 17 | |
| Provides provably robust machine learning models against adversarial attacks | 50 | |
| This C++ project provides an implementation of decision tree algorithms for classification tasks | 7 | |
| A standardized benchmark for measuring the robustness of machine learning models against adversarial attacks | 682 | |
| A Python library providing a lightweight framework for building decision trees with categorical feature support | 463 | |
| Evaluates and benchmarks the robustness of deep learning models to various corruptions and perturbations in computer vision tasks. | 1,030 | |
| An implementation of incremental decision tree algorithms and ensemble methods for efficient machine learning on streaming data | 100 | |
| An R implementation of Hellinger distance decision tree algorithm. | 10 | |
| An implementation of an optimal decision tree algorithm with noisy outcomes, specifically tailored to simulate real-world decision-making under uncertainty | 0 | |
| An implementation of decision trees for classification in Racket machine learning. | 4 | |
| A collection of implementations and wrappers for a tree ensemble machine learning method | 379 | |
| A Go-based decision tree library allowing custom rule-based decision making | 37 | |
| Implementation of Hellinger Distance Decision Trees and Forests for binary decision problems with imbalanced data and numeric attributes. | 2 |