I knew the mechanics but fumbled the explanation.
Start by defining maximum likelihood estimation (MLE) as the principle of choosing parameters that maximize the probability of the observed data. Then show that for binary classification, maximizing the likelihood is equivalent to minimizing the negative log-likelihood, which is exactly the log-loss function used in logistic regression. Conclude by highlighting that this connection ensures logistic regression is a probabilistic model with well-calibrated outputs.
Pro tip: Emphasize that the log-loss is not just a convenient choice but a direct consequence of MLE under the Bernoulli assumption, and mention that this leads to desirable properties like consistency and asymptotic normality of the parameter estimates.
Explain MLE as a method to estimate parameters by maximizing the likelihood function, which measures how well the model explains the observed data.
Describe how logistic regression models the probability of the positive class as a sigmoid function of the linear combination of inputs.
For each data point, the likelihood is p if y=1 and 1-p if y=0, which can be written compactly as p^y * (1-p)^(1-y).
Taking the log and negating gives the negative log-likelihood, which is the sum of -[y log(p) + (1-y) log(1-p)] over all points.
This negative log-likelihood is exactly the log-loss (or cross-entropy) function, so minimizing log-loss is equivalent to maximizing likelihood.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.