Professional Documents
Culture Documents
Sanja Fidler
University of Toronto
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 1 / 37
Today
Administration details
Why is machine learning so cool?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 2 / 37
The Team
Instructor:
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 3 / 37
Admin Details
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 4 / 37
Course Information
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 5 / 37
Textbook(s)
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 6 / 37
Textbook(s)
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 6 / 37
Requirements
Do the readings!
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 7 / 37
Requirements
Do the readings!
Assignments:
I Three assignments, first two worth 12.5% each, last one worth 15%,
for a total of 40%
I Programming: take Matlab/Python code and extend it
I Derivations: pen(cil)-and-paper
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 7 / 37
Requirements
Do the readings!
Assignments:
I Three assignments, first two worth 12.5% each, last one worth 15%,
for a total of 40%
I Programming: take Matlab/Python code and extend it
I Derivations: pen(cil)-and-paper
Mid-term:
I One hour exam on Feb 29th
I Worth 25% of course mark
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 7 / 37
Requirements
Do the readings!
Assignments:
I Three assignments, first two worth 12.5% each, last one worth 15%,
for a total of 40%
I Programming: take Matlab/Python code and extend it
I Derivations: pen(cil)-and-paper
Mid-term:
I One hour exam on Feb 29th
I Worth 25% of course mark
Final:
I Focused on second half of course
I Worth 35% of course mark
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 7 / 37
More on Assigments
Collaboration on the assignments is not allowed. Each student is responsible
for his/her own work. Discussion of assignments should be limited to
clarification of the handout itself, and should not involve any sharing of
pseudocode or code or simulation results. Violation of this policy is grounds
for a semester grade of F, in accordance with university regulations.
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 8 / 37
More on Assigments
Collaboration on the assignments is not allowed. Each student is responsible
for his/her own work. Discussion of assignments should be limited to
clarification of the handout itself, and should not involve any sharing of
pseudocode or code or simulation results. Violation of this policy is grounds
for a semester grade of F, in accordance with university regulations.
The schedule of assignments is included in the syllabus. Assignments are
due at the beginning of class/tutorial on the due date.
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 8 / 37
More on Assigments
Collaboration on the assignments is not allowed. Each student is responsible
for his/her own work. Discussion of assignments should be limited to
clarification of the handout itself, and should not involve any sharing of
pseudocode or code or simulation results. Violation of this policy is grounds
for a semester grade of F, in accordance with university regulations.
The schedule of assignments is included in the syllabus. Assignments are
due at the beginning of class/tutorial on the due date.
Assignments handed in late but before 5 pm of that day will be penalized by
5% (i.e., total points multiplied by 0.95); a late penalty of 10% per day will
be assessed thereafter.
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 8 / 37
More on Assigments
Collaboration on the assignments is not allowed. Each student is responsible
for his/her own work. Discussion of assignments should be limited to
clarification of the handout itself, and should not involve any sharing of
pseudocode or code or simulation results. Violation of this policy is grounds
for a semester grade of F, in accordance with university regulations.
The schedule of assignments is included in the syllabus. Assignments are
due at the beginning of class/tutorial on the due date.
Assignments handed in late but before 5 pm of that day will be penalized by
5% (i.e., total points multiplied by 0.95); a late penalty of 10% per day will
be assessed thereafter.
Extensions will be granted only in special situations, and you will need a
Student Medical Certificate or a written request approved by the instructor
at least one week before the due date.
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 8 / 37
More on Assigments
Collaboration on the assignments is not allowed. Each student is responsible
for his/her own work. Discussion of assignments should be limited to
clarification of the handout itself, and should not involve any sharing of
pseudocode or code or simulation results. Violation of this policy is grounds
for a semester grade of F, in accordance with university regulations.
The schedule of assignments is included in the syllabus. Assignments are
due at the beginning of class/tutorial on the due date.
Assignments handed in late but before 5 pm of that day will be penalized by
5% (i.e., total points multiplied by 0.95); a late penalty of 10% per day will
be assessed thereafter.
Extensions will be granted only in special situations, and you will need a
Student Medical Certificate or a written request approved by the instructor
at least one week before the due date.
Final assignment is a bake-off: competition between ML algorithms. We will
give you some data for training a ML system, and you will try to develop the
best method. We will then determine which system performs best on unseen
test data.
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 8 / 37
Calendar
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 9 / 37
What is Machine Learning?
How can we solve a specific problem?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 10 / 37
What is Machine Learning?
How can we solve a specific problem?
I As computer scientists we write a program that encodes a set of rules
that are useful to solve the problem
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 10 / 37
What is Machine Learning?
How can we solve a specific problem?
I As computer scientists we write a program that encodes a set of rules
that are useful to solve the problem
I In many cases is very difficult to specify those rules, e.g., given a
picture determine whether there is a cat in the image
Learning systems are not directly programmed to solve a problem, instead
develop own program based on:
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 10 / 37
What is Machine Learning?
How can we solve a specific problem?
I As computer scientists we write a program that encodes a set of rules
that are useful to solve the problem
I In many cases is very difficult to specify those rules, e.g., given a
picture determine whether there is a cat in the image
Learning systems are not directly programmed to solve a problem, instead
develop own program based on:
I Examples of how they should behave
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 10 / 37
What is Machine Learning?
How can we solve a specific problem?
I As computer scientists we write a program that encodes a set of rules
that are useful to solve the problem
I In many cases is very difficult to specify those rules, e.g., given a
picture determine whether there is a cat in the image
Learning systems are not directly programmed to solve a problem, instead
develop own program based on:
I Examples of how they should behave
I From trial-and-error experience trying to solve the problem
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 10 / 37
What is Machine Learning?
How can we solve a specific problem?
I As computer scientists we write a program that encodes a set of rules
that are useful to solve the problem
I In many cases is very difficult to specify those rules, e.g., given a
picture determine whether there is a cat in the image
Learning systems are not directly programmed to solve a problem, instead
develop own program based on:
I Examples of how they should behave
I From trial-and-error experience trying to solve the problem
Different than standard CS:
I Want to implement unknown function, only have access to sample
input-output pairs (training examples)
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 10 / 37
What is Machine Learning?
How can we solve a specific problem?
I As computer scientists we write a program that encodes a set of rules
that are useful to solve the problem
I In many cases is very difficult to specify those rules, e.g., given a
picture determine whether there is a cat in the image
Learning systems are not directly programmed to solve a problem, instead
develop own program based on:
I Examples of how they should behave
I From trial-and-error experience trying to solve the problem
Different than standard CS:
I Want to implement unknown function, only have access to sample
input-output pairs (training examples)
Learning simply means incorporating information from the training examples
into the system
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 10 / 37
Tasks that requires machine learning: What makes a 2?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 11 / 37
Tasks that benefits from machine learning: cooking!
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 12 / 37
Why use learning?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 13 / 37
Why use learning?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 13 / 37
Why use learning?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 13 / 37
Why use learning?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 13 / 37
Why use learning?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 13 / 37
Why use learning?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 13 / 37
Why use learning?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 13 / 37
Learning algorithms are useful in many tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 14 / 37
Examples of Classification
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 15 / 37
Examples of Classification
Is this a dog?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 15 / 37
Examples of Classification
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 15 / 37
Examples of Classification
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 15 / 37
Examples of Classification
Do I have diabetes?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 15 / 37
Learning algorithms are useful in many tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 16 / 37
Examples of Recognizing patterns
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 17 / 37
Learning algorithms are useful in other tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 18 / 37
Examples of Recommendation systems
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 19 / 37
Examples of Recommendation systems
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 19 / 37
Examples of Recommendation systems
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 19 / 37
Learning algorithms are useful in other tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 20 / 37
Examples of Information Retrieval
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 21 / 37
Examples of Information Retrieval
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 21 / 37
Examples of Information Retrieval
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 21 / 37
Examples of Information Retrieval
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 21 / 37
Learning algorithms are useful in other tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 22 / 37
Computer Vision
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 23 / 37
Computer Vision
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 23 / 37
Computer Vision
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 23 / 37
Learning algorithms are useful in other tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 24 / 37
Autonomous Driving
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 25 / 37
Flying Robots
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 26 / 37
Learning algorithms are useful in other tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 27 / 37
Playing Games: Atari
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 30 / 37
Learning algorithms are useful in other tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 30 / 37
Learning algorithms are useful in other tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 30 / 37
Human Learning
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 31 / 37
Types of learning tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Types of learning tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Types of learning tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Types of learning tasks
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Types of learning tasks
Unsupervised learning
I Create an internal representation of the input, capturing
regularities/structure in data
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Types of learning tasks
Unsupervised learning
I Create an internal representation of the input, capturing
regularities/structure in data
I Examples: form clusters; extract features
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Types of learning tasks
Unsupervised learning
I Create an internal representation of the input, capturing
regularities/structure in data
I Examples: form clusters; extract features
I How do we know if a representation is good?
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Types of learning tasks
Unsupervised learning
I Create an internal representation of the input, capturing
regularities/structure in data
I Examples: form clusters; extract features
I How do we know if a representation is good?
Reinforcement learning
I Learn action to maximize payoff
I Not much information in a payoff signal
I Payoff is often delayed
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 32 / 37
Machine Learning vs Data Mining
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 33 / 37
Machine Learning vs Data Mining
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 33 / 37
Machine Learning vs Data Mining
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 33 / 37
Machine Learning vs Data Mining
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 33 / 37
Machine Learning vs Statistics
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 34 / 37
Machine Learning vs Statistics
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 34 / 37
Machine Learning vs Statistics
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 34 / 37
Machine Learning vs Statistics
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 34 / 37
Machine Learning vs Statistics
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 34 / 37
Cultural gap (Tibshirani)
MACHINE LEARNING STATISTICS
weights parameters
learning fitting
generalization test set performance
supervised learning regression/classification
unsupervised learning density estimation, clustering
large grant: $1,000,000 large grant: $50,000
conference location: conference location: Las Vegas in
Snowbird, French Alps August
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 35 / 37
Course Survey
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 36 / 37
Initial Case Study
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 37 / 37
Initial Case Study
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 37 / 37
Initial Case Study
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 37 / 37
Initial Case Study
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 37 / 37
Initial Case Study
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 37 / 37
Initial Case Study
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 37 / 37
Initial Case Study
Urtasun, Zemel, Fidler (UofT) CSC 411: 01-Introduction Jan 11, 2016 37 / 37