Detecting AI Training in Datacentre Power
Organizations: School of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia · Machine Alignment, Transparency & Security (MATS) · Department of Engineering Science, University of Oxford, Oxford, UK
Abstract
AI governance agreements require methods to detect large model training runs on a monitored computing cluster, without trusting the operator. We develop a method to detect synchronous model training in facility-level power by Viterbi tracking of the wandering iteration cadence. On simulated datacentre power, when the operator makes no attempt to hide, the Viterbi tracker detects at least of training runs against a declared inference workload, at a false-alarm rate and within of the Neyman--Pearson optimum, given a meter that samples at Hz or faster. Of eight adversarial strategies an operator might use to hide, only extreme variation of the work per iteration evades the tracker. Its strongest form hides training in up to of five-minute observations, but over a day at least of such runs are still caught, at a false-alarm rate per run. This adversarial strategy costs no throughput, but in small-scale training the operator needs -- more compute to reach the same loss. A modest passive meter is sufficient to make hidden training both detectable and expensive, which makes power metering a promising part of compute verification that does not depend on trusting the operator.
Figures & tables
| Symbol | Train | Fine-tune | |
|---|---|---|---|
| Cadence band [Hz] | |||
| Period jitter | |||
| Phase ratio | |||
| Offset spread | |||
| Down-phase offset | |||
| Up noise range |
| Stage | Parameter | Nominal | Swept | Stands for |
| Delivery path ( ; the identity in the workload model) | ||||
| Butterworth low-pass (order 2) | cutoff [Hz] | off | – | PSU/PDU bandwidth, smoothing |
| In-band notch | depth; centre [Hz]; | off | – ; – ; | delivery-path anti-resonance |
| Instrument ( and sampling; chosen by the verifier) | ||||
| Trailing boxcar integration | window [s] | – | meter averaging | |
| Gain | — | calibration factor | ||
| Strategy | What the operator changes | Budget knob (range) | Cost anchor |
| Timing | |||
| Period jitter | i.i.d. period jitter of Equation 1 , by inserting idle time | measured | |
| Cadence drift | OU excursion of Equation 3 | Hz | measured |
| Work variation | micro-steps per iteration , drawn about with fractional spread ; down-phase unchanged | measured | |
| Phase slip | Brownian slip of iteration boundaries at fixed mean period | slip std periods | — |
| Frequency | |||
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
| Control load | Training? | Linear | Logistic | Forest |
|---|---|---|---|---|
| Discarded-update decoy | no | 1.00 | 1.00 | 1.00 |
| Gradient-only | no | 0.97 | 1.00 | 1.00 |
| Non-ML kernel loop | no | 1.00 | 1.00 | 1.00 |
| Controller cycle | no | 1.00 | 1.00 | 1.00 |
| Periodic inference | no | 1.00 | 1.00 | 1.00 |
| Co-resident mixture | yes | 1.00 | 1.00 | 1.00 |
Adversarial Attacks
Adversarial attacks exploit crafted inputs, poisoned data, or system interactions to manipulate AI predictions, behavior, privacy, or reliability.
See all 451 papers