Saved in:
Bibliographic Details
Main Authors: Shaar, Eitan, Shaulov, Ariel, Tur, Yalcin, Chechik, Gal, Shwartz-Ziv, Ravid
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.06311
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917318519422976
author Shaar, Eitan
Shaulov, Ariel
Tur, Yalcin
Chechik, Gal
Shwartz-Ziv, Ravid
author_facet Shaar, Eitan
Shaulov, Ariel
Tur, Yalcin
Chechik, Gal
Shwartz-Ziv, Ravid
contents Adversarial attacks are a central tool for probing the robustness of modern vision models, yet most methods optimize perturbations directly in pixel space under $\ell_\infty$ or $\ell_2$ constraints. While effective in white-box settings, pixel-space optimization often produces high-frequency, texture-like noise that is brittle to common preprocessing (e.g., resizing and cropping) and transfers poorly across architectures. We propose $\textbf{LTA}$ ($\textbf{L}$atent $\textbf{T}$ransfer $\textbf{A}$ttack), a transfer-based attack that instead optimizes perturbations in the latent space of a pretrained Stable Diffusion VAE. Given a clean image, we encode it into a latent code and optimize the latent representation to maximize a surrogate classifier loss, while softly enforcing a pixel-space $\ell_\infty$ budget after decoding. To improve robustness to resolution mismatch and standard input pipelines, we incorporate Expectation Over Transformations (EOT) via randomized resizing, interpolation, and cropping, and apply periodic latent Gaussian smoothing to suppress emerging artifacts and stabilize optimization. Across a suite of CNN and vision-transformer targets, LTA achieves strong transfer attack success while producing spatially coherent, predominantly low-frequency perturbations that differ qualitatively from pixel-space baselines and occupy a distinct point in the transfer-quality trade-off. Our results highlight pretrained generative latent spaces as an effective and structured domain for adversarial optimization, bridging robustness evaluation with modern generative priors.
format Preprint
id arxiv_https___arxiv_org_abs_2603_06311
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Latent Transfer Attack: Adversarial Examples via Generative Latent Spaces
Shaar, Eitan
Shaulov, Ariel
Tur, Yalcin
Chechik, Gal
Shwartz-Ziv, Ravid
Computer Vision and Pattern Recognition
Adversarial attacks are a central tool for probing the robustness of modern vision models, yet most methods optimize perturbations directly in pixel space under $\ell_\infty$ or $\ell_2$ constraints. While effective in white-box settings, pixel-space optimization often produces high-frequency, texture-like noise that is brittle to common preprocessing (e.g., resizing and cropping) and transfers poorly across architectures. We propose $\textbf{LTA}$ ($\textbf{L}$atent $\textbf{T}$ransfer $\textbf{A}$ttack), a transfer-based attack that instead optimizes perturbations in the latent space of a pretrained Stable Diffusion VAE. Given a clean image, we encode it into a latent code and optimize the latent representation to maximize a surrogate classifier loss, while softly enforcing a pixel-space $\ell_\infty$ budget after decoding. To improve robustness to resolution mismatch and standard input pipelines, we incorporate Expectation Over Transformations (EOT) via randomized resizing, interpolation, and cropping, and apply periodic latent Gaussian smoothing to suppress emerging artifacts and stabilize optimization. Across a suite of CNN and vision-transformer targets, LTA achieves strong transfer attack success while producing spatially coherent, predominantly low-frequency perturbations that differ qualitatively from pixel-space baselines and occupy a distinct point in the transfer-quality trade-off. Our results highlight pretrained generative latent spaces as an effective and structured domain for adversarial optimization, bridging robustness evaluation with modern generative priors.
title Latent Transfer Attack: Adversarial Examples via Generative Latent Spaces
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2603.06311