Skip to content
Preprint

Reducing information dependency does not cause training data privacy. Adversarially non-robust features do

Jul 2026 · 0 citations · 91 references
Computer Science

TL;DR

Anti Adversarial Training (AT-AT), a training regime that intentionally learns non-robust features to obtain both superior reconstruction defense and higher accuracy than state-of-the-art defenses, is introduced.

Abstract

In this paper, we challenge the prevailing view that information dependency (including rote memorization) drives training data exposure to image reconstruction attacks. We show that extensive exposure can persist without rote memorization and is instead caused by a tunable connection to adversarial robustness. We begin by presenting three surprising results: (1) recent defenses that inhibit reconstruction by Model Inversion Attacks (MIAs), which evaluate leakage under an idealized attacker, do not reduce standard measures of information dependency (HSIC); (2) models that maximally memorize their training datasets remain robust to MIA reconstruction; and (3) models trained without seeing 97% of the training pixels, where recent information-theoretic bounds give arbitrarily strong privacy guarantees under standard assumptions, can still be devastatingly reconstructed by MIA. To explain these findings, we provide causal evidence that privacy under MIA arises from what the adversarial examples literature calls ``non-robust''features (generalizable but imperceptible and unstable features). We further show that recent MIA defenses obtain their privacy improvements by unintentionally shifting models toward such features. To establish this causal relationship, we introduce Anti Adversarial Training (AT-AT), a training regime that intentionally learns non-robust features to obtain both superior reconstruction defense and higher accuracy than state-of-the-art defenses. Our results revise the prevailing understanding of training data exposure and reveal a new privacy-robustness tradeoff.

View source

Similar papers

Preprint Jul 2026

Ball Differential Privacy: How to Mitigate Data Reconstruction with Less Noise

Ball-DP is proposed: enforcing epsilon-delta indistinguishability over single-record substitutions restricted to a ball of radius r under a distance metric d in the embedding space so that a deployment facing only local reconstruction threats can choose a small r, thereby reducing noise and recovering accuracy.

J. Margaryan, Nirupam Gupta · 0 citations
Preprint Jul 2026

Statistical Adversaries: Natural Backdoor-like Adversarial Features in Clean Vision Datasets

It is concluded that ordinary datasets can contain exploitable adversarial surfaces even in the absence of poisoning, and suggested that dataset audits should treat spurious structure not only as a source of bias or interpretability failure, but also as a latent attack surface for vision models.

Paul K. Mandal, Pavan Reddy, Tristan Malatynski · 0 citations
Preprint Jul 2026

Don't Trust the AI Ecosystem: Analyzing Privacy Leakage in Compromised Open-Source Components

GradLock is introduced, a novel training-time injection attack that stealthily injects sensitive training data directly into the model parameters and employs dynamic gradient locking to prevent payload degradation during the optimization process.

Jin-Seong Kim, Han-Ju Lee, Seok-Won Hong et al. · 0 citations
Preprint Jul 2026

AMRM-Pure: Semantic-Preserving Adversarial Purification

This work proposes AMRM-Pure, a purification framework that denoises adversarial inputs by preserving patch-level semantics, and formulate this process as a tractable optimization problem with respect to the input.

Zhihao Dou, Zhiqiang Gao, Dongfei Cui et al. · 0 citations
Open access Aug 2026

Adversarial Purification by Consistency-aware Latent Space Optimization on Data Manifolds.

This paper reveals that samples generated by a well-trained generative model are close to clean ones but far from adversarial ones, and proposes Consistency Model-based Adversarial Purification (CMAP), which optimizes vectors within the latent space of a pre-trained consistency model to generate samples for restoring clean data.

Shuhai Zhang, Jiahao Yang, Hui Luo et al. · 0 citations
Preprint Aug 2026

When Clean Data Hurts: Learning with Monotone Corruptions Beyond Binary Classification

This work exhibits a learnable multiclass problem that becomes altogether unlearnable under a monotone adversary, and shows an analogous result for partial binary concept classes, and demonstrates that monotone adversaries are frighteningly more powerful in each of these settings.

Julian Asilis, S. Dughmi, Chirag Pabbaraju · 0 citations