Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    S0004370221000539

    Uploaded by

    an
    This paper proposes a new method for approximating Shapley values when features are dependent, in order to provide more accurate individual prediction explanations from machine learning models. The method extends Kernel SHAP to account for feature dependence, which existing approaches do not do. Experiments on linear and non-linear models with varying degrees of feature dependence show that the new method provides more accurate approximations to the true Shapley values compared to existing approaches that assume independence.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    S0004370221000539

    Uploaded by

    an
    6 views1 page
    This paper proposes a new method for approximating Shapley values when features are dependent, in order to provide more accurate individual prediction explanations from machine learning models. The method extends Kernel SHAP to account for feature dependence, which existing approaches do not do. Experiments on linear and non-linear models with varying degrees of feature dependence show that the new method provides more accurate approximations to the true Shapley values compared to existing approaches that assume independence.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This paper proposes a new method for approximating Shapley values when features are dependent, in order to provide more accurate individual prediction explanations from machine learning models. The method extends Kernel SHAP to account for feature dependence, which existing approaches do not do. Experiments on linear and non-linear models with varying degrees of feature dependence show that the new method provides more accurate approximations to the true Shapley values compared to existing approaches that assume independence.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    6 views1 page

    S0004370221000539

    Uploaded by

    an
    This paper proposes a new method for approximating Shapley values when features are dependent, in order to provide more accurate individual prediction explanations from machine learning models. The method extends Kernel SHAP to account for feature dependence, which existing approaches do not do. Experiments on linear and non-linear models with varying degrees of feature dependence show that the new method provides more accurate approximations to the true Shapley values compared to existing approaches that assume independence.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    @article{AAS2021103502,

    title = {Explaining individual predictions when features are dependent: More


    accurate approximations to Shapley values},
    journal = {Artificial Intelligence},
    volume = {298},
    pages = {103502},
    year = {2021},
    issn = {0004-3702},
    doi = {https://doi.org/10.1016/j.artint.2021.103502},
    url = {https://www.sciencedirect.com/science/article/pii/S0004370221000539},
    author = {Kjersti Aas and Martin Jullum and Anders Løland},
    keywords = {Feature attribution, Shapley values, Kernel SHAP, Dependence},
    abstract = {Explaining complex or seemingly simple machine learning models is an
    important practical problem. We want to explain individual predictions from such
    models by learning simple, interpretable explanations. Shapley value is a game
    theoretic concept that can be used for this purpose. The Shapley value framework
    has a series of desirable theoretical properties, and can in principle handle any
    predictive model. Kernel SHAP is a computationally efficient approximation to
    Shapley values in higher dimensions. Like several other existing methods, this
    approach assumes that the features are independent. Since Shapley values currently
    suffer from inclusion of unrealistic data instances when features are correlated,
    the explanations may be very misleading. This is the case even if a simple linear
    model is used for predictions. In this paper, we extend the Kernel SHAP method to
    handle dependent features. We provide several examples of linear and non-linear
    models with various degrees of feature dependence, where our method gives more
    accurate approximations to the true Shapley values.}
    }

    You might also like