mlsanityData to 7 Oct 2026

Towards Sobolev Pruning

arXiv 2312.03510 ↗First posted 6 Dec 2023cs.LG q-fin.CPcited by 0

Not on the map. Why?

Abstract (arXiv)

The increasing use of stochastic models for describing complex phenomena warrants surrogate models that capture the reference model characteristics at a fraction of the computational cost, foregoing potentially expensive Monte Carlo simulation. The predominant approach of fitting a large neural network and then pruning it to a reduced size has commonly neglected shortcomings. The produced surrogate models often will not capture the sensitivities and uncertainties inherent in the original model. In particular, (higher-order) derivative information of such surrogates could differ drastically. Given a large enough network, we expect this derivative information to match. However, the pruned model will almost certainly not share this behavior. In this paper, we propose to find surrogate models by using sensitivity information throughout the learning and pruning process. We build on work using Interval Adjoint Significance Analysis for pruning and combine it with the recent advancements in Sobolev Training to accurately model the original sensitivity information in the pruned neural network based surrogate model. We experimentally underpin the method on an example of pricing a multidimensional Basket option modelled through a stochastic differential equation with Brownian motion. The proposed method is, however, not limited to the domain of quantitative finance, which was chosen as a case study for intuitive interpretations of the sensitivities. It serves as a foundation for building further surrogate modelling techniques considering sensitivity information.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 45 references that are in the map. First posted on arXiv 6 Dec 2023.

Builds on

16 of 45 references.

References · 16

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  5. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  6. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  7. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  8. 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
  9. 2014The Loss Surfaces of Multilayer Networkscited by 278
  10. 2017Sobolev Training for Neural Networkscited by 136
  11. 2016Designing Energy-Efficient Convolutional Neural Networks using Energy-Aware Pruningcited by 133
  12. 2018Maximizing acquisition functions for Bayesian optimizationcited by 113
4 more
  1. 2018Knowledge Transfer with Jacobian Matchingcited by 73
  2. 2017NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigmcited by 60
  3. 2015Hyperparameter Search in Machine Learningcited by 33
  4. 2020Differential Machine Learningcited by 8

Built on by

Not cited yet.