Finding stationary points on the bounded-rank variety: a geometric hurdle and a smooth workaround

Add to your list(s) Download to your calendar using vCal

• Nicolas Boumal (EPFL)
• Wednesday 05 May 2021, 14:00-15:00
• Online (Join Zoom Meeting https://us02web.zoom.us/j/81608191565?pwd=RDR2Uk1pU1Y3bHdZV3Q0SFlWdVYzdz09).

If you have a question about this talk, please contact Hamza Fawzi.

The set of matrices of a certain size and rank is a smooth manifold. Unfortunately, it is not closed: this is uncomfortable for optimization. The closure of that manifold, namely, the set of matrices with bounded rank, is an algebraic variety but it is not smooth. That also is uncomfortable for optimization. Case in point, the norm of the (projected) gradient of the cost function can go to zero along a sequence even if the limit point of the sequence is not stationary. This can trick algorithms. I will characterize the geometry of this phenomenon. Then, I will discuss how lifting the problem to a smooth manifold makes it possible to converge to stationary points with certainty under mild conditions.

Joint work with Eitan Levin (CalTech) and Joe Kileel (UT Austin).

This talk is part of the CCIMI Seminars series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CCIMI
• CCIMI Seminars
• CMS Events
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• Online (Join Zoom Meeting https://us02web.zoom.us/j/81608191565?pwd=RDR2Uk1pU1Y3bHdZV3Q0SFlWdVYzdz09)
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31
• custom
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.