Fetching the paper…
Reading the bibliography…
The interpretation of feature importance in machine learning models is challenging when features are dependent.
Fortet R, Mourier E (1953) Convergence de la répartition empirique vers la répartition théorique. In: Annales scientifiques de l’École Normale Supérieure, vol 70, pp 267–285
1953
Earlier work this paper cites.
Breiman L, Friedman J, Olshen R, Stone C (1984) Classification and Regression Trees. Wadsworth and Brooks
1984
Earlier work this paper cites.
Friedman JH, et al. (1991) Multivariate adaptive regression splines. The annals of statistics 19(1):1–67
1991
Earlier work this paper cites.
Bryk AS, Raudenbush SW (1992) Hierarchical linear models: Applications and data analysis methods. Sage Publications, Inc
1992
Earlier work this paper cites.
Cooil B, Rust RT (1994) Reliability and expected loss: A unifying principle. Psychometrika 59(2):203–216
1994
Earlier work this paper cites.
Toloşi L, Lengauer T (2011) Classification with correlated features: unreliability of feature ranking and solutions. Bioinformatics 27(14):1986–1994
1994
Earlier work this paper cites.
Breiman L (2001) Random forests. Machine learning 45(1):5–32
2001
Earlier work this paper cites.
Gretton A, Fukumizu K, Teo CH, Song L, Schölkopf B, Smola AJ, et al. (2007) A kernel statistical test of independence. In: Nips, Citeseer, vol 20, pp 585–592
2007
Earlier work this paper cites.
Hooker G (2007) Generalized functional anova diagnostics for high-dimensional functions of dependent variables. J Comput Graph Stat 16(3)
2007
Earlier work this paper cites.
Smola A, Gretton A, Song L, Schölkopf B (2007) A hilbert space embedding for distributions. In: International Conference on Algorithmic Learning Theory, Springer, pp 13–31
2007
Earlier work this paper cites.
Strobl C, Boulesteix AL, Kneib T, Augustin T, Zeileis A (2008) Conditional variable importance for random forests. BMC bioinformatics 9(1):307
2008
Earlier work this paper cites.
Gretton A, Borgwardt KM, Rasch MJ, Schölkopf B, Smola A (2012) A kernel two-sample test. The Journal of Machine Learning Research 13(1):723–773
2012
Earlier work this paper cites.
Vanschoren J, Van Rijn JN, Bischl B, Torgo L (2014) OpenML: networked science in machine learning. ACM SIGKDD Explorations Newsletter 15(2):49–60
2014
Earlier work this paper cites.
Goldstein A, Kapelner A, Bleich J, Pitkin E (2015) Peeking inside the black box: Visualizing statistical learning with plots of individual conditional expectation. J Comput Graph Stat 24(1):44–65
2015
Earlier work this paper cites.
Hothorn T, Zeileis A (2015) partykit: A modular toolkit for recursive partytioning in r. The Journal of Machine Learning Research 16(1):3905–3909
2015
Earlier work this paper cites.
Apley DW, Zhu J (2016) Visualizing the effects of predictor variables in black box supervised learning models. arXiv preprint arXiv:161208468
2016
Cited alongside, same era.
Ribeiro MT, Singh S, Guestrin C (2016) Why should i trust you?: Explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 1135–1144
2016
Cited alongside, same era.
Casalicchio G, Bossek J, Lang M, Kirchhoff D, Kerschke P, Hofner B, Seibold H, Vanschoren J, Bischl B (2017) OpenML: An R package to connect to the machine learning platform OpenML. Comput Stat
2017
Cited alongside, same era.
Dua D, Graff C (2017) UCI machine learning repository. URL http://archive.ics.uci.edu/ml
2017
Cited alongside, same era.
Gregorutti B, Michel B, Saint-Pierre P (2017) Correlation and variable importance in random forests. Statistics and Computing 27(3):659–678
Fisher A, Rudin C, Dominici F (2019) All models are wrong, but many are useful: Learning a variable’s importance by studying an entire class of prediction models simultaneously. Journal of Machine Learning Research 20(177):1–81
2019
Later among the works it cites.
Hooker G, Mentch L (2019) Please stop permuting features: An explanation and alternatives. arXiv preprint arXiv:190503151
2019
Later among the works it cites.
Lang M, Binder M, Richter J, Schratz P, Pfisterer F, Coors S, Au Q, Casalicchio G, Kotthoff L, Bischl B (2019) mlr3: A modern object-oriented machine learning framework in R. Journal of Open Source Software
2019
Later among the works it cites.
Molnar C (2019) Interpretable Machine Learning. https://christophm.github.io/interpretable-ml-book/
2019
Later among the works it cites.
Parr T, Wilson JD (2019) A stratification approach to partial dependence for codependent variables. arXiv preprint arXiv:190706698
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
Hothorn T, Zeileis A (2017) Transformation forests. arXiv preprint arXiv:170102110
2017
Cited alongside, same era.
R Core Team (2017) R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria
2017
Cited alongside, same era.
Candes E, Fan Y, Janson L, Lv J (2018) Panning for gold:‘model-x’knockoffs for high dimensional controlled variable selection. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 80(3):551–577
2018
Cited alongside, same era.
Guidotti R, Monreale A, Ruggieri S, Turini F, Giannotti F, Pedreschi D (2018) A survey of methods for explaining black box models. ACM computing surveys (CSUR) 51(5):1–42
2018
Cited alongside, same era.
Hothorn T (2018) Top-down transformation choice. Statistical Modelling 18(3-4):274–298
2018
Cited alongside, same era.
Lei J, G’Sell M, Rinaldo A, Tibshirani RJ, Wasserman L (2018) Distribution-free predictive inference for regression. Journal of the American Statistical Association 113(523):1094–1111
2018
Cited alongside, same era.
Molnar C, Bischl B, Casalicchio G (2018) iml: An R package for interpretable machine learning. JOSS 3(26):786
2018
Cited alongside, same era.
2019
Later among the works it cites.
Romano Y, Sesia M, Candès E (2019) Deep knockoffs. Journal of the American Statistical Association pp 1–12
2019
Later among the works it cites.
Scholbeck CA, Molnar C, Heumann C, Bischl B, Casalicchio G (2019) Sampling, intervention, prediction, aggregation: A generalized framework for model-agnostic interpretations. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Springer, pp 205–216
2019
Later among the works it cites.
Szepannek G (2019) How much can we see? A note on quantifying explainability of machine learning models. arXiv preprint arXiv:191013376
2019
Later among the works it cites.
Watson DS, Wright MN (2019) Testing conditional independence in supervised learning algorithms. arXiv preprint arXiv:190109917
2019
Later among the works it cites.
Debeer D, Strobl C (2020) Conditional permutation importance revisited. BMC bioinformatics 21(1):1–30
2020
Closest in time.
König G, Molnar C, Bischl B, Grosse-Wentrup M (2020) Relative feature importance. arXiv preprint arXiv:200708283
2020
Closest in time.
Molnar C, König G, Herbinger J, Freiesleben T, Dandl S, Scholbeck CA, Casalicchio G, Grosse-Wentrup M, Bischl B (2020) Pitfalls to avoid when interpreting machine learning models. arXiv preprint arXiv:200704131
2020
Closest in time.
Patterson E, Sesia M (2020) knockoff: The Knockoff Filter for Controlled Variable Selection. URL https://CRAN.R-project.org/package=knockoff
2020
Closest in time.
Barber RF, Candès EJ, et al. (2015) Controlling the false discovery rate via knockoffs. The Annals of Statistics 43(5):2055–2085
2085
Closest in time.