0:00:00.211,0:00:04.140
Hello everyone, and welcome to the class on probabilistic graphical models.

0:00:04.140,0:00:07.647
My name is Daphne Koller and I’m a professor at Stanford University.

0:00:07.647,0:00:09.618
We here at Stanford are really excited

0:00:09.618,0:00:12.209
to be able to offer this graduate level Stanford class

0:00:12.209,0:00:14.751
to anyone, anywhere around the world for free.

0:00:14.751,0:00:18.481
So what are probabilistic graphical models?

0:00:18.481,0:00:20.751
Well, it’s a bit complicated to explain

0:00:20.751,0:00:24.095
and we’re going to talk about that in an upcoming video

0:00:24.095,0:00:26.192
but also throughout the entire class.

0:00:26.192,0:00:29.716
In this video, I’d like to tell you a little bit about the format of this class.

0:00:29.716,0:00:32.816
The course is going to be offered over ten weeks worth of material

0:00:32.816,0:00:34.794
plus a final examination at the end.

0:00:34.794,0:00:39.066
The content is going to be conveyed via a set of videos,

0:00:39.066,0:00:42.317
augmented with quizzes to reinforce understanding.

0:00:42.317,0:00:45.496
In addition, there is going to be a weekly problem set

0:00:45.496,0:00:50.041
where the problem sets altogether are going to be worth 25% of the score

0:00:50.041,0:00:53.479
for a total of the nine problem sets for the nine weeks worth of content.

0:00:53.479,0:00:56.568
The problem sets are designed to allow for multiple submissions,

0:00:56.568,0:01:00.626
so that each version of the problem set is going to be a little bit different

0:01:00.626,0:01:04.040
so that you can resubmit the same problem set [a] couple of times

0:01:04.040,0:01:06.623
to make sure that you really mastered the material.

0:01:06.623,0:01:10.962
In addition, there’s going to be a weekly programming assignment,

0:01:10.962,0:01:13.859
and those programming assignments were selected

0:01:13.859,0:01:17.976
to reinforce specific concepts that we’re studying in the course,

0:01:17.976,0:01:21.343
but at the same time to reveal the range of applications

0:01:21.343,0:01:25.431
to which the framework of probabilistic graphical models can be successfully applied.

0:01:25.431,0:01:27.288
So we’re going to have, for example,

0:01:27.288,0:01:30.367
a problem set on how you use probabilistic graphical models

0:01:30.367,0:01:33.639
to understand the inheritance of genetically inherited diseases.

0:01:33.639,0:01:35.647
We’re going to have one that shows

0:01:35.647,0:01:38.963
how you can look at a set of handwritten characters

0:01:38.963,0:01:40.937
and read what’s written there.

0:01:40.937,0:01:44.087
And we’re going to have one that allows you

0:01:44.087,0:01:47.647
to look at a stream of output from a Kinect sensor

0:01:47.647,0:01:49.759
that gives you both video and range data

0:01:49.759,0:01:52.167
and recognize human activities.

0:01:52.167,0:01:56.458
These nine programming assignments are each going to be worth 7% of the score

0:01:56.458,0:01:58.089
for a total of 63%,

0:01:58.089,0:02:01.408
which gives us 12% left for the final exam.

0:02:01.408,0:02:04.480
What background do you need for this class?

0:02:04.480,0:02:07.540
Well, it’s going to be really hard to do this class,

0:02:07.540,0:02:11.048
without some understanding of basic probability theory.

0:02:11.048,0:02:13.087
This doesn’t have to be very advanced stuff.

0:02:13.087,0:02:16.176
We’re talking about things like independence and Bayes' rule

0:02:16.176,0:02:18.711
And just basics of discrete distributions.

0:02:18.711,0:02:20.615
And we also have a few introductory modules

0:02:20.615,0:02:23.687
to refresh your memory about these basic concepts.

0:02:23.687,0:02:26.942
The programming assignments will require

0:02:26.942,0:02:29.416
that you’ve had some experience programming before

0:02:29.416,0:02:30.871
because this is not a programming class.

0:02:30.871,0:02:31.959
We don’t teach you how to program.

0:02:31.959,0:02:37.383
And because this class merges ideas from both probability theory and computer science,

0:02:37.383,0:02:41.247
it’s really important you have some background in algorithms and data structures.

0:02:41.247,0:02:44.475
Recommended, but not strictly necessary—

0:02:44.475,0:02:46.597
and we certainly don’t require it,

