mlsanityData to 7 Oct 2026

TPV: Parameter Perturbations Through the Lens of Test Prediction Variance

arXiv 2512.11089 ↗First posted 11 Dec 2025stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce test prediction variance (TPV)--the first-order sensitivity of a trained model's outputs to parameter perturbations--as a unifying framework for analyzing post-training robustness. TPV is a fully label-free object whose trace form separates the geometry of the trained model from the specific perturbation mechanism, placing SGD noise, label noise, quantization, and pruning under a single lens. The resulting expressions recover the wide-minima hypothesis for SGD and quantization noise, and yield a distinct Jacobian-spectral characterization for label noise connecting label-noise TPV with benign overfitting in nonlinear networks. Theoretically, we prove that training-set TPV converges to its test-set counterpart in the overparameterized limit, irrespective of generalization performance, providing the first result that prediction variance under local parameter perturbations can be inferred from training inputs alone. Empirically, this stability holds far more broadly, including at very low widths. Further, TPV correlates well with test loss, enabling practical applications: JBR, a label-free pruning criterion derived from TPV geometry matching state-of-the-art baselines; and training-set based model selection signal for in-distribution and transfer learning scenarios. Code available at github.com/devansharpit/TPV.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 41 of its 54 references that are in the map. First posted on arXiv 11 Dec 2025.

Builds on

41 of 54 references.

References · 41

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  4. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  5. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  6. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  7. 2018On the Spectral Bias of Neural Networkscited by 1,321
  8. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  9. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  10. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
  11. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  12. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
29 more
  1. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  2. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  3. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  4. 2019Benign Overfitting in Linear Regressioncited by 544
  5. 2019Importance Estimation for Neural Network Pruningcited by 531
  6. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  7. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  8. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  9. 2019Frequency Principle: Fourier Analysis Sheds Light on Deep Neural Networkscited by 360
  10. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  11. 2017Three Factors Influencing Minima in SGDcited by 270
  12. 2019Two models of double descent for weak featurescited by 194
  13. 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 134
  14. 2021Group Fisher Pruning for Practical Network Compressioncited by 130
  15. 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
  16. 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
  17. 2018Faster gaze prediction with dense networks and Fisher pruningcited by 92
  18. 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 75
  19. 2018A Modern Take on the Bias-Variance Tradeoff in Neural Networkscited by 64
  20. 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
  21. 2016A Variational Analysis of Stochastic Gradient Algorithmscited by 56
  22. 2019On the interplay between noise and curvature and its effect on optimization and generalizationcited by 44
  23. 2023Dynamics of Finite Width Kernel and Prediction Fluctuations in Mean Field Neural Networkscited by 42
  24. 2022Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?cited by 38
  25. 2022Memorization and Optimization in Deep Neural Networks with Minimum Over-parameterizationcited by 36
  26. 2018Leveraging Filter Correlations for Deep Model Compressioncited by 23
  27. 2023WHC: Weighted Hybrid Criterion for Filter Pruning on Convolutional Neural Networkscited by 6
  28. 2025Optimal Brain Connection: Towards Efficient Structural Pruningcited by 3
  29. 2024The Expected Loss of Preconditioned Langevin Dynamics Reveals the Hessian Rankcited by 1

Built on by

Not cited yet.