Nearly Optimal VC-Dimension and Pseudo-Dimension Bounds for Deep Neural Network Derivatives
Machine Learning
2023-05-16 v1 Numerical Analysis
Numerical Analysis
Abstract
This paper addresses the problem of nearly optimal Vapnik--Chervonenkis dimension (VC-dimension) and pseudo-dimension estimations of the derivative functions of deep neural networks (DNNs). Two important applications of these estimations include: 1) Establishing a nearly tight approximation result of DNNs in the Sobolev space; 2) Characterizing the generalization error of machine learning methods with loss functions involving function derivatives. This theoretical investigation fills the gap of learning error estimations for a wide range of physics-informed machine learning models and applications including generative models, solving partial differential equations, operator learning, network compression, distillation, regularization, etc.
Keywords
Cite
@article{arxiv.2305.08466,
title = {Nearly Optimal VC-Dimension and Pseudo-Dimension Bounds for Deep Neural Network Derivatives},
author = {Yahong Yang and Haizhao Yang and Yang Xiang},
journal= {arXiv preprint arXiv:2305.08466},
year = {2023}
}