Coordinate Descent slide.pdf

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

Coordinate descent Geoff Gordon Ryan Tibshirani Optimization 10-725 / 36-725 1 Adding to the toolbox, with stats and ML in mind We’ve seen several general and useful minimization tools ? First-order methods ? Newton’s method ? Dual methods ? Interior-point methods These are some of the core methods in optimization, and they are the main objects of study in this field In statistics and machine learning, there are a few other techniques that have received a lot of attention; these are not studied as much by those purely in optimization They don’t apply as broadly as above methods, but are interesting and useful when they do apply ... our focus for the next 2 lectures 2 Coordinate-wise minimization We’ve seen (and will continue to see) some pretty sophisticated methods. Today, we’ll see an extremely simple technique that is surprisingly efficient and scalable Focus is on coordinate-wise minimization Q: Given convex, differentiable f : Rn → R, if we are at a point x such that f(x) is minimized along each coordinate axis, have we found a global minimizer? I.e., does f(x+ d · ei) ≥ f(x) for all d, i ? f(x) = minz f(z)? (Here ei = (0, . . . , 1, . . . 0) ∈ Rn, the ith standard basis vector) 3 x1 x2 f A: Yes! Proof: ?f(x) = ( ?f ?x1 (x), . . . ?f ?xn (x) ) = 0 Q: Same question, but for f convex (not differentiable) ... ? 4 x1 x 2 f x1 x 2 ?4 ?2 0 2 4 ? 4 ? 2 0 2 4 ● A: No! Look at the above counterexample Q: Same question again, but now f(x) = g(x) + ∑n i=1 hi(xi), with g convex, differentiable and each hi convex ... ? (Non-smooth part here called separable) 5 x1 x 2 f x1 x 2 ?4 ?2 0 2 4 ? 4 ? 2 0 2 4 ● A: Yes! Proof: for any y, f(y)? f(x) ≥ ?g(x)T (y ? x) + n∑ i=1 [hi(yi)? hi(xi)] = n∑ i=1 [?ig(x)(yi ? xi) + hi(yi)? hi(xi)]︸ ︷︷ ︸ ≥0 ≥ 0 6 Coordinate descent This suggests that for f(x) = g(x) + ∑n i=1 hi(xi) (with g convex, differentiable and each hi convex) we can use coordinate descent to find a minimizer: start with some initial guess x(0), and repeat for k = 1, 2, 3, .

文档评论(0)

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

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

1亿VIP精品文档

相关文档