← Search

Jamie Hayes

16 accepted papers

2026

Extracting alignment data in open models

ICML 2026poster

In this work, we show that it is possible to extract significant amounts of alignment training data from a post-trained model -- useful to steer the model to improve certain capabilities such as long-context reasoning, safety, instruction following, and maths. While the majority of related work on m…

Cited by 0SourceScholar
2025

Exploring the limits of strong membership inference attacks on large language models

NeurIPS 2025poster

State-of-the-art membership inference attacks (MIAs) typically require training many reference models, making it difficult to scale these attacks to large pre-trained language models (LLMs). As a result, prior research has either relied on weaker attacks that avoid training references (e.g., fine-tu…

Cited by 0SourceScholar
2025

Interpreting the Repeated Token Phenomenon in Large Language Models

ICML 2025poster

Large Language Models (LLMs), despite their impressive capabilities, often fail to accurately repeat a single word when prompted to, and instead output unrelated text. This unexplained failure mode represents a *vulnerability*, allowing even end users to diverge models away from their intended behav…

2025

Machine Unlearning Doesn't Do What You Think: Lessons for Generative AI Policy and Research

NeurIPS 2025oral

"Machine unlearning" is a popular proposed solution for mitigating the existence of content in an AI model that is problematic for legal or moral reasons, including privacy, copyright, safety, and more. For example, unlearning is often invoked as a solution for removing the effects of specific infor…

Cited by 0SourceScholar
2025

Measuring memorization in language models via probabilistic extraction

NAACL 2025long

Large language models (LLMs) are susceptible to memorizing training data, raising concerns about the potential extraction of sensitive information at generation time. Discoverable extraction is the most common method for measuring this issue: split a training example into a prefix and suffix, then p…

Cited by 2SourcePDFScholar
2025

The Last Iterate Advantage: Empirical Auditing and Principled Heuristic Analysis of Differentially Private SGD

ICLR 2025poster

We propose a simple heuristic privacy analysis of noisy clipped stochastic gradient descent (DP-SGD) in the setting where only the last iterate is released and the intermediate iterates remain hidden. Namely, our heuristic assumes a linear structure for the model. We show experimentally that our he…

Cited by 3SourcePDFScholar
2025

Unifying Re-Identification, Attribute Inference, and Data Reconstruction Risks in Differential Privacy

NeurIPS 2025poster

Differentially private (DP) mechanisms are difficult to interpret and calibrate because existing methods for mapping standard privacy parameters to concrete privacy risks---re-identification, attribute inference, and data reconstruction---are both overly pessimistic and inconsistent. In this work, w…

Cited by 0SourceScholar
2024

Beyond Slow Signs in High-fidelity Model Extraction

NeurIPS 2024poster

Deep neural networks, costly to train and rich in intellectual property value, are increasingly threatened by model extraction attacks that compromise their confiden- tiality. Previous attacks have succeeded in reverse-engineering model parameters up to a precision of float64 for models trained on r…

2024

Beyond the Calibration Point: Mechanism Comparison in Differential Privacy

ICML 2024poster

In differentially private (DP) machine learning, the privacy guarantees of DP mechanisms are often reported and compared on the basis of a single $(\varepsilon, \delta)$-pair. This practice overlooks that DP guarantees can vary substantially even between mechanisms sharing a given $(\varepsilon, \de…

Cited by 3SourcePDFScholar
2023

Mnemonist: Locating Model Parameters that Memorize Training Examples

UAI 2023poster

Recent work has shown that an adversary can reconstruct training examples given access to the parameters of a deep learning image classification model. We show that the quality of reconstruction depends heavily on the type of activation functions used. In particular, we show that ReLU activations le…

Cited by 2SourcePDFScholar
2023

Towards Unbounded Machine Unlearning

NeurIPS 2023poster

Deep machine unlearning is the problem of 'removing' from a trained neural network a subset of its training set. This problem is very timely and has many applications, including the key tasks of removing biases (RB), resolving confusion (RC) (caused by mislabelled data in trained models), as well as…

2020

A FRAMEWORK FOR ROBUSTNESS CERTIFICATION OF SMOOTHED CLASSIFIERS USING F-DIVERGENCES

ICLR 2020poster

Formal verification techniques that compute provable guarantees on properties of machine learning models, like robustness to norm-bounded adversarial perturbations, have yielded impressive results. Although most techniques developed so far require knowledge of the architecture of the machine learnin…

Cited by 64SourceScholar