University of Cambridge > Talks.cam > Machine Learning @ CUED > Multiresolution Matrix Factorization

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Multiresolution Matrix Factorization

Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani .

The sheer size of today’s datasets dictates that learning algorithms compress or reduce their input data and/or make use of parallelism. Multiresolution Matrix Factorization (MMF) makes a connection between such computational strategies and some classical themes in Applied Mathematics, namely Multiresolution Analysis and Multigrid Methods. In particular, the similarity matrices appearing in data often have multiresolution structure, which can be exploited both for learning and to facilitate computation. In addition to the general MMF framework, I will present our new, high performance parallel MMF software library and show some results on matrix compression/sketching tasks (joint work with Nedelina Teneva, Pramod Mudrakarta and Vikas Garg).

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Tips That Any College Student Must Have Average on weekdays: 8980.17857143 kWh Department of German and Dutch

Other talks

Title TBC Ensemble inequivalence for systems with long-range interactions Group Work LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Group Work The organisational management of traumatic stress
 

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