Search papers, labs, and topics across Lattice.
This paper introduces certified mechanistic edits, a novel approach to verify the behavioral impact of neural network interventions by providing guarantees over continuous input regions, moving beyond the limitations of empirical testing. The authors demonstrate this method on ReLU networks and a transformer, proving skill removal and preservation using sound bound propagation to handle significantly larger input dimensions than prior exact solvers. Crucially, they also prove that finite black-box testing is insufficient for certifying skill removal, highlighting the necessity of their certified approach for robust model editing.
Mechanistic edits can now offer provable guarantees of skill removal and preservation across entire input regions, not just tested subsets.
Mechanistic edits (ablations, weight edits, activation steering) are the standard tools for unlearning a harmful capability from a neural network while preserving useful ones. Current approaches validate their effects only by testing, which can never cover an entire continuous region of inputs. Prior work at the interpretability-verification boundary certifies descriptions of a model: what a circuit computes, or whether it faithfully explains the whole. We instead certify the behavioral effect of an edit: that disabling a circuit removes one skill and provably preserves another, for every input in a region; a feature non-interference guarantee in the information-flow-security sense. We demonstrate such certified edits from toy ReLU networks up to a standard softmax + LayerNorm transformer, proving removal and preservation over continuous embedding-space regions and reaching roughly 9x the input-perturbation dimension an exact solver can handle by switching to sound bound propagation. Furthermore, we prove that no finite deterministic black-box test can certify removal, exhibiting an edit that passes exhaustive testing yet provably fails on a survivor pocket that can be made arbitrarily small. Guarantees hold on small, standard-architecture networks and, like any removal claim, presuppose that the target skill admits a decidable specification, a property which real-world harms may not have.