Evaluating Black-Box Vulnerabilities with Wasserstein-Constrained Data Perturbations
Organizations: Independent Researcher · INRIA Regalia & ANITI · Institut de Math´ematiques de Toulouse, France · Centre INRIA de l’Universit´e de Bordeaux
Abstract
The growing use of Machine Learning (ML) tools comes with critical challenges, such as limited model explainability. We propose a global explainability framework that leverages Optimal Transport and Distributionally Robust Optimization to analyze how ML algorithms respond to constrained data perturbations. Our approach enforces constraints on feature-level statistics (e.g., brightness, age distribution), generating realistic perturbations that preserve semantic structure. We provide a model-agnostic diagnostic bench that applies to both tabular and image domains with solid theoretical guarantees. We validate the approach on real-world datasets providing interpretable robustness diagnostics that complement standard evaluation and fairness auditing tools.
Figures & tables
Appendix figures & tables4 assets
Supplementary material from the paper’s appendix.
Appendix
Explainability Evaluation
Explainability evaluation tests whether AI explanations are faithful, stable, understandable, useful, and reliable across models and settings.
See all 321 papers