University of Cambridge > Talks.cam > Statistics > Sketchy decisions: Low-rank convex matrix optimization with optimal storage

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Sketchy decisions: Low-rank convex matrix optimization with optimal storage

Download to your calendar using vCal

  • UserJoel Tropp (Caltech)
  • ClockMonday 18 June 2018, 16:00-17:00
  • HouseMR12.

If you have a question about this talk, please contact Quentin Berthet .

Convex matrix optimization problems with low-rank solutions play a fundamental role in signal processing, statistics, and related disciplines. These problems are difficult to solve because of the cost of maintaining the matrix decision variable, even though the low-rank solution has few degrees of freedom. This talk presents an algorithm that provably solves these problems using optimal storage. The algorithm produces high-quality solutions to large problem instances that, previously, were intractable.

Joint work with Volkan Cevher, Roarke Horstmeyer, Quoc Tran-Dinh, Madeleine Udell, and Alp Yurtsever.

This talk is part of the Statistics series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Wolfson College, Gatsby Room. https://dtudk.zoom.us/j/63952790964 Lecture Theatre 1, Judge Business School (http://www.jbs.cam.ac.uk/aboutus/location.html)

Other talks

Caribbean Trip and Cacti Using Light for Cancer Detection Shining a light on the origin of supermassive black holes with cosmological simulations Title to be confirmed Group Work Harnessing Radical Reactivity for Molecular Innovation
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity