6.825: Techniques in Artificial Intelligence--Fall '05

Announcements
References
Syllabus
Description
Prerequisites
Grading
Collaboration
Previous Editions


Course Staff Lectures

Professor: Tomas Lozano-Perez
tlp@csail.mit.edu
Office: 32-G492
Office Hours: by appointment

TA: Meg Aycinena
6825-staff@csail.mit.edu
Office: 32-G585
Office Hours: Tues 4-5pm in 32-346, Wed 4-5pm in 32-G451, and by appointment.

TA: Emma Brunskill
6825-staff@csail.mit.edu
Office: 32-331
Office Hours: Mon 12-1pm in 32-G451, Tues 4-5pm in 32-346, and by appointment.

Tuesdays and Thursdays,
2:30 - 4:00 pm
Location: 2-190

Announcements

  • The final exam is:
    • Tuesday, December 20th, 9:00am-12:00pm, in 32-144.
    Past exams are available here and are also available as a link from the syllabus.
  • We have also posted some problems and solutions from last year's final.
  • There will be a review session for the final on:
    • Thursday, December 15th, 2:30-4:30pm, in 2-190 (the regular lecture classroom).
  • We will be having extra office hours for the finals at the following times:
    • Friday, December 16th, 2-4pm, 32-G451 (Emma & Meg)
    • Monday, December 19th, 12-1pm, 32-346 (Emma)
    • Monday, December 19th, 3-4pm, 32-G451 (Meg)
  • The quiz and quiz solutions have been posted on the syllabus, or you can get them directly here: quiz solutions

References

Syllabus

Includes pointers to required reading not in the textbook and suggested exercises.

Description

6.825 is a graduate-level introduction to artificial intelligence. Topics include: representation and inference in first-order logic; modern deterministic and decision-theoretic planning techniques; basic supervised learning methods; and Bayesian network inference and learning.

Prerequisites

  • 6.041 (Probabilistic Systems Analysis)
  • 6.042 (Mathematics for Computer Science)
  • 6.046 (Introduction to Algorithms) (desirable, but not required)

Students should be familiar with uninformed search algorithms (depth-first and breadth-first methods), discrete probability (random variables, expectation, simple counting), propositional logic (boolean algebra), basic algorithms and data structures, basic computational complexity, and basic calculus. Students should also be aware that course assignments will require the use of the Java programming language.

Grading

The work for this course will consist of three take-home project assignments and two exams: a quiz and a final. The projects will count for 60% of the grade (20% each), and the exams, 40% (15% for the quiz and 25% for the final).

Late Policy for Projects: 10% off for each calendar day late. No credit if more than 5 days late.

Collaboration

We want to strongly encourage collaboration as a way for students to come to understand the material better. Project 1 is an individual assignment, but you may do Project 2 and Project 3 in groups of two, turning in a single write-up. You do not have to partner with the same person for both of the projects and you can choose to do either or both of them on your own.

If you are looking for a partner for an assignment, email the class list asking if anyone is available. You are also quite welcome to discuss the assignments as much as you'd like between groups. The ultimate requirement is this: Don't put your name on anything you don't understand. There will, of course, be no collaboration allowed on the exams.