A logical alarm for misaligned binary classifiers
Andrés Corrada-Emmanuel, Ilya Parker, Ramesh Bharadwaj
TL;DR
This work addresses unsupervised evaluation of binary classifier ensembles by deriving a complete algebraic axiomatization for evaluation outcomes. It introduces a polynomial-generating framework and proves a single-classifier axiom for $N=1$ and a pair-axiom for $N=2$, enabling a geometrical, label-space representation of logically consistent evaluations. By enforcing a fixed safety specification and scanning all possible $Q_a$ values, it constructs a purely logical misalignment alarm that detects when at least one member is misbehaving without ground-truth labels. The approach connects formal verification techniques to AI safety, provides exact, parameter-free insights under error-independence, and discusses practical use, limitations, and societal implications for trustable supervision of noisy AI systems.
Abstract
If two agents disagree in their decisions, we may suspect they are not both correct. This intuition is formalized for evaluating agents that have carried out a binary classification task. Their agreements and disagreements on a joint test allow us to establish the only group evaluations logically consistent with their responses. This is done by establishing a set of axioms (algebraic relations) that must be universally obeyed by all evaluations of binary responders. A complete set of such axioms are possible for each ensemble of size N. The axioms for $N = 1, 2$ are used to construct a fully logical alarm - one that can prove that at least one ensemble member is malfunctioning using only unlabeled data. The similarities of this approach to formal software verification and its utility for recent agendas of safe guaranteed AI are discussed.
