Certification of Machine Learning Models via Directional Sharpness
Not on the map. Why?
Abstract (arXiv)
In machine learning, model certification has been identified as an important method for gaining assurance about a model's trustworthiness and quality. A model's quality is largely determined by its ability to generalize, i.e., to perform well on data beyond what it was trained on. It is not possible to certify generalization directly, however, as it depends on unknown data and is not directly measurable. Proxies such as test accuracy can be misleading when the training process is perturbed (intentionally or accidentally), and metrics such as sharpness -- which has an empirically supported link to generalization -- are computationally expensive and can also serve as unreliable signals when training deviates from a prescribed procedure. In this work, we propose directional sharpness, a metric designed to efficiently and reliably indicate generalization despite potential training deviations. We provide empirical and analytical evidence that directional sharpness (1) correlates more strongly with generalization than existing metrics and (2) identifies models with poor generalization more reliably than existing metrics. Furthermore, directional sharpness is efficiently computable in model auditing settings, where the verifier has access to training data, and via zero-knowledge proofs that certify quality without revealing training data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 74 of its 99 references that are in the map. First posted on arXiv 23 Jun 2026.
Builds on
74 of 99 references.
References · 74
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2016Wide Residual Networkscited by 3,070
- 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2020Shortcut Learning in Deep Neural Networkscited by 1,969
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2018Annotation Artifacts in Natural Language Inference Datacited by 671
38 more
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 468
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2020Backdoor Learning: A Surveycited by 426
- 2021Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarkscited by 395
- 2019Label-Consistent Backdoor Attackscited by 296
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2021User-friendly introduction to PAC-Bayes boundscited by 239
- 2020Better Theory for SGD in the Nonconvex Worldcited by 158
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2022On Feature Learning in the Presence of Spurious Correlationscited by 145
- 2018Scaling provable adversarial defensescited by 143
- 2020Backdoor Attacks and Countermeasures on Deep Learning: A Comprehensive Reviewcited by 123
- 2019Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimatescited by 119
- 2020Tighter risk certificates for neural networkscited by 112
- 2014Preserving Statistical Validity in Adaptive Data Analysiscited by 103
- 2021Sleeper Agent: Scalable Hidden Trigger Backdoors for Neural Networks Trained from Scratchcited by 102
- 2019Asymmetric Valleys: Beyond Sharp and Flat Local Minimacited by 90
- 2020Relative Flatness and Generalizationcited by 88
- 2021Information-Theoretic Generalization Bounds for Stochastic Gradient Descentcited by 84
- 2020In Search of Robust Measures of Generalizationcited by 79
- 2025Towards LLM Unlearning Resilient to Relearning Attacks: A Sharpness-Aware Minimization Perspective and Beyondcited by 79
- 2019Do We Train on Test Data? Purging CIFAR of Near-Duplicatescited by 62
- 2023Generalization Bounds: Perspectives from Information Theory and PAC-Bayescited by 61
- 2024Friendly Sharpness-Aware Minimizationcited by 53
- 2019Deterministic PAC-Bayesian generalization bounds for deep networks via generalizing noise-resiliencecited by 51
- 2019The Impact of Neural Network Overparameterization on Gradient Confusion and Stochastic Gradient Descentcited by 46
- 2018Blind Justice: Fairness with Encrypted Sensitive Attributescited by 41
- 2020Coherent Gradients: An Approach to Understanding Generalization in Gradient Descent-based Optimizationcited by 41
- 2023Sharpness Minimization Algorithms Do Not Only Minimize Sharpness To Achieve Better Generalizationcited by 39
- 2023Sharpness-Aware Minimization Leads to Low-Rank Featurescited by 38
- 2024Privacy Backdoors: Enhancing Membership Inference through Poisoning Pre-trained Modelscited by 30
- 2021Power-law escape rate of SGDcited by 29
- 2023Why Does Sharpness-Aware Minimization Generalize Better Than SGD?cited by 28
- 2022Membership Inference via Backdooringcited by 27
- 2023Memorization Through the Lens of Curvature of Loss Function Around Samplescited by 27
- 2023BackdoorBox: A Python Toolbox for Backdoor Learningcited by 26
50 most cited of 74 All 74 (JSON)
Built on by
Not cited yet.