31 citations · 83 across the 33 of their papers we have counts for
45 papers
Model Comparison Games for Generalized Quantifiers
Antti Kuusisto, Miguel Moreno, Matias Selin
We introduce three new model comparison games that characterize separability by first-order formulas with generalized quantifiers. The first is built on the Ehrenfeucht-Fraïssé gam…
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
Interpretability and explainability are among the most important challenges of modern artificial intelligence, being mentioned even in various legislative sources. In this article,…
Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
Reijo Jaakkola, Antti Kuusisto, Miikka Vilander
The description complexity of a model is the length of the shortest formula that defines the model. We study the description complexity of unary structures in first-order logic FO,…
Interpretable classifiers for tabular data via discretization and feature selection
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
We introduce a method for computing immediately human interpretable yet accurate classifiers from tabular data. The classifiers obtained are short Boolean formulas, computed via fi…
Descriptive complexity for neural networks via Boolean networks
Veeti Ahvonen, Damian Heiman, Antti Kuusisto
We investigate the expressive power of neural networks from the point of view of descriptive complexity. We study neural networks that use floating-point numbers and piecewise poly…
Short Boolean Formulas as Explanations in Practice
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minim…