0:02:46.597,0:02:48.719
and we give you the background as we go—

0:02:48.719,0:02:52.290
is a little bit of experience, perhaps, in machine learning,

0:02:52.290,0:02:55.367
maybe some simple optimization like gradient descent,

0:02:55.367,0:02:57.445
nothing very sophisticated.

0:02:57.445,0:03:01.483
And it would be helpful to have some experience programming in Matlab or Octave,

0:03:01.483,0:03:04.364
although, here also, we have some introductory modules

0:03:04.364,0:03:08.337
that help you learn this programming language if you haven’t played around with it before.

0:03:10.044,0:03:12.482
A few other issues that are worth noting:

0:03:12.482,0:03:14.552
This class has an honor code.

0:03:14.552,0:03:19.017
This is the norm also for our local Stanford students when they’re taking a Stanford class.

0:03:19.017,0:03:22.836
The honor code here says that you’re allowed to discuss the material,

0:03:22.836,0:03:26.583
in fact even encouraged to discuss the material with your fellow classmates.

0:03:26.583,0:03:30.809
You can even ask clarifying questions about the problems sets and the programming assignments.

0:03:30.809,0:03:32.991
But what you turn in has to be your own work.

0:03:32.991,0:03:39.537
Furthermore, we request that you do not post either the programming assignments

0:03:39.537,0:03:41.711
or their solutions anywhere on the web,

0:03:41.711,0:03:44.601
so that future generations of students can do

0:03:44.601,0:03:48.447
the problems sets and the programming assignments independently as well.

0:03:48.447,0:03:52.359
A second issue to keep in mind is that of time management.

0:03:52.359,0:03:54.375
This is a graduate-level Stanford class

0:03:54.375,0:03:56.863
and it’s considered a difficult one even at Stanford.

0:03:56.863,0:03:59.146
A typical Stanford student can easily spend

0:03:59.146,0:04:01.073
ten to fifteen hours a week on this class,

0:04:01.073,0:04:02.904
and so we would suggest that you budget

0:04:02.904,0:04:05.791
at least that amount of time for your own efforts on this class

0:04:05.791,0:04:08.299
if you don’t want to find yourself running out of time

0:04:08.299,0:04:10.375
when a submission deadline comes around.

0:04:10.375,0:04:13.341
We’ve built in a little slack into the submission deadline,

0:04:13.341,0:04:17.655
so if you don’t manage to submit by the original deadline,

0:04:17.655,0:04:19.362
you have a week’s worth of grace period.

0:04:19.362,0:04:22.975
But then that obviously starts to impinge on the next week’s problem set.

0:04:22.975,0:04:25.439
So we advise that you don’t just keep

0:04:25.439,0:04:28.511
a backlog of assignments throughout the course,

0:04:28.511,0:04:31.482
because it will all end up coming back to bite you in the end.

0:04:32.021,0:04:36.347
Finally, part of the experience of this class

0:04:36.347,0:04:38.591
is interacting with your fellow students,

0:04:38.591,0:04:41.447
so for that purpose we have the discussion forum

0:04:41.447,0:04:43.269
which has proven in other classes

0:04:43.269,0:04:46.527
to be an invaluable resource for interacting with other students,

0:04:46.527,0:04:49.783
asking questions and obtaining a deeper understanding of the material.

0:04:49.783,0:04:52.412
We’re also encouraging you to form study groups—

0:04:52.412,0:04:55.892
these can be physical study groups with people in the same geographical region,

0:04:55.892,0:05:00.280
or online study groups where you can just discuss the material with each other.

0:05:00.280,0:05:01.839
We believe that doing this

0:05:01.839,0:05:03.933
will give you a much better understanding of the material

0:05:03.933,0:05:06.832
and will make the course considerably more fun as well.

0:05:06.832,0:05:09.368
So, to summarize,

0:05:09.368,0:05:14.999
through all these different pieces of the content and the exercises,

0:05:14.999,0:05:17.831
we think that you’ll learn fundamental methods

0:05:17.831,0:05:19.880
in this area of probabilistic graphical models.

0:05:19.880,0:05:22.342
You’ll also get to see and play around with

0:05:22.342,0:05:25.872
a range of real-world applications for which these methods have been applied

0:05:25.872,0:05:29.346
and hopefully you will leave this class with an understanding

0:05:29.346,0:05:32.314
of how to take these ideas and use them in your own work

0:05:32.314,0:05:33.875
in problems that you care about.

0:05:33.875,9:59:59.000
We look forward to seeing you in this class.