Improved Vapnik Cervonenkis bounds
Olivier Catoni
Abstract
We give a new proof of VC bounds where we avoid the use of symmetrization and use a shadow sample of arbitrary size. We also improve on the variance term. This results in better constants, as shown on numerical examples. Moreover our bounds still hold for non identically distributed independent random variables. Keywords: Statistical learning theory, PAC-Bayesian theorems, VC dimension.
Create a lesson
Related papers
Minimax signal detection in regression under differential privacy
Elly K. H. Hung
A Tetration Distribution
Micah Thornton
Multi-modal Laplace-based sampling
Maxime Egéa, Hanyue Gu, Daniel Rudolf et al.
Studentized inference in randomized experiments when a few units dominate the outcome variation
Xinyuan Chen, Jonathan W. Kiesel, Jonathan R. Woody
Nonparametric Intensity Estimation for Covariate-Driven Poisson Processes Using Deep Learning
Atsutomo Yara, Yoshikazu Terada
Specification LASSO and a Flexible Characteristics-Based Asset Pricing Model
Chaohua Dong, Shuyi Ge, Shaoran Li et al.