mlsanityData to 14 Oct 2026

Perturbing the Derivative: Doubly Wild Refitting for Model-Free Evaluation of Opaque Machine Learning Predictors

arXiv 2511.18789 ↗First posted 24 Nov 2025cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the problem of excess risk evaluation for empirical risk minimization (ERM) under convex losses. We show that by leveraging the idea of wild refitting, one can upper bound the excess risk through the so-called "wild optimism," without relying on the global structure of the underlying function class but only assuming black box access to the training algorithm and a single dataset. We begin by generating two sets of artificially modified pseudo-outcomes created by stochastically perturbing the derivatives with carefully chosen scaling. Using these pseudo-labeled datasets, we refit the black-box procedure twice to obtain two wild predictors and derive an efficient excess risk upper bound under the fixed design setting. Requiring no prior knowledge of the complexity of the underlying function class, our method is essentially model-free and holds significant promise for theoretically evaluating modern opaque deep neural networks and generative models, where traditional learning theory could be infeasible due to the extreme complexity of the hypothesis class.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 11 of its 49 references that are in the map. First posted on arXiv 24 Nov 2025.

Builds on

11 of 49 references.

References · 11

  1. 2023GPT-4 Technical Reportcited by 18,396
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2024ORLM: A Customizable Framework in Training Large Models for Automated Optimization Modelingcited by 124
  5. 2023GPT Models in Construction Industry: Opportunities, Limitations, and a Use Case Validationcited by 21
  6. 2021On Dynamic Pricing with Covariatescited by 10
  7. 2024Is K-fold cross validation the best model selection method for Machine Learning?cited by 10
  8. 2017Eigenvalue Decay Implies Polynomial-Time Learnability for Neural Networkscited by 6
  9. 2025Contextual Online Decision Making with Infinite-Dimensional Functional Regressioncited by 5
  10. 2025Wild refitting for black box predictioncited by 5
  11. 2017ADMM for monotone operators: convergence analysis and ratescited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.