University of Cambridge > Talks.cam > Applied and Computational Analysis > Fast algorithms for matrix completion and compressed sensing

  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

Fast algorithms for matrix completion and compressed sensing

Download to your calendar using vCal

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb .

Compressed sensing and matrix completion are techniques by which simplicity in data can be exploited for more efficient data acquisition. For instance, if a matrix is known to be (approximately) low rank then it can be recovered from few of its entries. The design and analysis of computationally efficient algorithms for these problems has been extensively studies over the last 8 years. In this talk we present new algorithms that balances low per iteration complexity with fast asymptotic convergence, allowing solutions to much larger problem sizes. These algorithms has been shown to have faster recovery time than any other known algorithm in the area, both for small scale problems and massively parallel GPU implementations.

This talk is part of the Applied and Computational Analysis series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar Room 3, Hauser Forum Open Cambridge Average on weekdays: 9209.36872146 kWh

Other talks

TBC In conversation: Louis Herns Marcelin and Ola Osman on legacies of enslavement and contemporary violence in Liberia and Haiti Title to be confirmed Morning Tea and Coffee CSAR lecture: Decarbonizing road freight (TBC) Title TBC
 

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