Maximum likelihood estimation: Difference between revisions

From Rice Wiki
Line 25: Line 25:


== Loss function ==
== Loss function ==
In line with gradient descent, we can come up with the loss function of MLE by taking the negative of the likelihood function.
Instead of maximizing the likelihood function, we can minimize the negative of the likelihood function. This way, we can just use OLS.
[[Category:Machine Learning]]
[[Category:Machine Learning]]

Revision as of 00:51, 26 April 2024

Maximum likelihood estimation (MLE) is one of the methods to find the coefficients of a model that minimizes the RSS in linear regression. MLE does this by maximizing the likelihood of observing the training data given a model.

Background

Consider objective function

where is the true relationship and is the residual error/noise

We assume that , y values are independent of each other, and

Likelihood function

The likelihood function determines the likelihood of observing the data given the parameters of the model. A high likelihood indicates a good model.

The likelihood of observing the data is the product of observing each data point, given by the probability density function of standard distribution.

The weights are then changed to fit it better, and the process repeats.

Optimizations with log

Multiplication of many large numbers is computationally expensive. To optimize, the log of the likelihood function is computed. Since log of multiplied values is the sum of log of each value, we simplify the above down to

Loss function

Instead of maximizing the likelihood function, we can minimize the negative of the likelihood function. This way, we can just use OLS.