Skip over navigation

Course Offerings

Course Evaluation Results

Course Details

Spring 2006-2007
* PHI 218 / ELE 218 (EC)   Graded A-F, P/D/F, Audit

Learning Theory and Epistemology

Gilbert H. Harman
Sanjeev R. Kulkarni

A broad and accessible introduction to contemporary statistical learning theory as a response to the philosophical problem of induction. It is intended for students of all backgrounds. Topics covered include pattern recognition, the Bayes rule, nearest neighbor methods, neural networks, and support vector machines.

Sample reading list:
Harman & Kulkarni, The Problem of Induction
Harman & Kulkarni, Course Textbook (draft)
Excerpts from other sources.,
See instructor for complete list

Reading/Writing assignments:
Typical Weekly Assignments: One or two hours of reading, four hours of homework problems.

Final Exam - 30%
Term Paper(s) - 20%
Class/Precept Participation - 10%
Problem set(s) - 40%

Prerequisites and Restrictions:
No specific course prerequisites, but the course will require analytical and logical thinking..

Other information:
Due to the nature of the course, for each topic covered on both homework and exams, there will be questions that are more problem-solving in nature and questions that are more discursive in nature.

Schedule/Classroom assignment:

Class numberSectionTimeDaysRoomEnrollmentStatus
42170 L01 01:30:00 pm - 02:20:00 pm M W   Computer Science Building   104   Enrolled:55 Limit:84
P01 01:30:00 pm - 02:20:00 pm F   Friend Center   008   Enrolled:0 Limit:42
P02 12:30:00 pm - 01:20:00 pm F   Friend Center   008   Enrolled:0 Limit:42
P03 TBA        Enrolled:0 Limit:30