mlsanityData to 14 Oct 2026

Decorrelated feature importance from local sample weighting

arXiv 2508.06337 ↗First posted 8 Aug 2025stat.ML cs.LG stat.MEcited by 1

Not on the map. Why?

Abstract (arXiv)

Feature importance (FI) statistics provide a prominent and valuable method of insight into the decision process of machine learning (ML) models, but their effectiveness has well-known limitations when correlation is present among the features in the training data. In this case, the FI often tends to be distributed among all features which are in correlation with the response-generating signal features. Even worse, if multiple signal features are in strong correlation with a noise feature, while being only modestly correlated with one another, this can result in a noise feature having a distinctly larger FI score than any signal feature. Here we propose local sample weighting (losaw) which can flexibly be integrated into many ML algorithms to improve FI scores in the presence of feature correlation in the training data. Our approach is motivated from inverse probability weighting in causal inference and locally, within the ML model, uses a sample weighting scheme to decorrelate a target feature from the remaining features. This reduces model bias locally, whenever the effect of a potential signal feature is evaluated and compared to others. Moreover, losaw comes with a natural tuning parameter, the minimum effective sample size of the weighted population, which corresponds to an interpretation-prediction-tradeoff, analog to a bias-variance-tradeoff as for classical ML tuning parameters. We demonstrate how losaw can be integrated within decision tree-based ML methods and within mini-batch training of neural networks. We investigate losaw for random forest and convolutional neural networks in a simulation study on settings showing diverse correlation patterns. We found that losaw improves FI consistently. Moreover, it often improves prediction accuracy for out-of-distribution, while maintaining a similar accuracy for in-distribution test data.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 46 references that are in the map. First posted on arXiv 8 Aug 2025.

Builds on

20 of 46 references.

References · 20

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
  3. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  4. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  5. 2016Distribution-Free Predictive Inference For Regressioncited by 668
  6. 2021Deep Stable Learning for Out-Of-Distribution Generalizationcited by 153
  7. 2016Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selectioncited by 121
  8. 2019Stable Learning via Sample Reweightingcited by 70
  9. 2020Stable Prediction with Model Misspecification and Agnostic Distribution Shiftcited by 62
  10. 2017Iterative Random Forests to detect predictive and stable high-order interactionscited by 42
  11. 2013Correlation and variable importance in random forestscited by 41
  12. 2019Testing Conditional Independence in Supervised Learning Algorithmscited by 27
8 more
  1. 2021A Theoretical Analysis on Independence-driven Importance Weighting for Covariate-shift Generalizationcited by 19
  2. 2021Decorrelated Variable Importancecited by 13
  3. 2022Stable Learning via Sparse Variable Independencecited by 13
  4. 2022LOCO Feature Importance Inference without Data Splitting via Minipatch Ensemblescited by 6
  5. 2021On the Trustworthiness of Tree Ensemble Explainability Methodscited by 5
  6. 2023Learning Generalizable Agents via Saliency-Guided Features Decorrelationcited by 4
  7. 2024Disentangling Interactions and Dependencies in Feature Attributioncited by 4
  8. 2023Invariant Random Forest: Tree-Based Model Solution for OOD Generalizationcited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.