Discretized-Vapnik-Chervonenkis dimension for analyzing complexity of real function classes
In this paper, we introduce the discretized-Vapnik-Chervonenkis (VC) dimension for studying the complexity of a real function class, and then analyze properties of real function classes and neural networks. We first prove that a countable traversal set is enough to achieve the VC dimension for a rea...
Saved in:
Main Authors: | Zhang, Chao, Bian, Wei, Tao, Dacheng, Lin, Weisi |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/99545 http://hdl.handle.net/10220/13524 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Analyzing hierarchical complex real-time systems
by: Liu, Y., et al.
Published: (2013) -
Erratum: On the dimensions of the binary codes of a class of unitals (Discrete Math. (2009) 309 (570-575))
by: Leung, K.H., et al.
Published: (2014) -
Generalization bounds of ERM-based learning processes for continuous-time Markov chains
by: Zhang, Chao, et al.
Published: (2013) -
Spectral representations of discrete functions
by: Fu, Cheng
Published: (2011) -
Learning a no-reference quality assessment model of enhanced images with big data
by: Gu, Ke, et al.
Published: (2020)