1 citations · 1 across the 10 of their papers we have counts for
10 papers
Scaling Trends for Lie Detector Oversight in Preference Learning
Oskar J. Hollinsworth, Ann-Kathrin Dombrowski, Sam Adam-Day +2
Deceptive behavior in LLMs is costly to monitor and prevent, motivating approaches such as Scalable Oversight via Lie Detectors (SOLiD) (Cundy & Gleave, 2025), which uses lie detec…
Convergence Laws for Extensions of First-Order Logic with Averaging
Sam Adam-Day, Michael Benedikt, Alberto Larrauri
For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with c…
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…
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…
The Intermediate Logic of Convex Polyhedra
Sam Adam-Day, Nick Bezhanishvili, David Gabelaia +1
We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of al…
Zero-One Laws of Graph Neural Networks
Sam Adam-Day, Theodor Mihai Iliant, İsmail İlkan Ceylan
Graph neural networks (GNNs) are the de facto standard deep learning architectures for machine learning on graphs. This has led to a large body of work analyzing the capabilities a…
Bisimulations of potentialist systems
Sam Adam-Day
A potentialist system is a first-order Kripke model based on embeddings. I define the notion of bisimulation for these systems, and provide a number of examples. Given a first-orde…
Uniform, rigid branchwise-real trees
Sam Adam-Day
A branchwise-real tree is a partial order which is a tree and in which every branch is isomorphic to a real interval. I give constructions of such trees which are both rigid (i.e.…
Polyhedral completeness of intermediate logics: the Nerve Criterion
Sam Adam-Day, Nick Bezhanishvili, David Gabelaia +1
We investigate a recently-devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally…
On the continuous gradability of the cut-point orders of -trees
Sam Adam-Day
An -tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders und…