One Permutation Is All You Need: Fast, Reliable Variable Importance and Model Stress-Testing
Albert Dorador

TL;DR
This paper introduces a deterministic permutation method for feature importance that is faster, more stable, and more accurate than traditional stochastic approaches, with applications in model auditing and systemic risk assessment.
Contribution
It proposes replacing multiple random permutations with a single optimal permutation for importance estimation, and extends this to systemic importance for model stress-testing.
Findings
Improved bias-variance tradeoff in importance estimation
Enhanced stability and speed over traditional permutation methods
Effective in detecting model reliance on protected attributes
Abstract
Reliable estimation of feature contributions in machine learning models is essential for trust, transparency and regulatory compliance, especially when models are proprietary or otherwise operate as black boxes. While permutation-based methods are a standard tool for this task, classical implementations rely on repeated random permutations, introducing computational overhead and stochastic instability. In this paper, we show that by replacing multiple random permutations with a single, deterministic, and optimal permutation, we achieve a method that retains the core principles of permutation-based importance while being non-random, faster, and more stable. We validate this approach across nearly 200 scenarios, including real-world household finance and credit risk applications, demonstrating improved bias-variance tradeoffs and accuracy in challenging regimes such as small sample sizes,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Ethics and Social Impacts of AI · Adversarial Robustness in Machine Learning
