Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory: July 27-29, 1992, Pittsburgh, Pennsylvania |
Contents
Monday July 27 | 1 |
Online Learning of Rectangles | 16 |
Cryptographic Lower Bounds on Learnability of Boolean Functions on the Uniform Distri | 29 |
Copyright | |
27 other sections not shown
Common terms and phrases
agnostic learning Angluin approximation assignment assume boolean functions c₁ Computational Learning Theory Computer Science concept class consider consistent construction convergence Corollary counterexample Dana Angluin decision list decision trees defined definition denote dimension distribution DNF formula domain equivalence queries error estimate exists finite func function f given h₁ Haussler Hence hypothesis identify inductive inference infinite input Kearns labeled learner learning algorithm least Lemma literals loss function machine Machine Learning membership queries metric entropy mind changes minimal monotone nodes notation obtain oracle ordinal output PAC learning PAC model pair parameters polynomial positive examples prediction probability problem programs Proof random read-once formulas recursive functions representation representation class rithm S₁ sample satisfied sequence spectral norm stage stochastic string subset target concept target function Theorem Theory tion uniform uniform convergence variables VC-dimension vector