|
Course
description: Mathematical
models of complex human behavior, including individual and group
decision making, information processing, learning, perception, and
overt action. Specific computational techniques drawn from decision
theory, information theory, probability theory, machine learning, and
elements of data analysis.
Topics include: Rational decision making, quantifying costs, rewards, utilities and uncertainty. Individual and group decision making for problems like mate selection. Relationship between decision theory and models for cognition. Learning theory, models of adaptation, elements of machine learning, learning as inference, learning as exploration/
This course is intended for beginning
graduate students and advanced undergraduates. There will be 4-6 homework
assignments and a final project. Grading will be
approximately 60% on the homework assignments, and
40% on the final project. Elliott N119 Secondary: 518 EE/CS
Building
Meetings:
Tuesday and Thursday ,
12:45-2pm,
Professor:
Paul Schrater
E-mail:
schrater AT umn.edu
Office:
Primary: 211 Elliott
Hall,
Office hours:
2-3pm Tues, or by
appointment
TA:
Amy Kalia email: kali0080 AT umn.edu
TA office hrs
Th 11-12, Elliott 309 , or by appointment
Final
Project Assignment:
Your
final project will involve one of the following
1) Simulation or experiments.
2) Literature survey (with critical evaluation) on a given topic.
3) Theoretical work (detailed derivations, extensions of existing work, etc)
In all cases, the work should be written up as a 10-15 page paper. More difficult projects will get better grades if sucessfully completed. You will be evaluated in terms of the care with which you set up and thought through the goals and implementation, and in terms of the competence of the execution. Regardless of form the write up must include a survey of related literature results. This survey counts for 30% of your project grade and should show your ability to independently find, read, understand, and summarize papers in the primary literature related to your project topic.
The project schedule is:
Feb. 24: Topic selection. One or two pages explaining the project with
a list of references.
April 7: Partial report (3 to 5 pages).
May 9: Final report (10 to 15 pages).
Graduate students may be required to give a short presentation of their
project towards the last weeks of the semester.
This presentation will count for 5% of the total class grade (this
grade will be counted as part of the project
grade).
Cheating and Plagiarism
The homework and programming
assignments
must not be the result of cooperative work. Each student
must work individually in order to understand the material in depth.
You may discuss the issues but by
no means, copy the homework or the programming assignment of somebody
else. All work in the projects
and the programming assignment must properly cite sources. For example,
if you quote a source in your
project, you must include the quotation in quotation marks and clearly
indicate the source of the quotation.
Any student caught cheating will receive an F
as a class grade
and the University policies for cheating
and plagiarism will be followed.
All reading material will be in the
form of
papers or book chapters that students will download from this web
site. No textbook currently exists that covers the intended range of
subject
matter. Please note that some of the primary literature will be
difficult and written for an expert audience rather than for
instruction.
While there is no required text, books that I may draw from and that cover some of the material at a more introductory level include:
for programming statistics in Matlab see:
Computational Statistics Handbook (Matlab software)
Some concepts from linear algebra are extremely helpful:
Schedule from Spring 2006
Week | Tuesday | Thursday | Suggested Readings | Lecture Notes | Assignment |
1 (1/16-1/18) | Introduction Course Syllabus Matlab Tutorials(1,2,3), |
Mathematical Preliminaries | Course Syllabus, Probability Theory book. More than you need, but Chap 1-6 cover all aspects of probability we use in this course in depth. Probability Theory(terse review), Vectors, Interactive Probability Applets |
Lec1 ppt Matlab Tutorial Lec2 ppt |
|
2 (1/23-1/25) |
Mathematical
preliminaries |
Measurement
Theory |
MeasureTheory Chapter from Coombs, Dawes & Tversky MeasureTheory FAQ (Warren Sarle) |
Lec3 ppt |
HW1 is posted and due Feb 11st by midnight. You need to download colordiscrim.m as well. |
3 (1/30-2/1) | Making
Decisions- Overview Bayesian
decision theory |
Making
Decisions-Utilities/Loss |
Utility theory
overview from
Artificial Intelligence, a Modern Approach by Russell and Norvig 1st ed. Overview of decision theory from Mathematical Psychology- an Introduction by Coombs, Dawes, and Tversky. This is quite old, so don't take any stock of the experimental results- they have not held up. High-res scan(13MB) Low-res(3MB) |
Lec4 ppt Lec5 ppt |
HW2 is due Feb 8th. (it is just the 4th problem of homework 1) |
4 (2/6-2/8) | Making
Decisions- Beliefs |
Making Decisions- Beliefs | Bayesian
models object perception Motion illusions as optimal percepts Lightness perception |
Lec6 ppt |
|
5 (2/13-2/15) | Making
Decisions-Sensory
decisions |
Making
Decisions-Sensory
decisions |
Lec7 ppt |
||
6 (2/20-2/22) |
Making
Decisions-Motor decisions
|
Making
Decisions-
Cognitive judgments Memory models and decision biases |
Motor Lecture is based in
part on: Kording and Wolpert Trommershauser etal Glimcher review |
Lec8 ppt Lec9 ppt |
HW3 is due March 20th |
7 (2/27-3/1) | Making
Decisions- Prospect theory |
Game Theory- Basics | 10
years of rational approach to cognition Optimal forgetting1 Optimal forgetting2 Tversky Fox Trade off method |
Lec10 see 9 Lec11 ppt |
|
8 (3/6-3/8) | Game
theory-Basics |
Game theory-Basics |
Non-technical introduction to Game theory Osbourne Game Theory chap2: Nash Eq. Osbourne Game Theory chap3: Nash Eq. Applications Camerer Behavioral Game Theory chap1: Overview and Game theory basics BattleofSexes.m |
Lec11 ppt |
|
9 (3/15-3/17) | SPRING BREAK | BRING SPREAK |
|||
10 (3/20-3/22) | Game
theory-Basics |
Game theory-Basics | Measuring social
norms using
experimental games |
Lec12 ppt |
|
11 (3/27-3/29) | Game theory-Quantifying Social behavior | Game theory-Quantifying Social behavior/Mate selection | Camerer Behavioral GameTheory chap2 Camerer Behavioral Game Theory chap3 |
||
12 (4/3-4/5) | Game Theory - Behavioral Game Theory | Game Theory - Behavioral Game Theory | Lec13 ppt |
HW4 is posted, Due May 3rd | |
13 (4/10-4/12) | Game Theory - Behavioral Game Theory | Sequential Models I | Sequential models chapter from Coombes: Mathematical Psychology | ||
14 (4/17-4/19) | Sequential Models II | Sequential Models III | HotHand? Perceiving random sequences |
|
|
15 (4/24-4/26) | Sequential Models IV | Learning-classical conditioning | PerceptionAction Lecture (ppt) |
FINAL PROJECT due May 14th |
|
16 (5/1-5/3) | Learning | Learning |
Computational Neuroscience Dayan&Abbott chap9 Computational Neuroscience Dayan&Abbott chap10 computational vs.Associational models Kakade Dayan: modeling acquistion and extinction in autoshaping 2ndpaper |
Learning |