Topic 1 built the ERM recipe around a regression target — a real number. Most quant classification problems — will this bond default, is this a fraudulent trade, will this options position expire in the money — have a discrete target instead, and squared-error loss is the wrong tool for it. This topic swaps the hypothesis class and loss for classification: logistic regression as the discriminative workhorse, its Newton's-method optimiser, the perceptron and softmax for multi-class problems, the generalized linear model (GLM) framework that shows linear and logistic regression are the same algorithm applied to different output distributions, generative classifiers (Gaussian discriminant analysis, naive Bayes) as the alternative modelling philosophy, and the evaluation metrics — precision, recall, ROC/AUC — that a squared-error test-set score cannot supply for a classifier.
By the end of this topic you should be able to:
- derive the logistic-regression log-likelihood and its gradient/Newton updates;
- explain the perceptron update rule and extend logistic regression to classes via softmax;
- construct a GLM from an exponential-family distribution and recover linear/logistic regression as special cases;
- fit and compare a generative classifier (GDA or naive Bayes) against a discriminative one;
- read a confusion matrix, precision/recall trade-off, and ROC curve.
In this lesson
- Contents
- The big picture
The full lesson is for members.
Read the full lessonNew to SelfMadeQuant.com? See membership options or browse the Financial Machine Learning syllabus.