Scribe Notes from the 1991 Offering of CS 582
These are notes made by student scribes in the 1991 course offering of CS 582. Note that not all material in this list will be covered in the current offering of CS 582. Also, some scribe notes will be added as new material is covered. Not all notes are currently publicly readable. As the material is covered in class, permissions will be updated.

Also included are the scribe notes on Bayesian learning from the 1998 offering.

o Title page, preface, and table of contents.

o Topic 1: Introduction.

o Topic 2: Two-Button PAC Model.

o Topic 3: Learning k-term DNF.

o Topic 4: Handling an Unknown Size Parameter.

o Topic 5: Learning With Noise.

o Topic 6: Occam's Razor.

o Topic 7: The Vapnik-Chervonenkis Dimension.

o Topic 8: Representation-Independent Hardness Results.

o Topic 9: The Strength of Weak Learnability.

o Topic 9.5: Bayesian Learning. (from the 1998 offering)

o Topic 10: Learning wIth Queries.

o Topic 12: Learning with Abundant Irrelevant Attributes.

o Topic 13: Learning Regular Sets.

o Topic 18: The Weighted Majority Algorithm.

o Homework Assignment 1. [From 1991]

o Homework Assignment 2. [From 1991]

o Homework Assignment 3. [From 1991]

o Bibliography.

Return to the CS582 Home Page