← Search

Saeed Mahloujifar

20 accepted papers

2026

CIMemories: A Compositional Benchmark For Contextual Integrity In LLMs

ICLR 2026poster

Large Language Models (LLMs) increasingly use persistent memory from past interactions to enhance personalization and task performance. However, this memory creates critical risks when sensitive information is revealed in inappropriate contexts. We present CIMemories, a benchmark for evaluating whet…

Cited by 0SourcecodeScholar
2026

How much can language models memorize?

ICML 2026oral

We propose a new method for estimating how much a model knows about a datapoint and use it to measure the capacity of modern language models. Prior studies of language model memorization have struggled to disentangle memorization from generalization. We formally separate memorization into two compon…

Cited by 0SourceScholar
2024

A New Linear Scaling Rule for Private Adaptive Hyperparameter Optimization

ICML 2024poster

An open problem in differentially private deep learning is hyperparameter optimization (HPO). DP-SGD introduces new hyperparameters and complicates existing ones, forcing researchers to painstakingly tune hyperparameters with hundreds of trials, which in turn makes it impossible to account for the p…

Cited by 5SourcePDFScholar
2023

A Randomized Approach to Tight Privacy Accounting

NeurIPS 2023poster

Bounding privacy leakage over compositions, i.e., privacy accounting, is a key challenge in differential privacy (DP). However, the privacy parameter ($\varepsilon$ or $\delta$) is often easy to estimate but hard to bound. In this paper, we propose a new differential privacy paradigm called estimate…

Cited by 10SourcePDFScholar
2023

Effectively Using Public Data in Privacy Preserving Machine Learning

ICML 2023poster

Differentially private (DP) machine learning techniques are notorious for their degradation of model utility (e.g., they degrade classification accuracy). A recent line of work has demonstrated that leveraging *public data* can improve the trade-off between privacy and utility when training models w…

Cited by 19SourcePDFScholar
2023

MultiRobustBench: Benchmarking Robustness Against Multiple Attacks

ICML 2023poster

The bulk of existing research in defending against adversarial examples focuses on defending against a single (typically bounded $\ell_p$-norm) attack, but for a practical setting, machine learning (ML) models should be robust to a wide variety of attacks. In this paper, we present the first unified…

2023

Revisiting the Assumption of Latent Separability for Backdoor Defenses

ICLR 2023poster

Recent studies revealed that deep learning is susceptible to backdoor poisoning attacks. An adversary can embed a hidden backdoor into a model to manipulate its predictions by only modifying a few training data, without controlling the training process. Currently, a tangible signature has been widel…

2023

Uncovering Adversarial Risks of Test-Time Adaptation

ICML 2023poster

Recently, test-time adaptation (TTA) has been proposed as a promising solution for addressing distribution shifts. It allows a base model to adapt to an unforeseen distribution during inference by leveraging the information from the batch of (unlabeled) test data. However, we uncover a novel securit…

Cited by 11SourcePDFScholar
2022

Overparameterization from Computational Constraints

NeurIPS 2022accept

Overparameterized models with millions of parameters have been hugely successful. In this work, we ask: can the need for large models be, at least in part, due to the \emph{computational} limitations of the learner? Additionally, we ask, is this situation exacerbated for \emph{robust} learning? We…

Cited by 3SourcePDFScholar
2022

Renyi Differential Privacy of Propose-Test-Release and Applications to Private and Robust Machine Learning

NeurIPS 2022accept

Propose-Test-Release (PTR) is a differential privacy framework that works with local sensitivity of functions, instead of their global sensitivity. This framework is typically used for releasing robust statistics such as median or trimmed mean in a differentially private manner. While PTR is a commo…

Cited by 7SourcePDFScholar
2022

Robust Learning Meets Generative Models: Can Proxy Distributions Improve Adversarial Robustness?

ICLR 2022poster

While additional training data improves the robustness of deep neural networks against adversarial examples, it presents the challenge of curating a large number of specific real-world samples. We circumvent this challenge by using additional data from proxy distributions learned by advanced genera…

2022

SparseFed: Mitigating Model Poisoning Attacks in Federated Learning with Sparsification

AISTATS 2022poster

Federated learning is inherently vulnerable to model poisoning attacks because its decentralized nature allows attackers to participate with compromised devices. In model poisoning attacks, the attacker reduces the model’s performance on targeted sub-tasks (e.g. classifying planes as birds) by uploa…

2021

A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks

NeurIPS 2021poster

Poisoning attacks have emerged as a significant security threat to machine learning algorithms. It has been demonstrated that adversaries who make small changes to the training set, such as adding specially crafted data points, can hurt the performance of the output model. Most of these attacks requ…

Cited by 3SourcePDFScholar
2021

Model-Targeted Poisoning Attacks with Provable Convergence

ICML 2021spotlight

In a poisoning attack, an adversary who controls a small fraction of the training data attempts to select that data, so a model is induced that misbehaves in a particular way. We consider poisoning attacks against convex machine learning models and propose an efficient poisoning attack designed to i…

2019

Empirically Measuring Concentration: Fundamental Limits on Intrinsic Robustness

NeurIPS 2019spotlight

Many recent works have shown that adversarial examples that fool classifiers can be found by minimally perturbing a normal input. Recent theoretical results, starting with Gilmer et al. (2018b), show that if the inputs are drawn from a concentrated metric probability space, then adversarial examples…

2018

Adversarial Risk and Robustness: General Definitions and Implications for the Uniform Distribution

NeurIPS 2018poster

We study adversarial perturbations when the instances are uniformly distributed over {0,1}^n. We study both "inherent" bounds that apply to any problem and any classifier for such a problem as well as bounds that apply to specific problems and specific hypothesis classes.

Cited by 95SourcePDFScholar