aspireai.
PUBLIC EDITION

Web-sourced photo-editing tools beat the academic baselines they were tested against, and evaded AI-image detectors with attack success rates from 25% to 100%

AspireAI community · arXiv (TrustAIRLab / Huazhong University of Science and Technology)
Most AI-image detectors are tested against perturbations written by researchers who know the detector internals. WildFakeToolBench asks what happens when the attacker simply copies techniques from the open web: it collects 156 executable image-processing tools from 220 public sources across 142 domains, keeping the source evidence for each one and checking syntax, execution and output distortion without any feedback from the detectors under test. On 105 generated images from five generators, the strongest individual tools reached attack success rates of 25.25% to 100% across six state-of-the-art detectors, beating the strongest of six selected academic baselines for each detector, and subsets of an eight-tool pool achieved worst-case coverage above 80% for every detector. The paper stresses that effectiveness is sparse and detector-specific, so high candidate coverage does not imply reliable one-shot evasion, and that successful code translation does not imply the detector is actually evaded.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.