A General Framework for Inference on Algorithm-Agnostic Variable Importance
From MaRDI portal
Publication:6077557
DOI10.1080/01621459.2021.2003200arXiv2004.03683MaRDI QIDQ6077557
Unnamed Author, Peter B. Gilbert, Noah Robin Simon, Marco Carone
Publication date: 18 October 2023
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.03683
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy function approximation: A gradient boosting machine.
- Distribution-Free Predictive Inference For Regression
- Computationally efficient confidence intervals for cross-validated area under the ROC curve estimates
- Contributions to a general asymptotic statistical theory. With the assistance of W. Wefelmeyer
- Explaining individual predictions when features are dependent: more accurate approximations to Shapley values
- Variable importance in binary regression trees and forests
- Double/debiased machine learning for treatment and structural parameters
- Definitions, methods, and applications in interpretable machine learning
- Super Learner
- A Class of Statistics with Asymptotically Normal Distribution
- Random forests
- Nonparametric variable importance assessment using machine learning techniques
This page was built for publication: A General Framework for Inference on Algorithm-Agnostic Variable Importance