mlsanityData to 14 Oct 2026

Theoretical and Practical Perspectives on what Influence Functions Do

arXiv 2305.16971 ↗First posted 26 May 2023cs.LGcited by 29

Not on the map. Why?

Abstract (arXiv)

Influence functions (IF) have been seen as a technique for explaining model predictions through the lens of the training data. Their utility is assumed to be in identifying training examples "responsible" for a prediction so that, for example, correcting a prediction is possible by intervening on those examples (removing or editing them) and retraining the model. However, recent empirical studies have shown that the existing methods of estimating IF predict the leave-one-out-and-retrain effect poorly. In order to understand the mismatch between the theoretical promise and the practical results, we analyse five assumptions made by IF methods which are problematic for modern-scale deep neural networks and which concern convexity, numeric stability, training trajectory and parameter divergence. This allows us to clarify what can be expected theoretically from IF. We show that while most assumptions can be addressed successfully, the parameter divergence poses a clear limitation on the predictive power of IF: influence fades over training time even with deterministic training. We illustrate this theoretical result with BERT and ResNet models. Another conclusion from the theoretical analysis is that IF are still useful for model debugging and correcting even though some of the assumptions made in prior work do not hold: using natural language processing and computer vision tasks, we verify that mis-predictions can be successfully corrected by taking only a few fine-tuning steps on influential examples.

Key facts. Cited by 29 papers in the map (data through 14 Oct 2026). Builds on 15 of its 19 references that are in the map. First posted on arXiv 26 May 2023.

Builds on

15 of 19 references.

References · 15

  1. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  2. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  3. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 580
  4. 2021Editing Factual Knowledge in Language Modelscited by 553
  5. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
  6. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
  7. 2020Influence Functions in Deep Learning Are Fragilecited by 252
  8. 2016Ex Machina: Personal Attacks Seen at Scalecited by 210
  9. 2019On the Accuracy of Influence Functions for Measuring Group Effectscited by 147
  10. 2022If Influence Functions are the Answer, Then What is the Question?cited by 144
  11. 2021Scaling Up Influence Functionscited by 132
  12. 2020FastIF: Scalable Influence Functions for Efficient Model Interpretation and Debuggingcited by 120
3 more
  1. 2021Input Similarity from the Neural Network Perspectivecited by 79
  2. 2023Simfluence: Modeling the Influence of Individual Training Examples by Simulating Training Runscited by 53
  3. 2021Revisiting Methods for Finding Influential Examplescited by 39

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 8; 2025: 15; 2026: 5.

29 papers.

Sort:

By area:

  1. 2024Training Data Attribution via Approximate Unrolled Differentiationcited by 34
  2. 2024Causal Estimation of Memorisation Profilescited by 20
  3. 2024Unlearning Traces the Influential Training Data of Language Modelscited by 18
  4. 2025LayerIF: Estimating Layer Quality for Large Language Models using Influence Functionscited by 12
  5. 2024Unveiling Privacy, Memorization, and Input Curvature Linkscited by 10
  6. 2024Outlier Gradient Analysis: Efficiently Identifying Detrimental Training Samples for Deep Learning Modelscited by 10
  7. 2025Better Training Data Attribution via Better Inverse Hessian-Vector Productscited by 10
  8. 2025Enhancing Training Data Attribution with Representational Optimizationcited by 8
  9. 2024Final-Model-Only Data Attribution with a Unifying View of Gradient-Based Methodscited by 5
  10. 2025Beyond the Rosetta Stone: Unification Forces in Generalization Dynamicscited by 3
  11. 2025Train on Validation (ToV): Fast data selection with applications to fine-tuningcited by 3
  12. 2025Z0-Inf: Zeroth Order Approximation for Data Influencecited by 3
17 more
  1. 2025Attributing Data for Sharpness-Aware Minimizationcited by 2
  2. 2025Newfluence: Boosting Model interpretability and Understanding in High Dimensionscited by 2
  3. 2025Testing Most Influential Setscited by 2
  4. 2023SoK: Memorisation in machine learningcited by 1
  5. 2024PINNfluence: Interpreting PINNs through Influence Functionscited by 1
  6. 2025Laplace Sample Information: Data Informativeness Through a Bayesian Lenscited by 1
  7. 2025PARIS: Pruning Algorithm via the Representer theorem for Imbalanced Scenarioscited by 1
  8. 2026STRIDE: Training Data Attribution via Sparse Recovery from Subset Perturbationscited by 1
  9. 2024LayerMatch: Do Pseudo-labels Benefit All Layers?cited by 0
  10. 2025A Comparative Analysis of Influence Signals for Data Debuggingcited by 0
  11. 2025Targeted Fine-Tuning of DNN-Based Receivers via Influence Functionscited by 0
  12. 2025What Is The Performance Ceiling of My Classifier? Utilizing Category-Wise Influence Functions for Pareto Frontier Analysiscited by 0
  13. 2025f-INE: A Hypothesis Testing Framework for Estimating Influence under Training Randomnesscited by 0
  14. 2026Data Attribution in Adaptive Learningcited by 0
  15. 2026Data Attribution in Large Language Models via Bidirectional Gradient Optimizationcited by 0
  16. 2026Validity Threats for Foundation Model Researchcited by 0
  17. 2026Groups Don't Move as One: A Bregman Clustering View of Linearized Group Influencecited by 0