| Reading & Response (due 1/16/09) | Please read Valiant's paper, A theory of the learnable, (see [Papers].) Please pay attention to what you do when you have difficulty understanding part of the paper. Write a response of not more than one page, due in class on Friday 1/16/09. The response should take *one* point in the paper (either technical or nontechnical) and explain and discuss it. Do not summarize the paper. |
|---|---|
| Response Summary | Assignment #1: Summary of Responses. |
| Problem Set (due 1/30/09) | Assignment #2. |
| Problem Set (due 2/13/09) | Assignment #3. Please note clarification of problem 2: the distribution D_c is uniform on the positive examples of c and *zero* on the negative examples of c. |
| Brainstorming and Reading (due 2/25/09) | Assignment #4. Please note that the brainstorming for course project is NOT necessarily a project proposal -- you may end up choosing to do something different. |
| Reading (for 2/27/09) | Please read Avrim Blum's paper "Empirical Support for Winnow and Weighted Majority Algorithms: Results on a Calendar-Scheduling Domain." (See [Papers].) |
| Problem Set (due 3/25/09) | Assignment #5. A binary classification problem. |
| Reading (for 3/27/09) | Please read my paper "Learning regular sets from queries and counterexamples", Information and Control 75, 87-106 (1987). (See [Papers].) |
| Project Proposal (due 4/8/09) | Assignment #6. Possible re-do on assignment #5 and project proposal. |