STRIDE: Training Data Attribution via Sparse Recovery from Subset Perturbations
Not on the map. Why?
Abstract (arXiv)
Training Data Attribution (TDA) seeks to trace a model's predictions back to its training data. The gold standard for TDA relies on causal interventions, observing how a model changes when data is added or removed, but repeated retraining is computationally challenging for Large Language Models (LLMs). Consequently, most approaches approximate this effect in the parameter space using gradients. However, tracking gradients across billions of parameters is not only prohibitively expensive but relies on local approximations. In this work, we propose a shift: rather than estimating parameter changes, we model the functional effect of training data in the activation space. We introduce STRIDE (Steering-based Training Data Influence Decomposition), a framework that formulates TDA as a sparse recovery problem in the spirit of compressive sensing. STRIDE learns lightweight "steering operators" that mimic the behavioral shift caused by training on data subsets. By measuring how these operators perturb test predictions, we recover individual training example influences via sparse linear decomposition. STRIDE achieves state-of-the-art for LLM pre-training attribution while being an order of magnitude (13×) faster than previous art. We further validate its practical utility through downstream applications including data selection, data contamination, and qualitative analysis.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 50 of its 80 references that are in the map. First posted on arXiv 3 Jun 2026.
Builds on
50 of 80 references.
References · 50
- 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,177
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2020Extracting Training Data from Large Language Modelscited by 2,189
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2023Representation Engineering: A Top-Down Approach to AI Transparencycited by 1,336
- 2023Inference-Time Intervention: Eliciting Truthful Answers from a Language Modelcited by 1,302
38 more
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2022In-context Learning and Induction Headscited by 964
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 739
- 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 723
- 2021GPT Understands, Toocited by 716
- 2023The Geometry of Truth: Emergent Linear Structure in Large Language Model Representations of True/False Datasetscited by 712
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 629
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 580
- 2021Editing Factual Knowledge in Language Modelscited by 553
- 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 532
- 2021Fast Model Editing at Scalecited by 498
- 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 460
- 2020Null It Out: Guarding Protected Attributes by Iterative Nullspace Projectioncited by 455
- 2021Causal Abstractions of Neural Networkscited by 422
- 2023How Far Can Camels Go? Exploring the State of Instruction Tuning on Open Resourcescited by 408
- 2023Data Selection for Language Models via Importance Resamplingcited by 329
- 2023LEACE: Perfect linear concept erasure in closed formcited by 267
- 2020Understanding the Role of Individual Units in a Deep Neural Networkcited by 255
- 2020Influence Functions in Deep Learning Are Fragilecited by 252
- 2022Extracting Latent Steering Vectors from Pretrained Language Modelscited by 225
- 2023Finding Alignments Between Interpretable Causal Variables and Distributed Neural Representationscited by 209
- 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
- 2021Scaling Up Influence Functionscited by 132
- 2023DataInf: Efficiently Estimating Data Influence in LoRA-tuned LLMs and Diffusion Modelscited by 123
- 2024MATES: Model-Aware Data Selection for Efficient Pretraining with Data Influence Modelscited by 100
- 2020Subpopulation Data Poisoning Attackscited by 70
- 2020Influence Function based Data Poisoning Attacks to Top-N Recommender Systemscited by 63
- 2023Simfluence: Modeling the Influence of Individual Training Examples by Simulating Training Runscited by 53
- 2024Scalable Influence and Fact Tracing for Large Language Model Pretrainingcited by 42
- 2024Capturing the Temporal Dependence of Training Data Influencecited by 35
- 2022First is Better Than Last for Language Data Influencecited by 34
- 2023Theoretical and Practical Perspectives on what Influence Functions Docited by 29
- 2020Explaining and Improving Model Behavior with k Nearest Neighbor Representationscited by 27
- 2025GraSS: Scalable Data Attribution with Gradient Sparsification and Sparse Projectioncited by 8
- 2021Influence-guided Data Augmentation for Neural Tensor Completioncited by 7
- 2023DEFT: Data Efficient Fine-Tuning for Pre-Trained Language Models via Unsupervised Core-Set Selectioncited by 6
- 2026LoRIF: Low-Rank Influence Functions for Scalable Training Data Attributioncited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.