Non convex optimization for machine learning1 prateek jain microsoft research india prajainmicrosoftcom purushottam kar this monograph presents a selection of recent advances that bridge a long standing gap prateekjainbangaloreindia purushottamkarkanpurindia december212017 5. Suvrit sra mlmitedu trends in nonconvex optimization simons inst berkeley nonconvex problems are 2 nonconvex optimization problem with simple constraints question is global min of this problem 0 or not min x i a i z i s 2 x i z i 1 z i st 0 z. Provable alternating minimization methods for non convex optimization prateek jain microsoft research india joint work with praneeth netrapalli sujay sanghavi alekh agarwal animashree. Non convex optimization is now ubiquitous in machine learning while previously the focus was on convex relaxation methods now the emphasis is on being able to solve non convex problems directly it is not possible to find the global optimum of. Non convex optimization for machine learning can be used for a semester length course on the basics of non convex optimization with applications to machine learning on the other hand it is also possible to cherry pick individual portions such the chapter on sparse recovery or the em algorithm for inclusion in a broader course
How it works:
1. Register a Free 1 month Trial Account.
2. Download as many books as you like ( Personal use )
3. No Commitment. Cancel anytime.
4. Join Over 100.000 Happy Readers.
5. That's it. What you waiting for? Sign Up and Get Your Books.