A Graph-theoretic Generalization of the Sauer-Shelah Lemma
暂无分享,去创建一个
[1] R. Dudley. Central Limit Theorems for Empirical Measures , 1978 .
[2] Noga Alon,et al. Scale-sensitive dimensions, uniform convergence, and learnability , 1997, JACM.
[3] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[4] David Haussler,et al. Sphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension , 1995, J. Comb. Theory, Ser. A.
[5] Luisa Gargano,et al. Capacities: From Information Theory to Extremal Set Theory , 1994, J. Comb. Theory, Ser. A.
[6] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[7] Peter L. Bartlett,et al. On efficient agnostic learning of linear combinations of basis functions , 1995, COLT '95.
[8] Philip M. Long,et al. A Generalization of Sauer's Lemma , 1995, J. Comb. Theory, Ser. A.
[9] D. Pollard. Empirical Processes: Theory and Applications , 1990 .
[10] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory, Ser. A.
[11] Sanjeev R. Kulkarni,et al. Covering numbers for real-valued function classes , 1997, IEEE Trans. Inf. Theory.
[12] David Haussler,et al. Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications , 1992, Inf. Comput..
[13] S. Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. , 1972 .
[14] Robert E. Schapire,et al. Efficient distribution-free learning of probabilistic concepts , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[15] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[16] R. Dudley,et al. Uniform and universal Glivenko-Cantelli classes , 1991 .