## Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, July 27-29, 1992, Pittsburgh, Pennsylvania |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Monday July 27 | 1 |

Online Learning of Rectangles | 16 |

Cryptographic Lower Bounds on Learnability of Boolean Functions on the Uniform Distri | 29 |

Copyright | |

23 other sections not shown

### Common terms and phrases

agnostic learning Angluin approximation assignment assume boolean functions Computational Learning Theory Computer Science concept class consider consistent construction convergence copy Corollary counterexample Dana Angluin decision list decision trees defined definition denote dimension distribution DNF formula domain empirical equivalence queries error estimate event exists finite func given Haussler Hence hypothesis identify inductive inference infinite input Kearns labeled learner learning algorithm learning model least Lemma literals loss function machine Machine Learning membership queries metric entropy mind changes minimal monotone nodes notation obtain optimal oracle ordinal output PAC learning PAC model pair parameters polynomial polynomial-time positive examples prediction probability problem programs Proof random read-once formulas recursive functions representation representation class rithm sample satisfied sequence spectral norm stage stochastic string subset target concept target function teacher Theorem Theory tion uniform uniform convergence variables VC-dimension vector