暂无分享,去创建一个
[1] Shai Ben-David,et al. Agnostic Online Learning , 2009, COLT.
[2] Noga Alon,et al. Private PAC learning implies finite Littlestone dimension , 2018, STOC.
[3] Siddharth Bhaskar. THICKET DENSITY , 2021, The Journal of Symbolic Logic.
[4] Wilfrid Hodges,et al. A Shorter Model Theory , 1997 .
[5] Noga Alon,et al. Closure Properties for Private Classification and Online Prediction , 2020, COLT.
[6] W. Hodges. CLASSIFICATION THEORY AND THE NUMBER OF NON‐ISOMORPHIC MODELS , 1980 .
[7] Ambuj Tewari,et al. Online learning via sequential complexities , 2010, J. Mach. Learn. Res..
[8] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[9] Norbert Sauer,et al. On the Density of Families of Sets , 1972, J. Comb. Theory, Ser. A.
[10] R. Dudley. Central Limit Theorems for Empirical Measures , 1978 .
[11] Karthik Sridharan,et al. Statistical Learning and Sequential Prediction , 2014 .
[12] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.