## 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 | |

28 other sections not shown

### Common terms and phrases

allow appear apply approximation assignment assume boolean bound called complexity Computer concept concept class condition consider consistent construction contains convergence copy cover decision defined definition denote described dimension distribution efficient equivalence error estimate event examples exists fact finite fixed formula function give given Hence hypothesis identify implies inference infinite input instance labeled language learnable learner learning algorithm least Lemma limit literals loss machine measure membership minimal Note observations obtain otherwise output pair performance points polynomial positive possible prediction present probability problem programs Proof prove queries random recursive representation requires respect restricted rule sample satisfies sequence space specific stage step string subset Suppose teacher Theorem Theory tion tree true uniform variables vector weight