mlsanityData to 7 Oct 2026

Attributing Data for Sharpness-Aware Minimization

arXiv 2507.04059 ↗First posted 5 Jul 2025cs.LG cs.AI cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Sharpness-aware Minimization (SAM) improves generalization in large-scale model training by linking loss landscape geometry to generalization. However, challenges such as mislabeled noisy data and privacy concerns have emerged as significant issues. Data attribution, which identifies the contributions of specific training samples, offers a promising solution. However, directly rendering existing data influence evaluation tools such as influence functions (IF) to SAM will be inapplicable or inaccurate as SAM utilizes an inner loop to find model perturbations that maximize loss, which the outer loop then minimizes, resulting in a doubled computational structure. Additionally, this bilevel structure complicates the modeling of data influence on the parameters. In this paper, based on the IF, we develop two innovative data valuation methods for SAM, each offering unique benefits in different scenarios: the Hessian-based IF and the Gradient Trajectory-based IF. The first one provides a comprehensive estimation of data influence using a closed-form measure that relies only on the trained model weights. In contrast, the other IF for SAM utilizes gradient trajectory information during training for more accurate and efficient data assessment. Extensive experiments demonstrate their effectiveness in data evaluation and parameter tuning, with applications in identifying mislabeled data, model editing, and enhancing interpretability.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 53 of its 68 references that are in the map. First posted on arXiv 5 Jul 2025.

Builds on

53 of 68 references.

References · 53

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  3. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  4. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  5. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  6. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  7. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  8. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  9. 2019Adversarial Training for Free!cited by 638
  10. 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
  11. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 599
  12. 2017Exploring Generalization in Deep Learningcited by 595
38 more
  1. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
  2. 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 514
  3. 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
  4. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  5. 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
  6. 2019Towards Efficient Data Valuation Based on the Shapley Valuecited by 279
  7. 2023TRAK: Attributing Model Behavior at Scalecited by 273
  8. 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 259
  9. 2020Influence Functions in Deep Learning Are Fragilecited by 247
  10. 2021R-Drop: Regularized Dropout for Neural Networkscited by 202
  11. 2017Spectral Norm Regularization for Improving the Generalizability of Deep Learningcited by 178
  12. 2021Beta Shapley: a Unified and Noise-reduced Data Valuation Framework for Machine Learningcited by 162
  13. 2020Mixed-Privacy Forgetting in Deep Networkscited by 158
  14. 2022Towards Understanding Sharpness-Aware Minimizationcited by 145
  15. 2020Explaining Black Box Predictions and Unveiling Data Artifacts through Influence Functionscited by 144
  16. 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
  17. 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
  18. 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
  19. 2022Penalizing Gradient Norm for Efficiently Improving Generalization in Deep Learningcited by 122
  20. 2019Data Valuation using Reinforcement Learningcited by 115
  21. 2021Sharpness-Aware Minimization Improves Language Model Generalizationcited by 108
  22. 2018Understanding the Origins of Bias in Word Embeddingscited by 90
  23. 2019Repairing without Retraining: Avoiding Disparate Impact with Counterfactual Distributionscited by 48
  24. 2023Sharpness-Aware Minimization Leads to Low-Rank Featurescited by 38
  25. 2023Certified Minimax Unlearning with Generalization Rates and Deletion Capacitycited by 29
  26. 2023Theoretical and Practical Perspectives on what Influence Functions Docited by 28
  27. 2024Editable Concept Bottleneck Modelscited by 22
  28. 2023Differentially Private Natural Language Models: Recent Advances and Future Directionscited by 20
  29. 2023Practical Differentially Private and Byzantine-resilient Federated Learningcited by 18
  30. 2020Multi-Stage Influence Functioncited by 16
  31. 2025Short-length Adversarial Training Helps LLMs Defend Long-length Jailbreak Attacks: Theoretical and Empirical Evidencecited by 13
  32. 2025Towards User-level Private Reinforcement Learning with Human Feedbackcited by 13
  33. 2023Preserving Node-level Privacy in Graph Neural Networkscited by 11
  34. 2025Mechanistic Unveiling of Transformer Circuits: Self-Influence as a Key to Model Reasoningcited by 11
  35. 2019Estimating Smooth GLM in Non-interactive Local Differential Privacy Model with Public Unlabeled Datacited by 9
  36. 2024Privacy-Preserving Low-Rank Adaptation against Membership Inference Attacks for Latent Diffusion Modelscited by 9
  37. 2023Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approachcited by 8
  38. 2024Dissecting Representation Misalignment in Contrastive Learning via Influence Functioncited by 7

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.