1. Logistic
Regression
Classification
Machine Learning

2. Classification
Spam / Not Spam?
Online Transactions: Fraudulent (Yes / No)?
Tumor: Malignant / Benign ?
0: “Negative Class” (e.g., benign tumor)
1: “Positive Class” (e.g., malignant tumor)

3. Threshold classifier output at 0.5:
(Yes) 1
Malignant ?
(No) 0
Tumor Size
Tumor Size
Threshold classifier output at 0.5:
If , predict “y = 1”
If , predict “y = 0”

4. Classification: y = or 1
can be > 1 or < 0
Logistic Regression:

5. Hypothesis Representation
Logistic
Regression
Hypothesis Representation
Machine Learning

6. Sigmoid function Logistic function Logistic Regression Model Want 1
0.5
Sigmoid function
Logistic function

7. Interpretation of Hypothesis Output
= estimated probability that y = 1 on input x
Example: If
Tell patient that 70% chance of tumor being malignant
“probability that y = 1, given x,
parameterized by ”

8. Logistic
Regression
Decision boundary
Machine Learning

9. Logistic regression z 1
Suppose predict “ “ if
predict “ “ if

10. Decision Boundary x2 3 2 1 1 2 3 x1
Predict “ “ if

11. Non-linear decision boundariesx2 1 x1 -1 1 -1
Predict “ “ if x2 x1

12. Logistic
Regression
Cost function
Machine Learning

13. Training set:
m examples
How to choose parameters ?

14. Cost function
Linear regression:
“non-convex”
“convex”

15. Logistic regression cost function
If y = 1 1

16. Logistic regression cost function
If y = 0 1

17. Simplified cost function and gradient descent
Logistic
Regression
Simplified cost function and gradient descent
Machine Learning

18. Logistic regression cost function

19. Logistic regression cost function
To fit parameters :
To make a prediction given new :
Output

20. Gradient Descent
Want :
Repeat
(simultaneously update all )

21. Algorithm looks identical to linear regression!
Gradient Descent
Want :
Repeat
(simultaneously update all )
Algorithm looks identical to linear regression!

22. Advanced optimization
Logistic
Regression
Advanced optimization
Machine Learning

23. Optimization algorithm
Cost function Want
Given , we have code that can compute
(for )
Gradient descent:
Repeat

24. Optimization algorithm
Given , we have code that can compute
(for )
Optimization algorithms:
Gradient descent
Advantages:
No need to manually pick
Often faster than gradient descent.
Disadvantages:
More complex
Conjugate gradient
BFGS
L-BFGS

25. Example: function [jVal, gradient] = costFunction(theta)
jVal = (theta(1)-5)^ (theta(2)-5)^2;
gradient = zeros(2,1);
gradient(1) = 2*(theta(1)-5); gradient(2) = 2*(theta(2)-5);
options = optimset(‘GradObj’, ‘on’, ‘MaxIter’, ‘100’);
initialTheta = zeros(2,1); [optTheta, functionVal, exitFlag] ...
= initialTheta, options);

26. code to compute code to compute code to compute code to compute
theta =
function [jVal, gradient] = costFunction(theta)
jVal = [ ];
code to compute
gradient(1) = [ ];
code to compute
gradient(2) = [ ];
code to compute
gradient(n+1) = [ ];
code to compute

27. Multi-class classification: One-vs-all
Logistic
Regression
Multi-class classification: One-vs-all
Machine Learning

28. Multiclass classification
foldering/tagging: Work, Friends, Family, Hobby
Medical diagrams: Not ill, Cold, Flu
Weather: Sunny, Cloudy, Rain, Snow

29. Binary classification:
Multi-class classification: x1 x2 x2 x1

30. One-vs-all (one-vs-rest):x2
One-vs-all (one-vs-rest): x1 x2 x2 x1 x1 x2
Class 1:
Class 2:
Class 3: x1

31. One-vs-all
Train a logistic regression classifier for each class to predict the probability that
On a new input , to make a prediction, pick the class that maximizes