1 / 7

Regularization in Machine Learning

https://nixustechnologies.com/regularization-in-machine-learning/

ayushii12
Download Presentation

Regularization in Machine Learning

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Regularization in Machine Learning Machine learning is, without doubt, a valuable skill set to learn. While one might have a thorough understanding of algorithms, it is also important to learn concepts that aid our models’ accuracy and efficiency. Regularization is one of the core topics in machine learning. It helps prevent the model from risk of overfitting. It does this by providing the model with more data. let’s learn more about Regularization in Machine Learning. What is Regularization? Regularization is a strategy that prevents overfitting by providing new knowledge to the machine learning algorithm. It is a type of regression. But here, the coefficient values are reduced to zero. In layman’s terms, “the Regularization approach reduces the size of the independent factors while maintaining the same number of variables.” It keeps the model ‘s efficiency as well as its applicability. Why Regularization? It is not uncommon for our model to function well enough on training data but poorly on unseen or test data. It signifies that the model is unable to forecast the output for unknown data by generating noise in the output, and so the model is referred to as an overfitted model. What is noise?

  2. Noise is the points in the data that are there by accident. They do not show the true nature of the data and can mislead models. So, to address the issue of overfitting, we employ regularization approaches. What is Overfitting in Machine Learning? Overfitting occurs when a model learns the information and noise in the training data to the point that it severely impairs the model’s performance on fresh data. This implies that the model picks up on noise or random oscillations in the training data and learns them as ideas. The issue is that these notions do not apply to fresh data and have a detrimental influence on the models’ capacity to generalize. If a model is overfitting, its accuracy will be reduced. This occurs when your model is attempting to capture the noise in your training dataset much too aggressively. By noise, we mean data points that aren’t truly representative of your data’s underlying qualities, but are instead random chance. Learning such data points makes your model more adaptable, but it also increases the danger of overfitting. Understanding the phenomena of overfitting is aided by the idea of balancing bias and variance. Working of ML Regularization Regularization works by introducing a cost, complexity factor, or shrinkage factor into the complicated model and calculating the Residual Sum of Squares (RSS). Consider the following Simple linear regression equation: The learnt relation is represented by Y, which denotes the dependent characteristic or action. Our optimization function or loss function in basic linear regression is known as the residual sum of squares (RSS). We select the set of coefficients that minimizes the following loss function:

  3. Types of Machine Learning Regularization: Regularization is a strategy for reducing mistakes and avoiding overfitting by fitting the function suitably on the supplied training set. Below, we list some of the popular regularization methods: ■ Regularization on the first level ■ Regularization on the second level ■ L1 and L2 regularization ■ Regularization of dropouts 1. LASSO Regression This is a regression model that employs the L1 Regularization approach. Lasso regression is a linear regression technique that employs shrinkage. Shrinkage is the process by which data values are shrunk towards a central point, such as the mean. The lasso method promotes basic, sparse models (i.e. models with fewer parameters). This form of regression is ideal for models with high degrees of multicollinearity or when you wish to automate certain aspects of model selection, such as variable selection/parameter removal. LASSO is an acronym that stands for Least Absolute Shrinkage and Selection Operator. Lasso Regression’s Limitations: ■ Issues with Certain Datasets: If the number of variables exceeds the number of observations, Lasso will choose at most n variables as non-zero, even if all variables are important.

  4. ■ Multicollinearity Issue: If there are more than one highly collinear variables, LASSO regression chooses one at random, which is not ideal for interpreting our model. Lasso Regression’s Applications: ■ Lasso algorithms are used to build and evaluate economic networks.The interconnection between two banking firms or network nodes in an array of investment networks. ■ A retail store management may assume that increasing the operating hours will significantly enhance sales. However, RA may imply that the increase in income may not be sufficient to offset the increases in operational expenditures as a result of working long hours (such as additional employee labor charges). As a result, this analysis can give quantitative backing for choices and help to avoid mistakes caused by managers’ intuitions.’ 2. Ridge Regression Ridge regression is one of the varieties of linear regression that uses the L2 regularization approach. It introduces a little amount of bias to improve long-term predictions. Ridge regression is a model regularization approach that reduces the model’s complexity. We introduce a penalty term into the cost function. Ridge Regression penalty measures the degree of bias introduced (i.e) how much more biased the model will be. We may determine it by increasing the squared weight of each individual feature by the lambda. Ridge Regression Application: When we have control variables with severe collinearity between them, ordinary linear or polynomial regression would struggle, hence Ridge regression can be employed to tackle such situations.

  5. Ridge regression can assist us address difficulties when we have greater parameters than samples. Ridge Regression’s Limitation: ■ Feature Selection: It does not aid in feature selection since it reduces the complexity of a model but does not lower the number of independent variables. It never leads to a coefficient being zero but merely minimizes it. As a result, this strategy is ineffective for feature selection. ■ Model Interpretability: Its downside is model interpretability since it shrinks the coefficients for the least significant variables to very near to zero, yet it works. Difference between Lasso and Ridge Regression Ridge regression allows us to remove just the overfitting in the model while retaining all of the model’s characteristics. It minimizes the model’s sophistication by lowering the coefficients, whereas Lasso regression aids in the reduction of overfitting in the model as well as automated feature selection. Lasso regression tends to set coefficient values to absolute zero, whereas Ridge regression never does. What does regularization achieve? The basic least-squares approach in simple linear regression has considerable variance, which means that it will not transfer well to a new set of data that is different from its training examples. Regularization attempts to lower the variance of the model without significantly increasing the bias.

  6. Mathematical Formulation of Regression: We are now attempting to formalize these strategies mathematically. As a result, these strategies may be thought of as resolving an equation. The total sum of squares of the values in ridge regression is less than or equal to s, while the total sum of mod of the coefficients in Lasso regression is less than or equal to s. In this case, s is a constant that exists for every value of the shrinkage factor. These are also referred to as constraint variables. Ridge Regression: Because ridge regression has a round boundary with no sharp edges, the overlap with the ellipse will not typically appear on the axis, hence the ridge regression coefficient values will be primarily non-zero. The ridge regression is represented by the given mathematical equation. This means that ridge regression coefficients have the minimum RSS (loss function) for all sites inside the circle defined by said equation. Lasso Regression: Lasso regression features a diamond-shaped constraint area with corners at each intersection. The equation is represented by the above mathematical formulation. This means that the lasso regression coefficients have the least RSS (loss function) for all points within the diamond.. Summary

  7. A conventional least squares model has some variation, which means it won’t generalize well to data sets other than its training data. Regularization greatly decreases the model’s variance without significantly increasing its bias. This is all the fundamental information you’ll need to get started with Regularization. It is a handy strategy for increasing the accuracy of your regression models. Scikit-Learn is a useful package for executing these methods. It features a fantastic API that will have your models fully operational with only a few lines of Python code.

More Related