← Search

Pablo Barceló

4 accepted papers

2021

The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits

AAAI 2021technical

Scores based on Shapley values are widely used for providing explanations to classification results over machine learning models. A prime example of this is the influential SHAP-score, a version of the Shapley value that can help explain the result of a learned model on a specific entity by assignin…

Cited by 53SourcePDFScholar
2020

Model Interpretability through the lens of Computational Complexity

NeurIPS 2020poster

In spite of several claims stating that some models are more interpretable than others --e.g., "linear models are more interpretable than deep neural networks"-- we still lack a principled notion of interpretability that allows us to formally compare among different classes of models. We make a step…

Cited by 128SourcePDFScholar
2020

The Logical Expressiveness of Graph Neural Networks

ICLR 2020spotlight

The ability of graph neural networks (GNNs) for distinguishing nodes in graphs has been recently characterized in terms of the Weisfeiler-Lehman (WL) test for checking graph isomorphism. This characterization, however, does not settle the issue of which Boolean node classifiers (i.e., functions clas…

Cited by 313SourceScholar
2019

On the Turing Completeness of Modern Neural Network Architectures

ICLR 2019poster

Alternatives to recurrent neural networks, in particular, architectures based on attention or convolutions, have been gaining momentum for processing input sequences. In spite of their relevance, the computational properties of these alternatives have not yet been fully explored. We study the comput…

Cited by 186SourcePDFScholar