1 citations · 3 across the 9 of their papers we have counts for
11 papers
On the Brittleness of LLMs: A Journey around Set Membership
Lea Hergert, Gábor Berend, Mario Szegedy +2
Large language models (LLMs) achieve superhuman performance on complex reasoning tasks, yet often fail on much simpler problems, raising concerns about their reliability and interp…
Polynomial Threshold Functions of Bounded Tree-Width: Some Explainability and Complexity Aspects
Karine Chubarian, Johnny Joyce, Gyorgy Turan
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been…
Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations
Harish G. Naik, Jan Polster, Raj Shekhar +2
We formulate an XAI-based model improvement approach for Graph Neural Networks (GNNs) for node classification, called Explanation Enhanced Graph Learning (EEGL). The goal is to imp…
Nearest neighbor representations of Boolean functions
Péter Hajnal, Zhihao Liu, György Turán
A nearest neighbor representation of a Boolean function is a set of positive and negative prototypes in such that the function has value 1 on an input iff the closest prototy…
Betweenness centrality profiles in trees
Benjamin Fish, Rahul Kushwaha, Gyorgy Turan
Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in…
Measuring an Artificial Intelligence System's Performance on a Verbal IQ Test For Young Children
Stellan Ohlsson, Robert H. Sloan, György Turán +1
We administered the Verbal IQ (VIQ) part of the Wechsler Preschool and Primary Scale of Intelligence (WPPSI-III) to the ConceptNet 4 AI system. The test questions (e.g., "Why do we…