Outcomes of the equivalence of adaptive ridge with least absolute shrinkage.pdf

Outcomes of the equivalence of adaptive ridge with least absolute shrinkage.pdf

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Outcomes of the equivalence of adaptive ridge with least absolute shrinkage

Outcomes of the Equivalence of Adaptive Ridge with Least Absolute Shrinkage Yves Grandvalet Ste?phane Canu Heudiasyc, UMR CNRS 6599, Universite? de Technologie de Compie?gne, BP 20.529, 60205 Compie?gne cedex, France Yves.Grandvalet@hds.utc.fr Abstract Adaptive Ridge is a special form of Ridge regression, balancing the quadratic penalization on each parameter of the model. It was shown to be equivalent to Lasso (least absolute shrinkage and selection operator), in the sense that both procedures produce the same estimate. Lasso can thus be viewed as a particular quadratic penalizer. From this observation, we derive a fixed point algorithm to compute the Lasso solution. The analogy provides also a new hyper-parameter for tun- ing effectively the model complexity. We finally present a series of possi- ble extensions of lasso performing sparse regression in kernel smoothing, additive modeling and neural net training. 1 INTRODUCTION In supervised learning, we have a set of explicative variables x from which we wish to pre- dict a response variable y. To solve this problem, a learning algorithm is used to produce a predictor bf (x) from a learning set s` = f(xi; yi)gi?=1 of examples. The goal of prediction may be: 1) to provide an accurate prediction of future responses, accuracy being measured by a user-defined loss function; 2) to quantify the effect of each explicative variable in the response; 3) to better understand the underlying phenomenon. Penalization is extensively used in learning algorithms. It decreases the predictor variability to improve the prediction accuracy. It is also expected to produce models with few non-zero coefficients if interpretation is planned. Ridge regression and Subset Selection are the two main penalization procedures. The for- mer is stable, but does not shrink parameters to zero, the latter gives simple models, but is unstable [1]. These observations motivated the search for new penalization techniques such as Garrotte, Non-Negative Gar

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档