Fetching the paper…
Reading the bibliography…
Due to their power and ease of use, tree-based machine learning models, such as random forests and gradient-boosted tree ensembles, have become very popular.
A value for n-person games, Contributions to the Theory of Games, 2, 307–317, 1953
L. S. Shapley · 1953
Earlier work this paper cites.
Weighted voting doesn’t work: A mathematical analysis
J. F. Banzhaf III · 1964
Earlier work this paper cites.
Cooperative games with coalition structures
R. J. Aumann and J. H. Dreze · 1974
Earlier work this paper cites.
Values of games with a priori unions
G. Owen · 1977
Earlier work this paper cites.
Monotonic solutions of cooperative games
H. P. Young · 1985
Earlier work this paper cites.
Ensemble methods in machine learning
T. G. Dietterich · 2000
Earlier work this paper cites.
Random forests
L. Breiman · 2001
Earlier work this paper cites.
Greedy function approximation: a gradient boosting machine
J. H. Friedman · 2001
Earlier work this paper cites.
Boosted decision trees as an alternative to artificial neural networks for particle identification
B. P. Roe, H.-J. Yang, J. Zhu, Y. Liu, I. Stancu, and G. McGregor · 2005
Earlier work this paper cites.
An empirical comparison of supervised learning algorithms
R. Caruana and A. Niculescu-Mizil · 2006
Earlier work this paper cites.
In Theory of Probability and Random Processes
L. Koralov and Y. Sinai · 2007
Earlier work this paper cites.
The elements of statistical learning: data mining, inference, and prediction
T. Hastie, R. Tibshirani, J. H. Friedman, and J. H. Friedman · 2009
Earlier work this paper cites.
A two-step Shapley value for cooperative games with coalition structures
Y. Kamijo · 2009
Earlier work this paper cites.
Adapting boosting for information retrieval measures
Q. Wu, C. J. Burges, K. M. Svore, and J. Gao · 2010
Earlier work this paper cites.
Accurate intelligible models with pairwise interactions
Y. Lou, R. Caruana, J. Gehrke, and G. Hooker · 2013
Earlier work this paper cites.
Practical lessons from predicting clicks on ads at Facebook
X. He, J. Pan, O. Jin, T. Xu, B. Liu, T. Xu, Y. Shi, A. Atallah, R. Herbrich, S. Bowers, et al · 2014
Earlier work this paper cites.
On the number of linear regions of deep neural networks
G. F. Montufar, R. Pascanu, K. Cho, and Y. Bengio · 2014
Earlier work this paper cites.
Explaining prediction models and individual predictions with feature contributions
E. Štrumbelj and I. Kononenko · 2014
Earlier work this paper cites.
Ailerons Data
L. Torgo and R. Camacho · 2014
Earlier work this paper cites.
Online News Popularity
K. Fernandes, P. Vinagre, P. Cortez, and P. Sernadela · 2015
Earlier work this paper cites.
Measuring dependence powerfully and equitably
Y. A. Reshef, D. N. Reshef, H. K. Finucane, P. C. Sabeti, and M. Mitzenmacher · 2015
Earlier work this paper cites.
XGBoost: A scalable tree boosting system
T. Chen and C. Guestrin · 2016
Earlier work this paper cites.
Algorithmic transparency via quantitative input influence: Theory and experiments with learning systems
A. Datta, S. Sen, and Y. Zick · 2016
Earlier work this paper cites.
Enhancing LambdaMART Using Oblivious Trees
M. Ferov and M. Modrý · 2016
Earlier work this paper cites.
"Why should I trust you?" Explaining the predictions of any classifier
M. T. Ribeiro, S. Singh, and C. Guestrin · 2016
Earlier work this paper cites.
A mixed-ensemble model for hospital readmission
L. Turgeman and J. H. May · 2016
Cited alongside, same era.
LightGBM: A highly efficient gradient boosting decision tree
G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, and T.-Y. Liu · 2017
Cited alongside, same era.
Interpretable & Explorable Approximations of Black Box Models
H. Lakkaraju, E. Kamar, R. Caruana, and J. Leskovec · 2017
Cited alongside, same era.
A unified approach to interpreting model predictions
S. M. Lundberg and S.-I. Lee · 2017
Cited alongside, same era.
On the expressive power of deep neural networks
M. Raghu, B. Poole, J. Kleinberg, S. Ganguli, and J. Sohl-Dickstein · 2017
Cited alongside, same era.
Axiomatic attribution for deep networks
M. Sundararajan, A. Taly, and Q. Yan · 2017
Interpretable machine learning
C. Molnar · 2020
Later among the works it cites.
Unwrapping The Black Box of Deep ReLU Networks: Interpretability, Diagnostics, and Simplification
A. Sudjianto, W. Knauth, R. Singh, Z. Yang, and A. Zhang · 2020
Later among the works it cites.
The many Shapley values for model explanation
M. Sundararajan and A. Najmi · 2020
Later among the works it cites.
Enhancing explainability of neural networks through architecture constraints
Z. Yang, A. Zhang, and A. Sudjianto · 2020
Later among the works it cites.
Explaining individual predictions when features are dependent: More accurate approximations to Shapley values
K. Aas, M. Jullum, and A. Løland · 2021
Later among the works it cites.
Explaining models by propagating Shapley values of local components
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Towards robust interpretability with self-explaining neural networks
D. Alvarez Melis and T. Jaakkola · 2018
Cited alongside, same era.
Application of ensemble models in credit scoring models
A. Chopra and P. Bhilare · 2018
Cited alongside, same era.
CatBoost: gradient boosting with categorical features support
A. Dorogush, V. Ershov, and A. Gulin · 2018
Cited alongside, same era.
Superconductivty Data
K. Hamidieh · 2018
Cited alongside, same era.
Consistent Individualized Feature Attribution for Tree Ensembles
S. M. Lundberg, G. G. Erion, and S.-I. Lee · 2018
Cited alongside, same era.
Anchors: High-precision model-agnostic explanations
M. T. Ribeiro, S. Singh, and C. Guestrin · 2018
Cited alongside, same era.
H. Chen, S. Lundberg, and S.-I. Lee · 2021
Later among the works it cites.
Supervised machine learning techniques: An overview with applications to banking
L. Hu, J. Chen, J. Vaughan, S. Aramideh, H. Yang, K. Wang, A. Sudjianto, and V. N. Nair · 2021
Later among the works it cites.
groupShapley: Efficient prediction explanation with Shapley values for feature groups
M. Jullum, A. Redelmeier, and K. Aas · 2021
Later among the works it cites.
Explainable Artificial Intelligence: An Introduction to Interpretable Machine Learning
U. Kamath and J. Liu · 2021
Later among the works it cites.
Stability theory of game-theoretic group feature explanations for machine learning models
A. Miroshnikov, K. Kotsiopoulos, K. Filom, and A. R. Kannan · 2021
Later among the works it cites.
Designing Inherently Interpretable Machine Learning Models
A. Sudjianto and A. Zhang · 2021
Later among the works it cites.
Fast TreeSHAP: Accelerating SHAP Value Computation for Trees
J. Yang · 2021
Later among the works it cites.
GAMI-Net: An explainable neural network based on generalized additive models with structured interactions
Z. Yang, A. Zhang, and A. Sudjianto · 2021
Later among the works it cites.
Self-interpretable Convolutional Neural Networks for Text Classification
W. Zhao, R. Singh, T. Joshi, A. Sudjianto, and V. N. Nair · 2021
Later among the works it cites.
Accurate Shapley values for explaining tree-based models
S. I. Amoukou, T. Salaün, and N. Brunel · 2022
Later among the works it cites.
Exact Shapley values for local and model-true explanations of decision tree ensembles
T. W. Campbell, H. Roder, R. W. Georgantas III, and J. Roder · 2022
Later among the works it cites.
Algorithms to estimate Shapley value feature attributions
H. Chen, I. C. Covert, S. M. Lundberg, and S.-I. Lee · 2022
Later among the works it cites.
Why do tree-based models still outperform deep learning on typical tabular data?
L. Grinsztajn, E. Oyallon, and G. Varoquaux · 2022
Later among the works it cites.
When to Choose CatBoost Over XGBoost or LightGBM [Practical Guide] (neptun.ai), 2022
B. John · 2022
Later among the works it cites.
Improved feature importance computation for tree models based on the Banzhaf value
A. Karczmarz, T. Michalak, A. Mukherjee, P. Sankowski, and P. Wygocki · 2022
Later among the works it cites.
XGBoost vs LightGBM: How Are They Different (neptun.ai), 2022
S. Saha · 2022
Later among the works it cites.
Fast Interpretable Greedy-Tree Sums (FIGS)
Y. Shuo Tan, C. Singh, K. Nasseri, A. Agarwal, and B. Yu · 2022
Later among the works it cites.
Tabular data: Deep learning is not all you need
R. Shwartz-Ziv and A. Armon · 2022
Later among the works it cites.
K. Kotsiopoulos, A. Miroshnikov, K. Filom, and A. R. Kannan · 2023
Closest in time.