arXiv Machine Learning

Detecting AI Training in Datacentre Power

The paper proposes a method to detect large AI model training runs on a data‑centre power grid using Viterbi tracking of iteration cadence. On simulated data, the tracker identifies at least 96 % of training runs with a 1 % false‑alarm rate when the operator does not hide activity, and remains effective even against several adversarial hiding strategies. The approach requires only a modest passive power meter sampling at 2 Hz or faster, making hidden training both detectable and costly for the operator.

arXiv AI
Sep 2

Workload Identification with Physical Side Channels for AI Governance

The paper demonstrates that an external observer can identify the type of workload running on an NVIDIA H200 GPU by analyzing its power draw, distinguishing training, inference, and non‑AI tasks with high accuracy. Using 930 recorded traces, the authors achieve 97% accuracy and a macro‑averaged F1 score of 0.955 on unseen model families. They also test four evasion strategies to disguise training as inference, showing that a hardened detector can catch most attacks, though one strategy (LoRA) remains partially detectable.

By Simone Gargiulo, Gabriel Kulp
arXiv AI
Sep 12

Characterizing Job Power Elasticity for Power-Flexible AI Training

The paper introduces the Power Flexibility Index (PFI) to measure how large language model (LLM) training performance changes when GPU power is reduced. Using 131 training runs on H200 and H100 GPUs, the study finds that LLM jobs have significant but variable power elasticity and identifies telemetry signals that can predict PFI during runtime. The authors demonstrate that allocating power based on PFI maximizes overall token throughput, recovering about 1.5k tokens/s per job under a 30% power reduction, which represents 63% of the gap between equal-weight and perfect-information allocations.

By Philip Colangelo, Charles Dawson, Shayan Sengupta, Ayse Coskun, Varun Sivaram
arXiv Machine Learning
Sep 30

OVIG: Optimistic Verification of AI Training Integrity via Gradient Signals

OVIG is an optimistic verification framework that audits AI training by replaying the process and comparing gradient differences against an empirically calibrated boundary. It treats any gradient difference exceeding this boundary as a malicious deviation. By partitioning training into stride‑s intervals and storing evidence only at interval endpoints, OVIG dramatically reduces off‑chain storage and transmission costs while maintaining zero attack success rate across language, vision, and diffusion workloads.

By Hongxu Su, Jianzhu Yao, Huan Zhang, Xuechao Wang, Pramod Viswanath
arXiv AI
Oct 16

LEASH: Uncertainty-Aware Weak-to-Strong Escalation and Oversight for Computer-Use Agents

LEASH is a training‑free framework that enables uncertainty‑aware escalation from a weak to a strong computer‑use agent. It uses latent uncertainty signals from the weak agent’s hidden states to decide when to hand off control, and a shadow observer to maintain oversight of the strong black‑box agent. Experiments on OSWorld show LEASH improves task success over standalone weak agents and outperforms random escalation, achieving comparable performance to Claude Opus 5 while cutting inference cost by 19.2%.

By Qingni Wang, Changdae Oh, Yuzhe Yang, Sharon Li, Jiachen Yang, Ang Li, Xin Eric Wang
arXiv Machine Learning
Aug 27

Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role

The paper presents an autonomous agent that designs machine learning algorithms for wireless power control, eliminating manual specification of architecture, loss, and training details. Using an autoresearch protocol, the agent iteratively edits a training script, runs experiments, and evaluates changes against a single metric, ultimately achieving 99.5% of a reference solution with vastly reduced inference cost. The agent’s discovered output parameterization matches the exact max‑min‑optimal allocation at the minimum percentile for all trained weights, demonstrating a principled, scalable approach to a complex, NP‑hard problem.

By Ahmad Khan, Akram Bin Sediq, Sara Azadegi Naeini, Raviraj S. Adve