Bibliographic record
Abstract
Machine learning (ML) has seen a tremendous rise in interest in recent years, with neural networks in particular gaining widespread adoption. ML models run on many types of hardware, ranging from low-power IoT devices to powerful GPUs and a plethora of dedicated accelerators. However, their popularity has made systems using ML susceptible to several attacks. To safely enable their widespread use, this thesis details mechanisms to improve the security and safeguard the privacy of ML systems. To this end, we make three contributions: FARO, AESIR and EMPATIC.Our first contribution (FARO) secures the weights of ML models running on low-power IoT devices against side-channel attacks. Such attacks allow for the entire model to be stolen merely by analyzing several power traces of the device. For the attack to work however, operations must be performed in the same order in each trace. To prevent this, FARO adds hardware to randomly shuffle the order of operations during each run as a functional unit within the CPU. FARO secures the crucial weights of the model, while adding < 5% area, latency and power overheads. The second contribution (AESIR) enables edge ML accelerators to run security-critical ML algorithms such as differentially private ML (DP-ML). Current ML accelerator designs lack CPUs and are unable to provide the random noise required by such algorithms. AESIR details simple hardware modifications to enable noise addition from arbitrary distributions. Compared to dedicated on-chip hardware for generating noise, AESIR adds 23× lower area and 40× lower energy while also being secure against side-channel attacks. The final contribution (EMPATIC) accelerates adversarial training, used to train models which are more robust against adversarial attacks. We do so by efficiently using the support for high throughput 8-bit floating point (FP8) provided by modern GPUs. Directly training models using FP8 is challenging due to the extremely narrow range of this datatype. We propose EMPATIC, where we cluster the training data so that groups of similar inputs are run contiguously. We then calculate the difference within each group – which have a smaller range than the original data – and use FP8 for performing computations with these differences. EMPATIC matches the accuracy of models trained using higher precision, while effectively using the higher throughput provided by modern GPUs for FP8 computation. Together, our three contributions help improve the security of ML models and protect the privacy of user data used to train ML models.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.005 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".