CS128/PSYCH128 Computational Models of Learning

CS128/PSYCH128
Computational Models of Learning

Spring 1999, Tuesdays 6:30 - 9:30pm
Trotter 215 (discussion) and Trotter 117 (lab)

Robert Dufour, Papazian 323, x8417 (rdufour1)
Lisa Meeden, Sproul 1, x8565, (meeden@cs)


Index
Course Description
Books & Readings
Evaluation
Schedule


Course description

This course will cover computer-based representational formalisms and algorithms that facilitate learning behaviors and that are inspired by biological models. We will focus on connectionist models that are based on neural network abstractions. We will also cover evolutionary-based approaches such as genetic algorithms, genetic programming, and evolutionary programming, discussing the kinds of learning behaviors facilitated by them. The course is made-up of two components: laboratory and discussion. Every week, students will have the opportunity to work with various models and algorithms in the development of learning behaviors. Readings relevant to the models to-be-covered that week will also be assigned and be used as the basis for seminar-style discussions.


Books & Readings


Evaluation

Your performance in this course will be evaluated along four parameters:

1. Class Participation & Reaction Notes: 20%
Reaction notes, your reactions to that week's readings, will be due by 5pm on Monday evenings via email. These notes will be posted to the web page to facilitate discussion. These notes should not be summaries of the papers, instead they should be the product the reading process (e.g., questions that were raised, points that were not clear, links to previous material you might have read, etc). You are expected to be an active participant in class discussions and that you come prepared for class every week. Each student will also be designated as discussion leader for one of the class meeting.

2. Home work: 20%
One of the goal for this course is to provide students with a framework to get hands-on experience working with various computational models. Although we will do some of that work in-class, some of that experience will have to be gained through homework. Homework will be due by 5pm on Fridays via email.

3. Midterm Project: 20%
There will be a mid-semester paper, a write-up of one of the computational simulations available in Exercises in Rethinking Innateness. Assigned February 23. Due March 19.

4. Term Project: 40%
Each student will be asked to design a project involving computational approach to learning. A series of topics will be provided at the beginning of the semester. These projects may be carried-out by pairs of students. Each student will be asked to present their project to the class at the end of the semester as well as turn in a written report.


Schedule


Week 01: Tuesday January 20
Topic: Introduction to Neural Networks

Lab:


Week 02: Tuesday January 27
Topic: Competitive learning and attractor networks

Reading:

Lab:
Week 03: Tuesday February 2
Topic: Backpropagation Networks

Reading:

Lab:
Week 04: Tuesday February 9
Topic: Issues of Representation

Reading:

Lab:
Week 05: Tuesday February 16
Topic: Backpropagation networks (continued)

Reading:

Lab:


Week 06: Tuesday February 23
Topic: Recurrent Networks

Reading:

Lab:
Week 07: Tuesday March 2
Topic: Recurrent Networks (continued)

Reading:

Lab:
Week 08: SPRING BREAK

Week 09: Tuesday March 16
Topic: Critiques of connectionism
Week 10: Tuesday March 23
Topic: Rule extraction and insertion Homework: Prepare a one-page final project proposal, due at the next class meeting.
Week 11: Tuesday March 30
Topic: Experimental design for projects Be prepared to give a brief summary of your final project proposal for the class.
Week 12: Tuesday April 6
Topic: Connectionist Models
Week 13: Tuesday April 13
Topic: Dynamic Connectionist Models
Week 14: Tuesday April 20
Final project presentations by students
Week 15: Tuesday April 27
Final project presentations by students
Week 16: Tuesday May 4
Dinner at Lisa's 6:30pm