Title
A Deep Connection Between the Vapnik-Chervonenkis Entropy and the Rademacher Complexity.
Abstract
In this paper, we derive a deep connection between the Vapnik-Chervonenkis (VC) entropy and the Rademacher complexity. For this purpose, we first refine some previously known relationships between the two notions of complexity and then derive new results, which allow computing an admissible range for the Rademacher complexity, given a value of the VC-entropy, and vice versa. The approach adopted i...
Year
DOI
Venue
2014
10.1109/TNNLS.2014.2307359
IEEE Transactions on Neural Networks and Learning Systems
Keywords
DocType
Volume
Complexity theory,Entropy,Upper bound,Hamming distance,Annealing,Learning systems,Statistical learning
Journal
25
Issue
ISSN
Citations 
12
2162-237X
2
PageRank 
References 
Authors
0.40
0
4
Name
Order
Citations
PageRank
Davide Anguita1100170.58
Alessandro Ghio266735.71
Luca Oneto383063.22
Sandro Ridella4677140.62