There are many ways to classify machine learning algorithms: supervised/unsupervised, regression/classification,… **.** For myself, I prefer to distinguish between **Discriminative ****model **and **Generative model. **In this article, I will discuss the relationship between these 2 families, using Gaussian Discriminant Analysis and Logistic Regression as example.

Quick review: Discriminative methods model . In classification task, these models **search a hyperplane (a decision boundary) seperating different classes**. The majority of popular algorithms belongs to this family: logistic regression, svm, neural net, … On the other hand, Generative methods model (and ). This means that it will give us** a probability distribution for each class** in the classification problem. This give us an idea of how the data is generated. This type of model relies heavily on Bayes rule to update the prior and derive the posterior. Some well-known examples are Naive Bayes, Gaussian Discriminant Analysis, …

There are quite some reasons why discriminative models are more popular among machine learning practitioner: they are more flexible, more robust and less sensitive to incorrect modeling assumptions. Generative models, on the other hand, require us to define the distribution of our prior, which can be quite challenging for many situations. However, this is also their advantage: they have more “information” about the data than discriminative model, and thus can perform quite well with limited data if the assumption is correct.

In this article, I will demonstrate the point above by proving that Gaussian Discriminant Analysis (GDA) will eventually lead to Logistic Regression, and thus Logistic Regression is more “general”.

For binary classification, GDA assumes that the prior follows a Bernoulli distribution and the likelihood follows a multivariate Gaussian distribution:

Let’s write down their mathematical formula:

As mentioned above, the discriminative model (here is the logistic regression) try to find , so what we try to prove is that:

which is the **sigmoid function **of logistic regression, where is some function of of .

Ok let’s roll up our sleeves and do some maths:

This equation seems very much like what we are look for, let’s take a closer look at the fraction :

In the last equation, we add so that we can have the desired form . The former equation is then:

And there it is, we just proved that the result of a Gaussian Discriminant Analysis is indeed a Logistic Regression, our vector is:

The converse, is not true though: being a logistic function does not imply is mutlivariate gaussian. This observation shows us that GDA has a much stronger assumption than Logistic Regression. In fact, we can go 1 step further and prove that *if belongs to any member of the Exponential Family (Gaussian, Poisson, …), its posterior is a logistc regression. *We see now a reason why Logistic Regression is widely used: it is a very general, robust algorithm that works for many underlying assumptions. GDA (and Generative models in general), in the other hand, makes much stronger assumption, and thus is not ideal for non-Gaussian or some-crazy-undefined-distribution data

*.*

*(The problem of GDA, or generative model, can be solved with a class of Bayesian Machine Learning that uses Markov Chain Monte Carlo to sample data from their posterior distribution. This is a very exciting method that I’m really into, so I will save it for a future post.)*