An Improved Bound on the VC-Dimension of Neural Networks with Polynomial Activation Functions
classification
🧮 math.OC
math.AG
keywords
boundimprovedactivationfunctionsnetworksneuralpolynomialvc-dimension
read the original abstract
In this note, we derive an improved upper bound for the VC-dimension of neural networks with polynomial activation functions. This improved bound is based on a result of Rojas on the number of connected components of a semi-algebraic set.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.