arXiv:2606. 30528v1 Announce Type: cross Abstract: Current generative models, including GANs and diffusion models, have reached an outstanding level of photorealism, posing significant risks to privacy and security.
arXiv:2607. 16283v1 Announce Type: cross Abstract: The rapid advancement of generative AI has outpaced our ability to reliably detect its outputs, particularly when detectors encounter generators they have not seen before.
Pixel diffusion models generate RGB images directly but tend to miss fine‑scale natural‑image statistics. The authors introduce an adversarial post‑training step that adds an adversarial loss to the model’s output at non‑high‑noise timesteps, without changing the architecture or sampling procedure. This approach improves distribution fidelity, coverage, prompt alignment, and perceptual quality across two pixel backbones, and restores missing high‑frequency spectral power while avoiding memorization or mode dropping.
arXiv:2608. 00716v1 Announce Type: cross Abstract: Robust detection of generated images is critical to counter the misuse of generative models.
The paper introduces Relative Patch Response Learning (PRL) to detect AI‑generated images by comparing patch responses across two mixed views of aligned real‑generated image pairs. PRL uses a relative response objective, a reference coherence objective, and an area ranking objective to address contextual shifts caused by self‑attention, providing precise supervision for patch‑level detection. Experiments show PRL outperforms prior methods by 4.3% and 5.9% in average balanced accuracy on standard and in‑the‑wild benchmarks.
arXiv:2608. 10096v1 Announce Type: cross Abstract: Modern data science increasingly gives rise to hypothesis-testing problems that are not naturally formulated in terms of parameters within prespecified statistical models.
EmbeddGAN introduces a new GAN framework that replaces the traditional discriminator with an embedding network trained to maximize statistical dependence between embeddings and real/fake labels using Gini distance correlation (gCor). The generator simultaneously minimizes this dependence, encouraging real and generated samples to become indistinguishable in the learned low‑dimensional embedding space. Experiments on MNIST, CIFAR‑10, and CelebA show competitive performance and notably more stable training dynamics compared to established baselines.
The paper introduces UnInfo, a test‑time adaptation method for vision‑language models like CLIP that addresses image corruption—a realistic distribution shift caused by sensor conditions. UnInfo leverages uniformity‑aware confidence maximization, information‑aware loss balancing, and knowledge distillation from an EMA teacher to preserve embedding uniformity and improve zero‑shot classification accuracy. Experiments show that UnInfo outperforms existing TTA methods on corrupted image datasets.
The paper introduces a multi‑view, confusion‑guided ensemble framework for synthetic image attribution, combining FFT‑ConvNeXt, DINOv2, CLIP, and Xception to capture frequency, semantic, and forensic cues. Extensive data augmentation simulates realistic post‑processing, while a binary expert classifier and class‑adaptive confidence calibration address ambiguities between similar diffusion models. The approach achieved 99.53% on the public leaderboard and 99.20% on the private leaderboard for the ICANN 2026 DLMMDD Workshop challenge.
arXiv:2607. 02637v1 Announce Type: cross Abstract: Recent generative models can produce high-quality synthetic images, offering scalable training training data for data-hungry models.
arXiv:2308. 04553v4 Announce Type: replace-cross Abstract: Visual recognition models are prone to learning spurious correlations induced by a biased training set where certain conditions $B$ (\eg, Indoors) are over-represented in certain classes $Y$ (\eg, Big Dogs).
arXiv:2609.38010v1 Announce Type: cross Abstract: Modern computer vision models achieve high accuracy when trained on large-scale annotated datasets. In critical domains such as construction safety m...