38 citations · 73 across the 10 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.AI2020★ 38 cited
Model Interpretability through the Lens of Computational Complexity
Pablo Barceló, Mikaël Monet, Jorge Pérez +1
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…
cs.CC2020★ 1 cited
The Computational Complexity of Evil Hangman
Jérémy Barbay, Bernardo Subercaseaux
The game of Hangman is a classical asymmetric two player game in which one player, the setter, chooses a secret word from a language, that the other player, the guesser, tries to d…