Scalable Data Attribution via Forward-Only Test-Time Inference
Not on the map. Why?
Abstract (arXiv)
Data attribution seeks to trace model behavior back to the training examples that shaped it, enabling debugging, auditing, and data valuation at scale. Classical influence-function methods offer a principled foundation but remain impractical for modern networks because they require expensive backpropagation or Hessian inversion at inference. We propose a data attribution method that preserves the same first-order counterfactual target while eliminating per-query backward passes. Our approach simulates each training example's parameter influence through short-horizon gradient propagation during training and later reads out attributions for any query using only forward evaluations. This design shifts computation from inference to simulation, reflecting real deployment regimes where a model may serve billions of user queries but originate from a fixed, finite set of data sources (for example, a large language model trained on diverse corpora while compensating a specific publisher such as the New York Times). Empirically, on standard MLP benchmarks, our estimator matches or surpasses state-of-the-art baselines such as TRAK on standard attribution metrics (LOO and LDS) while offering orders-of-magnitude lower inference cost. By combining influence-function fidelity with first-order scalability, our method provides a theoretical framework for practical, real-time data attribution in large pretrained models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 29 references that are in the map. First posted on arXiv 25 Nov 2025.
Builds on
22 of 29 references.
References · 22
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 413
- 2019Confident Learning: Estimating Uncertainty in Dataset Labelscited by 411
- 2023TRAK: Attributing Model Behavior at Scalecited by 273
- 2020Influence Functions in Deep Learning Are Fragilecited by 247
- 2016Clipper: A Low-Latency Online Prediction Serving Systemcited by 191
- 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
10 more
- 2019Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithmscited by 147
- 2021Scaling Up Influence Functionscited by 130
- 2021Input Similarity from the Neural Network Perspectivecited by 78
- 2022Neural Tangent Kernel Beyond the Infinite-Width Limit: Effects of Depth and Initializationcited by 30
- 2022A Fast, Well-Founded Approximation to the Empirical Neural Tangent Kernelcited by 30
- 2020LQF: Linear Quadratic Fine-Tuningcited by 25
- 2022Towards Tracing Factual Knowledge in Language Models Back to the Training Datacited by 21
- 2024An Economic Solution to Copyright Challenges of Generative AIcited by 18
- 2024textttdattri: A Library for Efficient Data Attributioncited by 18
- 2022Generalization Through The Lens Of Leave-One-Out Errorcited by 10
Built on by
Not cited yet.