laudv / veritas
Versatile Verification of Tree Ensembles
☆16Updated 3 months ago
Related projects: ⓘ
- Model Agnostic Counterfactual Explanations☆86Updated last year
- ☆27Updated 2 years ago
- For calculating Shapley values via linear regression.☆61Updated 3 years ago
- CEML - Counterfactuals for Explaining Machine Learning models - A Python toolbox☆42Updated last month
- ☆18Updated 5 years ago
- OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)☆20Updated 7 months ago
- An algorithm for learning optimal decision trees, with Python interface☆60Updated last year
- Code accompanying the paper "Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifiers"☆30Updated last year
- Class Prior Estimation in Active Positive and Unlabeled Learning☆15Updated 3 years ago
- Optimal Sparse Decision Trees☆98Updated last year
- Fast Gradient Boosting Decision Trees with Bit-Level Data Structures☆16Updated 2 years ago
- Modular Python Toolbox for Fairness, Accountability and Transparency Forensics☆73Updated last year
- [ICML 2019, 20 min long talk] Robust Decision Trees Against Adversarial Examples☆66Updated last year
- A collection of algorithms of counterfactual explanations.☆47Updated 3 years ago