mlsanityData to 7 Oct 2026

Perturbing the Derivative: Wild Refitting for Model-Free Evaluation of Machine Learning Models under Bregman Losses

arXiv 2509.02476 ↗First posted 2 Sep 2025stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We study the excess risk evaluation of classical penalized empirical risk minimization (ERM) with Bregman losses. We show that by leveraging the idea of wild refitting, one can efficiently upper bound the excess risk through the so-called "wild optimism," without relying on the global structure of the underlying function class. This property makes our approach inherently model-free. Unlike conventional analysis, our framework operates with just one dataset and black-box access to the training procedure. The method involves randomized Rademacher symmetrization and constructing artificially modified outputs by perturbation in the derivative space with appropriate scaling, upon which we retrain a second predictor for excess risk estimation. We establish high-probability performance guarantee under the fixed design setting, demonstrating that wild refitting under Bregman losses, with an appropriately chosen wild noise scale, yields a valid upper bound on the excess risk. Thus, our work is promising for theoretically evaluating modern opaque ML models, such as deep neural networks and generative models, where the function class is too complex for classical learning theory and empirical process techniques.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 31 of its 69 references that are in the map. First posted on arXiv 2 Sep 2025.

Builds on

31 of 69 references.

References · 31

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2023GPT-4 Technical Reportcited by 18,132
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  5. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
  6. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  7. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 653
  8. 2020ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Languagecited by 309
  9. 2023State of What Art? A Call for Multi-Prompt LLM Evaluationcited by 299
  10. 2020Transformers as Soft Reasoners over Languagecited by 265
  11. 2023PIXIU: A Large Language Model, Instruction Data and Evaluation Benchmark for Financecited by 217
  12. 2018Model Evaluation, Model Selection, and Algorithm Selection in Machine Learningcited by 157
19 more
  1. 2024Who Validates the Validators? Aligning LLM-Assisted Evaluation of LLM Outputs with Human Preferencescited by 142
  2. 2024ORLM: A Customizable Framework in Training Large Models for Automated Optimization Modelingcited by 124
  3. 2019Empirical Study of Off-Policy Policy Evaluation for Reinforcement Learningcited by 121
  4. 2017Stability and Generalization of Learning Algorithms that Converge to Global Optimacited by 100
  5. 2023A Comprehensive Study on Robustness of Image Classification Models: Benchmarking and Rethinkingcited by 85
  6. 2021Cross-validation: what does it estimate and how well does it do it?cited by 65
  7. 2020The gap between theory and practice in function approximation with deep neural networkscited by 53
  8. 2023Foundations of Reinforcement Learning and Interactive Decision Makingcited by 33
  9. 2021Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradientcited by 31
  10. 2023On the Eigenvalue Decay Rates of a Class of Neural-Network Related Kernel Functions Defined on General Domainscited by 30
  11. 2024Fine Tuning LLM for Enterprise: Practical Guidelines and Recommendationscited by 28
  12. 2023Generative AI-enabled Vehicular Networks: Fundamentals, Framework, and Case Studycited by 24
  13. 2025Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewardscited by 13
  14. 2024Is K-fold cross validation the best model selection method for Machine Learning?cited by 10
  15. 2017Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networkscited by 6
  16. 2025Contextual Online Decision Making with Infinite-Dimensional Functional Regressioncited by 5
  17. 2023Sample Efficient Reinforcement Learning with Partial Dynamics Knowledgecited by 4
  18. 2025Wild refitting for black box predictioncited by 4
  19. 2025Pre-Trained AI Model Assisted Online Decision-Making under Missing Covariates: A Theoretical Perspectivecited by 3

Built on by

Not cited yet.