विधियों की तुलना करें

	बायेसियन LASSO प्रतिगमन	लासो रिग्रेशन
क्षेत्र	सांख्यिकी	मशीन अधिगम
परिवार	Regression model	Machine learning
उद्भव वर्ष	2008	1996
प्रवर्तक	Park & Casella	Tibshirani, R.
प्रकार	Bayesian regularized regression	Regularized linear regression (L1 penalty)
मौलिक स्रोत	Park, T., & Casella, G. (2008). The Bayesian Lasso. Journal of the American Statistical Association, 103(482), 681–686.	Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288.
उपनाम	Bayesian LASSO, Bayesian L1 regression, double-exponential prior regression, Laplace prior regression	LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization
संबंधित	5	4
सारांश	Bayesian LASSO regression places double-exponential (Laplace) priors on regression coefficients, which is the Bayesian analogue of the classical LASSO penalty. It simultaneously shrinks small coefficients toward zero and performs soft variable selection, all within a coherent posterior inference framework that naturally quantifies parameter uncertainty through credible intervals.	Lasso regression, introduced by Robert Tibshirani in 1996, is a linear regression method that adds an L1 penalty to the loss so that it shrinks coefficients and performs variable selection at the same time, producing a sparse model. By driving some coefficients exactly to zero it keeps only the predictors that matter.