arXiv:2608. 00716v1 Announce Type: cross Abstract: Robust detection of generated images is critical to counter the misuse of generative models.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
Learning-State-Aware Dynamic Generative Data Augmentation on Small-Scale Datasets proposes LSADA, a method that constructs a learning state for each sample based on its loss and loss‑decrease rate to determine a sample‑specific augmentation strength. LSADA also introduces a decoupled data augmentation and diffusion fusion strategy that applies strength‑controlled transformations to class‑relevant regions while generating diverse class‑irrelevant regions, progressively fusing them to enhance image diversity while preserving class semantics. Experiments on nine public datasets demonstrate that LSADA outperforms the current state‑of‑the‑art dynamic GDA method by an average of 4.5% on six natural image datasets and 2.5% on three medical image datasets.
arXiv:2410.21582v4 Announce Type: replace-cross Abstract: Large-scale pretrained models are widely leveraged as foundations for learning new specialized tasks via fine-tuning, with the goal of mainta...
arXiv:2512.17730v2 Announce Type: replace Abstract: Detectors of AI-generated images tend to inherit the biases of the data they are trained on: models fitted to GAN imagery learn to treat GAN-specif...
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. 09024v1 Announce Type: cross Abstract: Driven by next-token prediction, NLP shifted from task-specific models into powerful generalist foundation models.
Reference-Guided Machine Unlearning (ReGUn) is a vision unlearning framework that prioritizes distributional indistinguishability over degradation-based heuristics. It uses disjoint held-out data to create a class-conditioned reference distribution for distillation, guiding forget samples toward non-member behavior without explicitly degrading predictions. Experiments across various architectures and datasets show that ReGUn achieves a competitive forgetting–utility trade-off and closely matches retrain-like membership inference behavior.