Algorithms to Estimate Shapley Value Feature Attributions

dc.contributor.advisorLee, Su-In
dc.contributor.authorChen, Hugh
dc.date.accessioned2022-09-23T20:44:26Z
dc.date.available2022-09-23T20:44:26Z
dc.date.issued2022-09-23
dc.date.submitted2022
dc.descriptionThesis (Ph.D.)--University of Washington, 2022
dc.description.abstractBlack box machine learning models are increasingly prevalent. Their complex nature enables strong predictive accuracy but also makes them hard for humans to understand. One popular strategy to bridge the gap between complex models and interpretable models is to explain complex models using local feature attributions where a single sample's prediction is attributed to each of its features. In this class of explanation methods, Shapley value feature attributions have recently caught on. Although the Shapley value is appealing for its nice properties, it is NP-hard to compute in general. Here, we describe several works centered around tractably estimating the two most common variants of Shapley value feature attributions: marginal and conditional Shapley values.
dc.embargo.termsOpen Access
dc.format.mimetypeapplication/pdf
dc.identifier.otherChen_washington_0250E_24695.pdf
dc.identifier.urihttp://hdl.handle.net/1773/49309
dc.language.isoen_US
dc.rightsCC BY
dc.subjectExplainable AI
dc.subjectGame Theory
dc.subjectMachine Learning
dc.subjectShapley values
dc.subjectComputer science
dc.subject.otherComputer science and engineering
dc.titleAlgorithms to Estimate Shapley Value Feature Attributions
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Chen_washington_0250E_24695.pdf
Size:
17.96 MB
Format:
Adobe Portable Document Format