1 citations · 1 across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.AI2024
Neural Interactive Proofs
Lewis Hammond, Sam Adam-Day
We consider the problem of how a trusted, but computationally bounded agent (a 'verifier') can learn to interact with one or more powerful but untrusted agents ('provers') in order…
cs.LG2024
Almost Surely Asymptotically Constant Graph Neural Networks
Sam Adam-Day, Michael Benedikt, İsmail İlkan Ceylan +1
We present a new angle on the expressive power of graph neural networks (GNNs) by studying how the predictions of real-valued GNN classifiers, such as those classifying graphs prob…