Zobrazeno 1 - 10
of 144
pro vyhledávání: '"Kuusisto, Antti"'
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, also drawing links to semantic complexity in the form of entropy. The
Externí odkaz:
http://arxiv.org/abs/2406.02108
Autor:
Jaakkola, Reijo, Janhunen, Tomi, Kuusisto, Antti, Rankooh, Masood Feyzbakhsh, Vilander, Miikka
Interpretability and explainability are among the most important challenges of modern artificial intelligence, being mentioned even in various legislative sources. In this article, we develop a method for extracting immediately human interpretable cl
Externí odkaz:
http://arxiv.org/abs/2406.01114
In pioneering work from 2019, Barcel\'o and coauthors identified logics that precisely match the expressive power of constant iteration-depth graph neural networks (GNNs) relative to properties definable in first-order logic. In this article, we give
Externí odkaz:
http://arxiv.org/abs/2405.14606
Autor:
Jaakkola, Reijo, Janhunen, Tomi, Kuusisto, Antti, Rankooh, Masood Feyzbakhsh, Vilander, Miikka
We introduce a method for computing immediately human interpretable yet accurate classifiers from tabular data. The classifiers obtained are short Boolean formulas, computed via first discretizing the original data and then using feature selection co
Externí odkaz:
http://arxiv.org/abs/2402.05680
We examine the relationship of graded (multi)modal logic to counting (multichannel) message passing automata with applications to the Weisfeiler-Leman algorithm. We introduce the notion of graded multimodal types, which are formulae of graded multimo
Externí odkaz:
http://arxiv.org/abs/2401.06519
We investigate the descriptive complexity of a class of neural networks with unrestricted topologies and piecewise polynomial activation functions. We consider the general scenario where the running time is unlimited and floating-point numbers are us
Externí odkaz:
http://arxiv.org/abs/2308.06277
Autor:
Jaakkola, Reijo, Janhunen, Tomi, Kuusisto, Antti, Rankooh, Masood Feyzbakhsh, Vilander, Miikka
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 minimizes the error with respect to the target attribute to be explained. W
Externí odkaz:
http://arxiv.org/abs/2307.06971
We consider distributed algorithms in the realistic scenario where distributed message passing is operated via circuits. We show that within this setting, modal substitution calculus MSC captures the expressive power of circuits. The translations bet
Externí odkaz:
http://arxiv.org/abs/2303.04735
This paper links sizes of model classes to the minimum lengths of their defining formulas, that is, to their description complexities. Limiting to models with a fixed domain of size n, we study description complexities with respect to the extension o
Externí odkaz:
http://arxiv.org/abs/2301.13800
We demonstrate some novel links between entropy and description complexity, a notion referring to the minimal formula length for specifying given properties. Let MLU be the logic obtained by extending propositional logic with the universal modality,
Externí odkaz:
http://arxiv.org/abs/2209.12564