mlsanityData to 7 Oct 2026

Modify Training Directions in Function Space to Reduce Generalization Error

arXiv 2307.13290 ↗First posted 25 Jul 2023stat.ML cs.LG math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose theoretical analyses of a modified natural gradient descent method in the neural network function space based on the eigendecompositions of neural tangent kernel and Fisher information matrix. We firstly present analytical expression for the function learned by this modified natural gradient under the assumptions of Gaussian distribution and infinite width limit. Thus, we explicitly derive the generalization error of the learned neural network function using theoretical methods from eigendecomposition and statistics theory. By decomposing of the total generalization error attributed to different eigenspace of the kernel in function space, we propose a criterion for balancing the errors stemming from training set and the distribution discrepancy between the training set and the true data. Through this approach, we establish that modifying the training direction of the neural network in function space leads to a reduction in the total generalization error. Furthermore, We demonstrate that this theoretical framework is capable to explain many existing results of generalization enhancing methods. These theoretical results are also illustrated by numerical examples on synthetic data.

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

Builds on

25 of 36 references.

References · 25

  1. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  2. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  3. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  4. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  5. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  6. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  7. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  8. 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 491
  9. 2014New insights and perspectives on the natural gradient methodcited by 435
  10. 2020Self-Challenging Improves Cross-Domain Generalizationcited by 426
  11. 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
  12. 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
13 more
  1. 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
  2. 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 221
  3. 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
  4. 2020Self-Distillation Amplifies Regularization in Hilbert Spacecited by 171
  5. 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
  6. 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 138
  7. 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
  8. 2021Learning curves of generic features maps for realistic datasets with a teacher-student modelcited by 126
  9. 2020On the Similarity between the Laplace and Neural Tangent Kernelscited by 76
  10. 2020Kernel Alignment Risk Estimator: Risk Prediction from Training Datacited by 54
  11. 2021What can linearized neural networks actually say about generalization?cited by 49
  12. 2020The Effects of Mild Over-parameterization on the Optimization Landscape of Shallow ReLU Neural Networkscited by 33
  13. 2020Understanding Approximate Fisher Information for Fast Convergence of Natural Gradient Descent in Wide Neural Networkscited by 22

Built on by

Not cited yet.