Alternatives and similar repositories for veritas

Users that are interested in veritas are comparing it to the libraries listed below

• charmlab / mace
  Model Agnostic Counterfactual Explanations
  ☆87Updated 2 years ago
• jmikko / fair_ERM
  Fair Empirical Risk Minimization (FERM)
  ☆37Updated 4 years ago
• jcperdomo / performative-prediction
  ☆31Updated 3 years ago
• chenhongge / treeVerification
  [NeurIPS 2019] H. Chen*, H. Zhang*, S. Si, Y. Li, D. Boning and C.-J. Hsieh, Robustness Verification of Tree-based Models (*equal contrib…
  ☆27Updated 5 years ago
• vidalt / OCEAN
  OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)
  ☆20Updated last year
• iancovert / shapley-regression
  For calculating Shapley values via linear regression.
  ☆68Updated 3 years ago
• iancovert / removal-explanations
  A lightweight implementation of removal-based explanations for ML models.
  ☆59Updated 3 years ago
• Lorenzo-Perini / Active_PU_Learning
  Class Prior Estimation in Active Positive and Unlabeled Learning
  ☆15Updated 4 years ago
• chenhongge / RobustTrees
  [ICML 2019, 20 min long talk] Robust Decision Trees Against Adversarial Examples
  ☆67Updated 2 years ago
• talwagner / fair_clustering
  ☆20Updated 6 years ago
• aia-uclouvain / pydl8.5
  An algorithm for learning optimal decision trees, with Python interface
  ☆64Updated 2 years ago
• charmlab / recourse
  Code to reproduce our paper on probabilistic algorithmic recourse: https://arxiv.org/abs/2006.06831
  ☆36Updated 2 years ago
• UCLA-StarAI / Density-Estimation-Datasets
  A collection of commonly used datasets as benchmarks for density estimation
  ☆24Updated 5 years ago
• andreArtelt / ceml
  CEML - Counterfactuals for Explaining Machine Learning models - A Python toolbox
  ☆44Updated this week
• vidalt / BA-Trees
  Born-Again Tree Ensembles: Transforms a random forest into a single, minimal-size, tree with exactly the same prediction function in the …
  ☆65Updated last year
• mkusner / counterfactual-fairness
  Code for "Counterfactual Fairness" (NIPS2017)
  ☆54Updated 6 years ago
• criteo-research / continuous-fairness
  ☆22Updated 6 years ago
• laudv / bitboost
  Fast Gradient Boosting Decision Trees with Bit-Level Data Structures
  ☆17Updated 2 years ago
• tml-tuebingen / nshap
  Python package to compute interaction indices that extend the Shapley Value. AISTATS 2023.
  ☆17Updated last year
• socialfoundations / error-parity
  Achieve error-rate fairness between societal groups for any score-based classifier.
  ☆18Updated last year
• wangyongjie-ntu / CFAI
  A collection of algorithms of counterfactual explanations.
  ☆50Updated 4 years ago
• max-andr / provably-robust-boosting
  Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks [NeurIPS 2019]
  ☆50Updated 5 years ago
• dylan-slack / Fooling-LIME-SHAP
  Adversarial Attacks on Post Hoc Explanation Techniques (LIME/SHAP)
  ☆82Updated 2 years ago
• mmschlk / iXAI
  Fast and incremental explanations for online machine learning models. Works best with the river framework.
  ☆55Updated 5 months ago
• wt-hu / pyCausalFS
  pyCausalFS：A Python Library of Causality-based Feature Selection for Causal Structure Learning and Classification
  ☆69Updated 4 years ago
• iancovert / fastshap
  An amortized approach for calculating local Shapley value explanations
  ☆97Updated last year
• charliemarx / pmtools
  ☆9Updated 4 years ago
• sherbold / autorank
  ☆79Updated this week
• mirkobunse / critdd
  Critical difference diagrams with Python and Tikz
  ☆33Updated 8 months ago
• divyat09 / cf-feasibility
  Code accompanying the paper "Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifiers"
  ☆31Updated 2 years ago