alphaFeedback

WorksComputer Science

Natural Jammers: When Non-Robust Features Become Antagonistic

AI contributions
Not recorded for this paper
View details

Abstract

Deep neural networks are known to rely on non-robust features that align poorly with human perception. Prior work has largely framed these features as opportunistic shortcuts that help standard models on clean data. We show instead that non-robust cues can be antagonistic: they can act as Natural Jammers that actively mislead standard models on clean, unmodified images. Using disagreement between a standard model and robust models as an analysis lens, we identify a Jammed Set on which robust models outperform standard models. We provide causal evidence for Spectral-spatial Locking: jamming arises only when high-frequency components are precisely aligned with specific spatial structures. Disrupting this lock through spectral filtering or small geometric shifts can restore correct predictions. Crucially, we uncover a Substitution Paradox: while individual jammers are fragile to geometric shifts, the aggregate prevalence of jamming remains approximately stable and is redistributed rather than eliminated under such transformations. Our results reframe natural non-robustness as a failure field over the empirical model-data geometry: one that redistributes rather than disappears under small transformations.

Project page: https://jiamingzhang.netlify.app/naturaljammers

Introduction

Deep neural networks (DNNs) achieve remarkable success on visual tasks, yet their reasoning differs fundamentally from human perception. Rather than relying solely on semantic content, DNNs are highly sensitive to non-robust features—subtle, high-frequency patterns that predict labels but remain imperceptible to humans Ilyas et al. [ [13], Gyevnar and Kasirzadeh [2025], Liu et al. [ [21]. The prevailing view treats these features as opportunistic shortcuts: brittle patterns that standard models exploit as a crutch to reach correct decisions Geirhos et al. [ [8], Kauffmann et al. [ [15], Eriksson et al. [ [4]. This framing assumes non-robust signals and semantic labels work synergistically.

We challenge this synergistic view by uncovering natural feature antagonism. As Figure 1 illustrates, non-robust signals do not always aid classification—for a substantial fraction of natural images, they actively mislead standard inference. We term these signals Natural Jammers. This creates an empirical paradox: although the robustness–accuracy trade-off suggests standard models (fstdf_{\mathrm{std}}) should upper-bound clean performance Tsipras et al. [ [35], Suzuki et al. [ [32], Zhang et al. [ [40], Kafali et al. [ [14], Li and Li [ [20], we identify a distinct Jammed Set (J\mathcal{J}) where robustly trained models (frobf_{\mathrm{rob}}) significantly outperform their standard counterparts on unmodified images. The standard model’s reliance on non-robust features becomes a liability—it is misled by brittle cues that contradict the label, while the robust model often succeeds because it is less sensitive to such cues. We employ frobf_{\mathrm{rob}} as a diagnostic lens to disentangle robust semantic cues from non-robust correlations.

The duality of non-robust features: spurious shortcut and natural jammer

Figure 1. The Duality of Non-Robust Features. (Left) Spurious Shortcut (S\mathcal{S}): prediction relies on fragile non-robust cues and collapses when these cues are suppressed. (Right) Natural Jammer (J\mathcal{J}): non-robust cues interfere with semantics-aligned evidence, suppressing them partially restores correct predictions. This illustrates that non-robust cues can be antagonistic rather than merely supportive. Accuracies are measured with the primary lens (standard vs. robust ResNet-50, ℓ2\ell_2, ϵ=1\epsilon= 1).

To explain this interference, we propose the Spectral-Spatial Locking mechanism through controlled experiments. Natural jammers arise from high-frequency patterns, but their disruptive influence depends critically on alignment with specific spatial configurations. This phase-locked coupling explains a striking duality: while these features mislead standard inference, they are also fragile. Breaking the lock—through spectral filtering (the Cleansing Paradox, § 3.1) or minor geometric shifts (the Sensitivity Inversion, § 3.2)—renders the jammer inert, allowing the model’s discriminative capacity to resurface.

This fragility raises a puzzle: if individual jammers are so easily disrupted, why does the model not achieve robust generalization? Our analysis reveals the Substitution Paradox: a 2%2\% edge crop removes about one third of the images in the Jammed Set, yet its total size remains nearly unchanged. Natural non-robustness is not a defect of particular images but a persistent property of the model–data geometry. When one jammer’s spatial-spectral lock breaks, new jammers emerge elsewhere, keeping the overall vulnerability level nearly constant. Non-robustness is redistributed rather than eliminated by simple augmentations.

Our contributions are:

  • Feature Antagonism: We formalize the Jammed Set (J\mathcal{J}), showing that a significant portion of standard model errors stem from non-robust signals that contradict semantic labels.

  • Spectral-Spatial Locking: We provide causal evidence that non-robust features require precise alignment between high-frequency content and spatial structure to remain effective.

  • Substitution Paradox: We demonstrate that jamming is a stable, systemic property—individual non-robust features are fragile and interchangeable, following a redistribution pattern under geometric transformations.

Landscape of Natural Non-Robustness

To move beyond a binary view of robust vs. non-robust features, we formalize a taxonomy based on the latent structure of the data distribution D\mathcal{D}.

Assumption 2.1 (Manifold Decomposition). Following the latent manifold hypothesis Ilyas et al. [ [13], we assume the input space X\mathcal{X} maps to a latent representation Z\mathcal{Z} that can be decomposed into two subspaces, Z=Zr×Znr\mathcal{Z} = \mathcal{Z}_r \times\mathcal{Z}_{nr}, where Zr\mathcal{Z}_r and Znr\mathcal{Z}_{nr} denote the robust and non-robust manifolds, respectively.

The interaction between these manifolds determines whether a model’s reliance on non-robust signals yields an opportunistic shortcut or a predictive failure. We utilize a standard classifier fstdf_{\mathrm{std}} and an adversarially trained counterpart frobf_{\mathrm{rob}} to analyze these divergent behaviors.

Formal Taxonomy: The Quad-Set Partition

Given a sample (x,y)∈D(x, y) \in\mathcal{D} and a chosen reference pair (fstd,frob)(f_{\mathrm{std}}, f_{\mathrm{rob}}), we partition samples into four disjoint sets based on their predictions on the original clean input xx:

  • Common Set (C\mathcal{C}): {x∣fstd(x)=y∧frob(x)=y}\{x \mid f_{\mathrm{std}}(x) = y \land f_{\mathrm{rob}}(x) = y\}. Samples where features in Zr\mathcal{Z}_r and Znr\mathcal{Z}_{nr} are synergistic.

  • Spurious Set (S\mathcal{S}): {x∣fstd(x)=y∧frob(x)≠y}\{x \mid f_{\mathrm{std}}(x) = y \land f_{\mathrm{rob}}(x) \ne y\}. The classic shortcut regime where fstdf_{\mathrm{std}} succeeds via brittle patterns in Znr\mathcal{Z}_{nr}.

  • Jammed Set (J\mathcal{J}): {x∣fstd(x)≠y∧frob(x)=y}\{x \mid f_{\mathrm{std}}(x) \ne y \land f_{\mathrm{rob}}(x) = y\}. Samples where fstdf_{\mathrm{std}} is misguided by antagonistic signals in Znr\mathcal{Z}_{nr}.

  • Uninformative Set (G\mathcal{G}): {x∣fstd(x)≠y∧frob(x)≠y}\{x \mid f_{\mathrm{std}}(x) \ne y \land f_{\mathrm{rob}}(x) \ne y\}. Samples where signals in both manifolds are insufficient for classification.

While S\mathcal{S} represents the well-documented reliance on human-irrelevant shortcuts, J\mathcal{J} exposes a more pathological interaction where non-robust features actively contradict the ground-truth logic:

Definition 2.2 (Natural Jammer). A Natural Jammer is a non-robust signal znr∈Znrz_{nr} \in\mathcal{Z}_{nr} that exhibits feature antagonism, such that its predictive direction contradicts the semantic label yy.

Operationally, for a standard model fstdf_{\mathrm{std}}, an input xx is said to be jammed if there exists a semantics-preserving transformation T∈TT \in\mathcal{T} (e.g., spectral filtering or geometric cropping) such that:

fstd(x)≠yandfstd(T(x))=y.(1)f_{\mathrm{std}}(x) \ne y \qquad\text{and} \qquad f_{\mathrm{std}}(T(x)) = y. \tag*{(1)}

In this context, TT acts as a de-locking operator that suppresses the antagonistic non-robust signal, allowing the model’s latent discriminative capacity to resurface.

Empirical Prevalence and Stability

We conduct a representative audit on the ImageNet validation set Russakovsky et al. [ [27] (N=50,000N = 50{,}000) to evaluate the prevalence of these sets across different architectures. The membership of the set is defined on the original inputs and, therefore, on the unmodified images Acc⁡fstd(S)=100%\operatorname{Acc}_{f_{\mathrm{std}}}(\mathcal{S}) = 100\% and Acc⁡fstd(J)=0%\operatorname{Acc}_{f_{\mathrm{std}}}(\mathcal{J}) = 0\% by construction (and analogously for frobf_{\mathrm{rob}}). As shown in Table 1, the Jammed Set J\mathcal{J} consistently accounts for a significant portion of the error manifold.

ModelJ\mathcal{J} (Jammed)S\mathcal{S} (Spurious)C\mathcal{C} (Common)G\mathcal{G} (Uninformative)
ResNet-18 (ℓ2\ell_2)2,448 (4.90%)6,168 (12.34%)28,712 (57.42%)12,672 (25.34%)
ResNet-50 (ℓ2\ell_2)2,140 (4.28%)5,002 (10.00%)33,071 (66.14%)9,787 (19.57%)
WRN-50-2 (ℓ2\ell_2)2,167 (4.33%)4,698 (9.40%)34,543 (69.09%)8,592 (17.18%)
ResNet-18 (ℓ∞\ell_\infty)2,502 (5.00%)5,659 (11.32%)29,221 (58.44%)12,618 (25.24%)
ResNet-50 (ℓ∞\ell_\infty)2,252 (4.50%)4,306 (8.61%)33,767 (67.53%)9,675 (19.35%)
WRN-50-2 (ℓ∞\ell_\infty)2,232 (4.46%)4,145 (8.29%)35,096 (70.19%)8,527 (17.05%)

Table 1. Distribution of Feature Pathologies on ImageNet. Data is reported for ϵ=1.0\epsilon= 1.0 constraints. The proportions of J\mathcal{J} and S\mathcal{S} remain relatively stable across ResNet and WideResNet architectures, suggesting that jamming is not confined to a single architecture.

The consistency of these proportions (4.3%–5.0% for J\mathcal{J}) across architectures suggests that natural jamming is not confined to a single evaluated model. However, this statistical stability does not necessarily imply that the “Jammed” status is an intrinsic property of the image. If the effect stems from universal data pathologies, the samples in J\mathcal{J} should overlap significantly across different models. Conversely, if it is a manifestation of specific inductive biases, these sets should diverge. We investigate this question by dissecting the spectral and spatial dependencies of these features in the next section.

Spectral-Spatial Locking: The Core Evidence

The divergent behaviors of fstdf_{\mathrm{std}} and frobf_{\mathrm{rob}} on the Jammed and Spurious sets suggest that these models prioritize different structural components within the same image. In this section, we conduct a series of diagnostic experiments to isolate whether these non-robust features are defined by their frequency content, their spatial location, or a combination of both. Our results lead to the discovery of a Spectral-Spatial Locking mechanism.

Evaluation convention. All sets C\mathcal{C}, S\mathcal{S}, J\mathcal{J}, G\mathcal{G} are defined using predictions on the original clean inputs. We then apply transformations and evaluate predictions on the same fixed subset of samples, without re-computing set membership after transformation. Unless stated otherwise, all experiments in this section use the primary lens (standard vs. robust ResNet-50, ℓ2\ell_2, ϵ=1\epsilon= 1; checkpoints from Salman et al. [ [29]).

The Cleansing Paradox: Spectral Sensitivity

We begin by testing whether the interference in the Jammed Set is an intrinsic property of high-frequency (HF) patterns. We apply a low-pass filter (LPF) to progressively remove HF components and observe the accuracy of the standard model fstdf_{\mathrm{std}}.

Protocol. For each image xx, we compute its 2D Fourier transform F(x)\mathcal{F}(x), apply a circular hard-cutoff mask MrM_r with varying radius r∈[10,112]r \in[10,112] (on a 224×224224 \times224 spectrum), and reconstruct the filtered image x~r=F−1(Mr⋅F(x))\tilde{x}_r = \mathcal{F}^{-1}(M_r \cdot\mathcal{F}(x)). A smaller rr corresponds to more aggressive high-frequency removal.

Results. As shown in Figure 2a, removing HF content yields opposite outcomes for the two sets: Spurious Set (S\mathcal{S}): Accuracy collapses from 100.0% to 23.7% at r=30r = 30. This confirms that these predictions rely entirely on high-frequency shortcuts. Jammed Set (J\mathcal{J}): Accuracy recovers from 0.0% to 31.8% at r=50r = 50. Common Set (C\mathcal{C}): Accuracy degrades gracefully from 100.0% to 85.1% at r=50r = 50, demonstrating that robust semantic features are largely preserved in the low-frequency skeleton. These findings are diagnostic evidence of the spectral fragility of non-robust features: their predictive utility is tied to specific frequency supports (HF patterns).

Duality of sensitivity plots

Figure 2. The Duality of Sensitivity. (a) In the spectral domain, a Cleansing Paradox is observed: removing high-frequencies restores accuracy for the Jammed Set (J\mathcal{J}) while destroying it for the Spurious Set (S\mathcal{S}). (b) In the spatial domain, zooming induces an Sensitivity Inversion transition, showing the reversal of dominance between J\mathcal{J} and S\mathcal{S} features. All curves use the primary lens.

The Sensitivity Inversion: Spatial Localization

To determine where these jammers are located, we examine model sensitivity to spatial transformations.

Protocol. We apply a center-crop zoom TαT_{\alpha}, where the image is cropped to α×224\alpha\times224 pixels and resized back to 224×224224 \times224 with bilinear interpolation. We sweep the ratio α\alpha from 1.0 (original) to 0.5 (2× zoom).

Results. Figure 2(b) reveals a distinct Sensitivity Inversion: as we zoom in, accuracy on Jammed Set (J\mathcal{J}) increases while accuracy on Spurious Set (S\mathcal{S}) decreases. Since zooming removes peripheral regions, this pattern is consistent with the hypothesis that many interfering cues are spatially localized near image boundaries or object context, where they can conflict with central semantic evidence. The accuracy on Common Set (C\mathcal{C}) remains relatively stable, gracefully decreasing from 100% to 79.9%. Robust semantic features exhibit geometric invariance. This sensitivity highlights the spatial fragility of the underlying non-robust signals. This recovery is not specific to the resampling method: it appears with all six interpolation kernels we tested and when a 2% border is painted over instead of cropped.

Frequency Grafting: A Causality Test

The preceding experiments suggest a strong coupling between spectral content and spatial structure. To provide causal evidence, we test whether the interference in J\mathcal{J} is an intrinsic HF signal (analogous to a universal adversarial perturbation) or if its efficacy is strictly dependent on the host image’s geometry. We perform a frequency grafting experiment that transplants the HF components of a Jammed image onto the LF skeleton of a Common image.

Protocol. Let xj∈Jx_j \in\mathcal{J} be a Jammed image and xc∈Cx_c \in\mathcal{C} be a Common image. We construct a hybrid image xhybridx_{\mathrm{hybrid}} by combining their spectral components as follows:

xhybrid=F−1(Mr⊙F(xc)+(1−Mr)⊙F(xj))(2)x_{\mathrm{hybrid}} = \mathcal{F}^{-1}\left(M_r \odot\mathcal{F}(x_c) + (1-M_r) \odot\mathcal{F}(x_j)\right) \tag*{(2)}

where F\mathcal{F} denotes the 2D Discrete Fourier Transform, ⊙\odot represents element-wise multiplication, and MrM_r is a circular low-pass binary mask with radius r=50r = 50. This operation preserves the semantic skeleton of the Common image while grafting onto it the exact high-frequency textures of the Jammed image. We define transferred toxicity as the fraction of random pairs (xj,xc)(x_j, x_c) for which the hybrid inherits the source jammer’s predicted class, i.e., fstd(xhybrid)=fstd(xj)f_{\mathrm{std}}(x_{\mathrm{hybrid}}) = f_{\mathrm{std}}(x_j).

Results. As shown in Table 2, the results demonstrate a near-complete collapse of predictive influence upon transplantation. While suppressing high-frequency components yields a 31.8 percentage-point recovery on the native jammed inputs (§ 3.1), the transferred toxicity to a foreign host is only 0.17% (averaged over five random pairings), whereas reassembling a jammer from its own spectral components preserves its jammed prediction in 99.9% of cases.

Transfer scenarioNative toxicity (0% → X%)Transferred toxicity (on new host)
J→C\mathcal{J} \to\mathcal{C}31.8% (0% → 31.8%)0.17%

Table 2. Frequency Grafting: Toxicity Transfer Test. We graft the HF of Jammed images onto Common images. Native Toxicity represents the accuracy gain when HF is removed from the source host. Transferred Toxicity measures the rate at which the wrong label of the jammer infects a new semantic host.

This result confirms that Natural Jammers are not independently “toxic” patterns. Their capacity to mislead the model is not an intrinsic property of the signal but emerges from a fragile resonance with the host image’s spatial structure. Once the spectral-spatial lock is broken by moving the HF signal to other host images, the feature becomes inefficient. This causal evidence shifts the understanding of non-robustness from a feature-level defect to a systemic interaction between spectrum and space.

Formal Definition: Spectral–Spatial Locking

The empirical evidence in the preceding sections reveals that natural non-robustness is neither a purely spectral defect nor a static spatial anomaly. Instead, it manifests as a structural dependency where the predictive utility of non-robust features is conditioned on the alignment of frequency and space. We formalize this mechanism as follows:

Definition 3.1 (Spectral–Spatial Locking). Let ff be a classifier and x∈Xx \in\mathcal{X} denote an input sample. A non-robust predictive signal zz is said to be spectral–spatially locked if its contribution to the model’s inference depends jointly on its frequency support and its spatial configuration. Formally, zz is characterized by the following properties:

  1. Spectral sensitivity. There exists a low-pass operator LσL_{\sigma} that suppresses frequencies above σ\sigma such that removing these components changes the prediction, i.e., f(Lσ(x))≠f(x)f(L_{\sigma}(x)) \ne f(x) for a non-trivial fraction of inputs exhibiting the signal.

  1. Spatial Fragility. Let T\mathcal{T} be a group of semantics-preserving geometric transformations. There exists T∈TT \in\mathcal{T} such that f(τ(x))≠f(x)f(\tau(x)) \ne f(x), demonstrating that the efficacy of zz is sensitive to precise spatial alignment.

  1. Non-Transferability. Let xA,xB∈Xx_A, x_B \in\mathcal{X} be two distinct samples. Grafting the spectral components of xAx_A onto the spatial structure of xBx_B fails to reproduce the original prediction bias, as the non-robust signal becomes functionally inert when the original lock is broken.

Definition 3.1 establishes that individual jammers are fragile configurations that collapse when their spectral–spatial lock is disrupted. However, this fragility presents a paradox: if specific locks are so easily broken, why does the aggregate size of the Jammed Set remain approximately stable across models and augmentations? This indicates a redistribution of non-robustness across the data manifold. We will explore this in the next section.

Substitution Paradox: Systemic Redistribution of Natural Non-Robustness

Section 3 established that many clean-image failures of standard models are consistent with spectral–spatial locking: interfering cues are fragile under mild spectral or geometric perturbations. This fragility raises a natural question: if individual jammers are so easily disrupted, why does non-robust vulnerability persist at scale?

This section provides system-level evidence that natural non-robustness is not confined to a small set of “bad images” but is a persistent outcome of the model–data interaction. We focus on three questions: Q1: Is the prevalence of J\mathcal{J} and S\mathcal{S} stable across architectures and robustness recipes? Q2: Are jammers/spurious identities intrinsic to images, or model-dependent? Q3: Under tiny semantics-preserving transformations, do these pathologies disappear or get redistributed?

Assumption 4.1 (Robust Models as Analysis Lenses). Robust models are used as analysis lenses to induce the quad-set partition via disagreement with a standard model. We do not treat any single robust model as a ground-truth oracle; instead, we test whether conclusions persist across multiple robust oracles spanning architectures and robustness recipes.

Experimental Setup. All analyses are conducted on ImageNet validation (N=50,000N = 50{,}000). For each architecture family, we use its corresponding standard model as fstdf_{\mathrm{std}} and a collection of robust models as candidate lenses frobf_{\mathrm{rob}} that vary in threat model (ℓ2\ell_2 or ℓ∞\ell_\infty) and budget ϵ\epsilon. Within each architecture block, fstdf_{\mathrm{std}} is fixed to that architecture’s standard model, and each robust model defines a quad-set partition C,S,J,G\mathcal{C}, \mathcal{S}, \mathcal{J}, \mathcal{G} according to § 2 on the original clean inputs.

Prevalence Across Architectures

We first establish a baseline fact that will serve as a foundation for the remainder of the section: natural jamming is not rare, nor specific to a single robustness recipe. Table 3 reports the quad-set partition induced by 17 robust lenses spanning CNNs and ViTs.

ConfigurationJammed (J\mathcal{J})Spurious (S\mathcal{S})Common (C\mathcal{C})Uninformative (G\mathcal{G})Rob. Acc.
ResNet-18Standard Accuracy: 69.76%
ℓ2\ell_2, ϵ=0.5\epsilon= 0.52,639 (5.28%)4,786 (9.57%)30,094 (60.19%)12,481 (24.96%)65.5%
ℓ2\ell_2, ϵ=1.0\epsilon= 1.02,448 (4.90%)6,168 (12.34%)28,712 (57.42%)12,672 (25.34%)62.3%
ℓ2\ell_2, ϵ=3.0\epsilon= 3.01,924 (3.85%)10,240 (20.48%)24,640 (49.28%)13,196 (26.39%)53.1%
ℓ∞\ell_\infty, ϵ=1.0\epsilon= 1.02,502 (5.00%)5,659 (11.32%)29,221 (58.44%)12,618 (25.24%)63.5%
ℓ∞\ell_\infty, ϵ=4.0\epsilon= 4.01,867 (3.73%)10,497 (21.00%)24,383 (48.77%)13,253 (26.51%)52.5%
ResNet-50Standard Accuracy: 76.15%
ℓ2\ell_2, ϵ=0.5\epsilon= 0.52,317 (4.63%)3,803 (7.61%)34,270 (68.54%)9,610 (19.22%)73.2%
ℓ2\ell_2, ϵ=1.0\epsilon= 1.02,140 (4.28%)5,002 (10.00%)33,071 (66.14%)9,787 (19.57%)70.4%
ℓ2\ell_2, ϵ=3.0\epsilon= 3.01,807 (3.61%)8,463 (16.93%)29,610 (59.22%)10,120 (20.24%)62.8%
ℓ∞\ell_\infty, ϵ=1.0\epsilon= 1.02,252 (4.50%)4,306 (8.61%)33,767 (67.53%)9,675 (19.35%)72.0%
ℓ∞\ell_\infty, ϵ=4.0\epsilon= 4.01,812 (3.62%)7,948 (15.90%)30,125 (60.25%)10,115 (20.23%)63.9%
WideResNet-50-2Standard Accuracy: 78.48%
ℓ2\ell_2, ϵ=0.5\epsilon= 0.52,202 (4.40%)3,887 (7.77%)35,354 (70.71%)8,557 (17.11%)75.1%
ℓ2\ell_2, ϵ=1.0\epsilon= 1.02,167 (4.33%)4,698 (9.40%)34,543 (69.09%)8,592 (17.18%)73.4%
ℓ2\ell_2, ϵ=3.0\epsilon= 3.01,910 (3.82%)7,701 (15.40%)31,540 (63.08%)8,849 (17.70%)66.9%
ℓ∞\ell_\infty, ϵ=1.0\epsilon= 1.02,232 (4.46%)4,145 (8.29%)35,096 (70.19%)8,527 (17.05%)74.7%
ℓ∞\ell_\infty, ϵ=4.0\epsilon= 4.02,000 (4.00%)7,037 (14.07%)32,204 (64.41%)8,759 (17.52%)68.4%
ViT-B/16Standard Accuracy: 81.07%
ℓ∞\ell_\infty, ϵ=1.0\epsilon= 1.01,569 (3.14%)5,467 (10.93%)35,067 (70.13%)7,897 (15.79%)73.3%
ViT-B/32Standard Accuracy: 75.91%
ℓ∞\ell_\infty, ϵ=1.0\epsilon= 1.01,828 (3.66%)6,511 (13.02%)31,443 (62.89%)10,218 (20.44%)66.5%

Table 3. Complete Cross-Model Landscape. Analysis on ImageNet validation set (N=50,000N = 50,000). Within each architecture block, fstdf_{\mathrm{std}} is fixed to that architecture’s standard model; each row uses a different robust model frobf_{\mathrm{rob}} to define the quad-set partition on clean inputs.

Across a wide range of architectures and robustness recipes, the Jammed Set consistently occupies a few percent of ImageNet validation set, and the Spurious Set occupies a larger but still substantial portion (roughly ∼\sim7–20%, depending on ϵ\epsilon). Natural jamming is thus not an isolated artifact of a particular model or robustness configuration; across these lenses, ∣J∣|\mathcal{J}| is relatively stable compared to ∣S∣|\mathcal{S}|.

Model-Specific Vulnerabilities

We next test whether jammed is an intrinsic property of the image or depends on the model used to define the partition. For two induced Jammed sets JA\mathcal{J}_A and JB\mathcal{J}_B, we quantify agreement via Intersection-over-Union (IoU):

IoU⁡(JA,JB)=∣JA∩JB∣∣JA∪JB∣\operatorname{IoU}(\mathcal{J}_A,\mathcal{J}_B) = \frac{|\mathcal{J}_A \cap\mathcal{J}_B|}{|\mathcal{J}_A \cup\mathcal{J}_B|}

and analogously for S\mathcal{S}.

Agreement is modest within architecture and low across architectures. Figure 3 shows that even within the same architecture, changing only the robustness budget yields moderate agreement (IoU ≈\approx 0.40–0.47). Across architectures, IoU collapses (typically <0.15< 0.15), and can be even smaller between CNNs and ViTs. These results indicate that which images are jammed/spurious depends strongly on model inductive bias and robustness recipe, rather than being image-intrinsic.

Jammed Set IoU Analysis

Figure 3. Jammed Set IoU Analysis (ℓ∞\ell_\infty). Top row: intra-architecture agreement when changing only robustness budget (ϵ=1\epsilon= 1 vs ϵ=4\epsilon= 4). Bottom: cross-architecture IoU matrix. Agreement is modest within the same architecture and collapses across architectures, indicating that jammed identity is model-dependent.

While IoU captures identity, confidence helps assess risk: jammed errors are often high-confidence for standard models. Table 4 reports mean softmax confidence of fstdf_{\mathrm{std}} and the corresponding robust lens frobf_{\mathrm{rob}} on the induced sets. Across CNNs, fstdf_{\mathrm{std}} is typically more confident than frobf_{\mathrm{rob}} on J\mathcal{J}, consistent with a brittle but dominant cue overwhelming semantic evidence. ViTs show a reversal (robust confidence > standard confidence), which may reflect architecture-specific interfering cues; however, the ViT and CNN lenses also differ in training recipe, so this comparison cannot separate the two factors.

CONFIGϵ\epsilonJAMMED (J\mathcal{J}) RN-18JAMMED (J\mathcal{J}) RN-50JAMMED (J\mathcal{J}) WRN-50-2SPURIOUS (S\mathcal{S}) RN-18SPURIOUS (S\mathcal{S}) RN-50SPURIOUS (S\mathcal{S}) WRN-50-2
ℓ2\ell_20.5.457 / .440.511 / .509.545 / .556.571 / .349.624 / .412.684 / .459
ℓ2\ell_21.0.470 / .402.517 / .464.555 / .531.601 / .303.661 / .368.710 / .427
ℓ2\ell_23.0.491 / .318.544 / .384.574 / .449.678 / .217.726 / .267.770 / .323
ℓ∞\ell_\infty1.0.468 / .418.513 / .485.554 / .550.588 / .316.643 / .382.698 / .445
ℓ∞\ell_\infty4.0.490 / .319.538 / .394.577 / .464.680 / .206.717 / .270.760 / .321
ViT-B/16 (ℓ∞\ell_\infty=1.0).504 / .701.640 / .584
ViT-B/32 (ℓ∞\ell_\infty=1.0).447 / .670.591 / .541

Table 4. Confidence Comparison: Standard vs Robust Models. Each cell reports fstdf_{\mathrm{std}} / frobf_{\mathrm{rob}} mean confidence (max softmax on predicted class). ViT entries use ℓ∞\ell_\infty, ϵ\epsilon=1.0 only.

The Substitution Paradox

Section 3 demonstrated that individual jammed behaviors can be neutralized by mild spectral filtering or small geometric shifts, suggesting that jamming depends on fragile spectral–spatial alignment. We now formalize and test a stronger claim: tiny transformations can break many specific jammed identities, yet the overall prevalence of jamming remains approximately conserved.

Definition 4.2 (Transformed Partition and Substitution Statistics). Fix an architecture and its standard model fstdf_{\mathrm{std}}, together with a robust lens frobf_{\mathrm{rob}} that induces the original sets C,S,J,G\mathcal{C}, \mathcal{S}, \mathcal{J}, \mathcal{G} on clean inputs. For a transformation TT, define the transformed Jammed set by evaluating both models on T(x)T(x):

JT:={x:fstd(T(x))≠y∧frob(T(x))=y},\mathcal{J}_T := \{x : f_{\mathrm{std}}(T(x)) \ne y \land f_{\mathrm{rob}}(T(x)) = y\},
Crop∣JT∣|\mathcal{J}_T|∣ST∣|\mathcal{S}_T|J\mathcal{J}S\mathcal{S}
0% (original)2,1405,0021.001.00
2%2,2895,1930.460.58
4%2,2685,2080.420.54
6%2,2765,1270.380.51
8%2,2915,1590.350.49

Table 5. Structural Fragility + Substitution Paradox. Minimal edge crops substantially change the identity of jammed/spurious samples (IoU drops sharply), yet the prevalence (set size) remains approximately stable.

and analogously STS_T, CTC_T, GTG_T. We quantify (i) identity stability via IoU⁡(J,JT)\operatorname{IoU}(\mathcal{J},\mathcal{J}_T), and (ii) prevalence stability via the transformed set sizes ∣JT∣|\mathcal{J}_T| and ∣ST∣|\mathcal{S}_T|.

Proposition 4.3 (Substitution Paradox (Empirical)). For small semantics-preserving geometric transformations TT (e.g., ≤8%\le8\% edge crop with resize), we observe simultaneously:

  1. Identity instability: IoU⁡(J,JT)\operatorname{IoU}(\mathcal{J},\mathcal{J}_T) (and IoU⁡(S,ST)\operatorname{IoU}(\mathcal{S},\mathcal{S}_T)) is low.

  1. Prevalence stability: the set sizes ∣JT∣|\mathcal{J}_T| and ∣ST∣|\mathcal{S}_T| remain approximately unchanged relative to ∣J∣|\mathcal{J}| and ∣S∣|\mathcal{S}|.

Thus, small geometric changes tend to redistribute jammed/spurious identities across samples rather than eliminate non-robust vulnerability.

We apply minimal center crops removing only 2%, 4%, 6%, or 8% of edge pixels and resize back to 224×224224 \times224. For each crop ratio, we compute the transformed partition (Definition 4.2) and report both set sizes and IoU against the original partition.

Identity instability (structural fragility): Even a 2% crop yields IoU⁡(J,JT)=0.46\operatorname{IoU}(\mathcal{J},\mathcal{J}_T) = 0.46, implying that about one third of the original jammed images leave J\mathcal{J}, and a similar number of new ones enter, under an almost imperceptible geometric perturbation. This supports the view that the underlying cues depend on fragile spatial alignment, consistent with spectral–spatial locking.

Prevalence stability (substitution): Despite the large change in identity, the transformed set sizes remain stable: ∣JT∣≈2.2k|\mathcal{J}_T| \approx2.2\mathrm{k} and ∣ST∣≈5.1k|\mathcal{S}_T| \approx5.1\mathrm{k} across crop ratios. This stability is approximate rather than exact: in a re-run that tracks individual images, a 2% crop moves 738 of the 2,140 jammers out of J\mathcal{J} and 873 new images in. Thus, breaking many specific locks does not reduce overall vulnerability; instead, new jammed/spurious identities emerge elsewhere. This resolves the tension raised by § 3: individual jammers are fragile, yet aggregate non-robustness persists as a systemic property and is redistributed under small transformations. Similar turnover appears under mild low-pass filtering and on six further datasets; our claim is limited to these tested mild transformations. In this view, natural non-robustness is a systemic “tax” that the model must pay to achieve high training accuracy.

We formalized and verified the Substitution Paradox: tiny semantics-preserving geometric changes drastically alter jammed/spurious identities while leaving their prevalence approximately unchanged.

Related Work

Adversarial Robustness and Non-robust Features

The vulnerability of deep neural networks to adversarial examples Szegedy et al. [ [33], Goodfellow et al. [ [9], Madry et al. [ [23] has been increasingly understood through the lens of data-driven features. Ilyas et al. [ [13] famously posited that adversarial examples arise from non-robust features—patterns that are highly predictive yet imperceptible to humans—and that these features are actively useful for standard classification. This framework has led to a prevailing view of non-robust features as “spurious shortcuts” Geirhos et al. [ [8], Shah et al. [ [30] that models exploit to achieve high standard accuracy, often resulting in an inherent trade-off between robustness and clean performance [35, 39, 25].

This view has since been actively debated. Kim et al. [ [16] show via information bottleneck that non-robust features are decomposable, with only a subset driving adversarial predictions. Li et al. [2023] argue that non-robust features are paradigm-specific shortcuts useful only under supervised objectives, not across learning paradigms. Crucially, however, both works study features under intentional adversarial perturbation—inputs explicitly crafted to expose model vulnerabilities.

We ask a fundamentally different question: can non-robust features mislead standard models on clean, unmodified natural images, without any perturbation? We identify a Jammed Set (J\mathcal{J}) where robust models outperform standard models on standard test images, and provide causal evidence for Spectral–Spatial Locking as the driving mechanism. The antagonism we document is not injected by an attacker but arises spontaneously from the interaction between standard training and the spectral-spatial structure of natural data. Our Substitution Paradox further reveals this to be a redistributing property of the model–data geometry: a model pair defines a failure field j(x)=1[fstd(x)≠y∧frob(x)=y]j(x)=\mathbf{1}[f_{\mathrm{std}}(x)\ne y\land f_{\mathrm{rob}}(x)=y] over natural images, which are commonly assumed to lie near a low-dimensional data manifold [6, 31], and small transformations move the support of jj while approximately preserving its mass. This provides a complementary framework to studies of natural adversarial or hard examples [11, 26, 22, 42] (], Li et al. 2024), which rely on curated atypical subsets rather than identifying a structural mechanism within standard uncurated data.

Spectral and Geometric Bias in Generalization

The inductive biases of CNNs are often characterized by their sensitivity to specific input frequencies and spatial structures. From a Fourier perspective, models frequently exhibit a spectral bias, relying on high-frequency components that are critical for generalization but lack robustness [38, 36, 5, 17, 37]. Simultaneously, the lack of geometric invariance—often caused by aliasing in downsampling layers Zhang [2019]—renders models fragile to even minor image transformations [2, 24]. This fragility is often linked to a "texture bias," where models prioritize local patterns over global shapes [7, 12].

Our work synthesizes these views through the mechanism of Spectral–spatial Locking, providing causal evidence that natural jamming is contingent on the precise alignment of frequency and space. Furthermore, we address the stability of these vulnerabilities, i.e., the Substitution Paradox where the aggregate rate of jamming remains stable across the data manifold. This observation relates to the broader problem of underspecification [3], where models with identical training objectives exhibit divergent and unpredictable failure modes under distribution shifts [34, 1, 28].

Conclusion

We show that non-robust features on clean natural images can be antagonistic: on a Jammed Set, robust models outperform standard models without modifying inputs. Using a standard-vs-robust partition of ImageNet-Val, we characterize Jammed and Spurious regimes and provide evidence for spectral–spatial locking via frequency filtering, geometric perturbations, and frequency grafting.

At the system level, jammed identities are highly model-dependent while prevalence remains stable, yielding the Substitution Paradox: small semantics-preserving transformations reshuffle jammed membership without reducing its overall rate.

Acknowledgments and Disclosure of Funding

This research / project is supported by ASTAR under its Japan-Singapore Joint Call: JST-ASTAR 2024 (Project ID: R2416IR139). This research is also supported by the Ministry of Education, Singapore, under its Academic Research Fund Tier 2 (Award MOE-T2EP20125-0005). The authors declare no competing interests.

References

  1. [1]M. Arjovsky, L. Bottou, I. Gulrajani, and D. Lopez-Paz. Invariant risk minimization. arXiv preprint arXiv:1907.02893, 2019.arxiv.org/abs/1907.02893
  2. [2]A. Azulay and Y. Weiss. Why do deep convolutional networks generalize so poorly to small image transformations? Journal of Machine Learning Research, 20(184):1–25, 2019.arxiv.org/abs/1805.12177
  3. [3]A. D’Amour, K. Heller, D. Moldovan, B. Adlam, B. Alipanahi, A. Beutel, C. Chen, J. Deaton, J. Eisenstein, M. D. Hoffman, et al. Underspecification presents challenges for credibility in modern machine learning. Journal of Machine Learning Research, 23(226):1–61, 2022.
  4. [4]M. Eriksson, E. Purificato, A. Noroozian, J. Vinagre, G. Chaslot, E. Gomez, and D. Fernandez-Llora. Can we trust ai benchmarks? an interdisciplinary review of current issues in ai evaluation. arXiv preprint arXiv:2502.06559, 2025.
  5. [5]R. Fang and Y. Xu. Addressing spectral bias of deep neural networks by multi-grade deep learning. Advances in Neural Information Processing Systems, 37:114122–114146, 2024.arxiv.org/abs/2410.16105
  6. [6]C. Fefferman, S. Mitter, and H. Narayanan. Testing the manifold hypothesis. Journal of the American Mathematical Society, 29(4):983–1049, 2016. doi: 10.1090/jams/852.DOI
  7. [7]R. Geirhos, P. Rubisch, C. Michaelis, M. Bethge, F. A. Wichmann, and W. Brendel. Imagenet-trained cnns are biased towards texture; increasing shape bias improves accuracy and robustness. In International conference on learning representations, 2018.arxiv.org/abs/1811.12231
  8. [8]R. Geirhos, J.-H. Jacobsen, C. Michaelis, R. Zemel, W. Brendel, M. Bethge, and F. A. Wichmann. Shortcut learning in deep neural networks. Nature Machine Intelligence, 2(11):665–673, 2020.DOI
  9. [9]I. J. Goodfellow, J. Shlens, and C. Szegedy. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572, 2014.DOI
  10. [11]D. Hendrycks, K. Zhao, S. Basart, J. Steinhardt, and D. Song. Natural adversarial examples. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 15262–15271, 2021.
  11. [12]K. Hermann, T. Chen, and S. Kornblith. The origins and prevalence of texture bias in convolutional neural networks. Advances in neural information processing systems, 33:19000–19015, 2020.
  12. [13]A. Ilyas, S. Santurkar, D. Tsipras, L. Engstrom, B. Tran, and A. Madry. Adversarial examples are not bugs, they are features. Advances in neural information processing systems, 32, 2019.arxiv.org/abs/1905.02175
  13. [14]E. Kafali, T. Semertzidis, and P. Daras. Dynamic trade-offs in adversarial training: Exploring efficiency, robustness, forgetting, and interpretability. Neural Processing Letters, 57(3):47, 2025.DOI
  14. [15]J. Kauffmann, J. Dippel, L. Ruff, W. Samek, K.-R. Müller, and G. Montavon. Explainable ai reveals clever hans effects in unsupervised learning models. Nature Machine Intelligence, pages 1–11, 2025.DOI
  15. [16]J. Kim, B.-K. Lee, and Y. M. Ro. Distilling robust and non-robust features in adversarial examples by information bottleneck. Advances in Neural Information Processing Systems, 34:17148–17159, 2021.arxiv.org/abs/2204.02735
  16. [17]A. Krizhevsky, I. Sutskever, and G. E. Hinton. Imagenet classification with deep convolutional neural networks. Advances in neural information processing systems, 25, 2012.
  17. [20]J. Li and G. Li. Triangular trade-off between robustness, accuracy, and fairness in deep neural networks: A survey. ACM Computing Surveys, 57(6):1–40, 2025.DOI
  18. [21]C. Liu, Y. Dong, W. Xiang, X. Yang, H. Su, J. Zhu, Y. Chen, Y. He, H. Xue, and S. Zheng. A comprehensive study on robustness of image classification models: Benchmarking and rethinking. International Journal of Computer Vision, 133(2):567–589, 2025a.arxiv.org/abs/2302.14301
  19. [22]L. Liu, Y. Liang, X. Yan, L. Huangfu, S. Samtani, Z. Yu, Y. Zhang, and D. D. Zeng. Hard sample mining: A new paradigm of efficient and robust model training. IEEE Transactions on Neural Networks and Learning Systems, 2025b.DOI
  20. [23]A. Madry, A. Makelov, L. Schmidt, D. Tsipras, and A. Vladu. Towards deep learning models resistant to adversarial attacks. arXiv preprint arXiv:1706.06083, 2017.arxiv.org/abs/1706.06083
  21. [24]H. Michaeli and D. Soudry. Alias-free vit: Fractional shift invariance via linear attention. arXiv preprint arXiv:2510.22673, 2025.arxiv.org/abs/2510.22673
  22. [25]S.-A. Rebuffi, S. Gowal, D. A. Calian, F. Stimberg, O. Wiles, and T. Mann. Fixing data augmentation to improve adversarial robustness. arXiv preprint arXiv:2103.01946, 2021.arxiv.org/abs/2103.01946
  23. [26]B. Recht, R. Roelofs, L. Schmidt, and V. Shankar. Do imagenet classifiers generalize to imagenet? In International conference on machine learning, pages 5389–5400. PMLR, 2019.
  24. [27]O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein, et al. Imagenet large scale visual recognition challenge. International journal of computer vision, 115(3):211–252, 2015.
  25. [28]S. Sagawa, P. W. Koh, T. B. Hashimoto, and P. Liang. Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization. arXiv preprint arXiv:1911.08731, 2019.arxiv.org/abs/1911.08731
  26. [29]H. Salman, A. Ilyas, L. Engstrom, A. Kapoor, and A. Madry. Do adversarially robust imagenet models transfer better? Advances in Neural Information Processing Systems, 33:3533–3545, 2020.arxiv.org/abs/2007.08489
  27. [30]H. Shah, K. Tamuly, A. Raghunathan, P. Jain, and P. Netrapalli. The pitfalls of simplicity bias in neural networks. Advances in Neural Information Processing Systems, 33:9573–9585, 2020.arxiv.org/abs/2006.07710
  28. [31]D. Stutz, M. Hein, and B. Schiele. Disentangling adversarial robustness and generalization. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2019.arxiv.org/abs/1812.00740
  29. [32]S. Suzuki, S. Yamaguchi, S. Takeda, S. Kanai, N. Makishima, A. Ando, and R. Masumura. Adversarial finetuning with latent representation constraint to mitigate accuracy-robustness tradeoff. In 2023 IEEE/CVF International Conference on Computer Vision (ICCV), pages 4367–4378. IEEE, 2023.arxiv.org/abs/2308.16454
  30. [33]C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus. Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199, 2013.arxiv.org/abs/1312.6199
  31. [34]R. Taori, A. Dave, V. Shankar, N. Carlini, B. Recht, and L. Schmidt. Measuring robustness to natural distribution shifts in image classification. Advances in Neural Information Processing Systems, 33:18583–18599, 2020.
  32. [35]D. Tsipras, S. Santurkar, L. Engstrom, A. Turner, and A. Madry. Robustness may be at odds with accuracy. arXiv preprint arXiv:1805.12152, 2018.arxiv.org/abs/1805.12152
  33. [36]H. Wang, X. Wu, Z. Huang, and E. P. Xing. High-frequency component helps explain the generalization of convolutional neural networks. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pages 8684–8694, 2020.arxiv.org/abs/1905.13545
  34. [37]J. Xia, Z. Yue, Y. Zhou, Z. Ling, Y. Shi, X. Wei, and M. Chen. Waveattack: Asymmetric frequency obfuscation-based backdoor attacks against deep neural networks. Advances in Neural Information Processing Systems, 37:43549–43570, 2024.arxiv.org/abs/2310.11595
  35. [38]D. Yin, R. Gontijo Lopes, J. Shlens, E. D. Cubuk, and J. Gilmer. A fourier perspective on model robustness in computer vision. Advances in Neural Information Processing Systems, 32, 2019.arxiv.org/abs/1906.08988
  36. [39]H. Zhang, Y. Yu, J. Jiao, E. Xing, L. El Ghaoui, and M. Jordan. Theoretically principled trade-off between robustness and accuracy. In International conference on machine learning, pages 7472–7482. PMLR, 2019.arxiv.org/abs/1901.08573
  37. [40]J. Zhang, F. Liu, D. Zhou, J. Zhang, and T. Liu. Improving accuracy-robustness trade-off via pixel reweighted adversarial training. arXiv preprint arXiv:2406.00685, 2024.arxiv.org/abs/2406.00685
  38. [42]W. Zhang, P. L. K. Ding, and H. Liu. Beyond imagenet: Understanding cross-dataset robustness of lightweight vision models. arXiv preprint arXiv:2511.00335, 2025.DOI

Paper details

vlnc:W_63v4r7sy
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

Not recorded for this paper · View statement →

Looking for related papers…
Contents