Anchored or Drifting: What Recursive Self-Generation Reveals About Training Data
cs.LG, cs.AI
Submitted: 2026-06-30
Updated: 2026-10-05
Code: https://github.com/kingoflolz/mesh-transformer-jax
License: http://creativecommons.org/licenses/by/4.0/
The gist: Large generative models are known to memorize their training data, posing severe privacy risks.
Terminology
Abstract
Large generative models are known to memorize their training data, posing severe privacy risks. Yet, current methods to detect training membership typically rely on the weak signals of a single forward pass. In this work, we find that training samples and unseen (held-out) data follow visibly different trajectories under recursive self-generation -- repeatedly feeding a model's output back as its next input. Held-out samples drift: they lose the specifics of the original within a few steps. Training samples stay anchored, degrading far more slowly. We show that the membership signal this produces holds across model modalities, architectures and scales, spanning language, diffusion, and autoregressive vision models. Furthermore, these recursive trajectories provide a signal that raises membership inference TPR at 1% FPR for nearly every attack we evaluate, roughly doubling it on the weakest baselines and still improving the strongest, which shows that a model's behavior under recursion carries membership evidence that a single query does not.
Sources
- Scaling Diffusion Transformers to 16 Billion Parameters
- Mamba: Linear-Time Sequence Modeling with Selective State Spaces
- An Efficient Membership Inference Attack for the Diffusion Model by Proximal Initialization
- LLM Dataset Inference: Did you train on my dataset?
- Evaluation data contamination in LLMs: how do we measure it and (when) does it matter?
- (Token-Level) InfoRMIA: Stronger Membership Inference and Memorization Assessment for LLMs
- Adaptive Pre-training Data Detection for Large Language Models via Surprising Tokens
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks