Generalization bound for infinitely divisible empirical process

Publication Type:
Conference Proceeding
Journal of Machine Learning Research, 2011, 15 pp. 864 - 872
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010001750.pdf183.18 kB
Adobe PDF
In this paper, we study the generalization bound for an empirical process of samples independently drawn from an infinitely divisible (ID) distribution, which is termed as the ID empirical process. In particular, based on a martingale method, we develop deviation inequalities for the sequence of random variables of an ID distribution. By applying the obtained deviation inequalities, we then show the generalization bound for ID empirical process based on the annealed Vapnik-Chervonenkis (VC) entropy. Afterward, according to Sauer's lemma, we get the generalization bound for ID empirical process based on the VC dimension. Finally, by using a resulted result bound, we analyze the asymptotic convergence of ID empirical process and show that the convergence rate of ID empirical process can reach O ((ΔF(2N)N)11.3) and it is faster than the results of the generic i.i.d. empirical process (Vapnik, 1999). Copyright 2011 by the authors.
Please use this identifier to cite or link to this item: