Search Results for author:
Found 2 papers, 1 papers with code
On the Tractability of SHAP Explanations
First, we consider fully-factorized data distributions, and show that the complexity of computing the SHAP explanation is the same as the complexity of computing the expected value of the model.
CHORUS: Foundation Models for Unified Data Discovery and Exploration
On all three tasks, we show that a foundation-model-based approach outperforms the task-specific models and so the state of the art.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
