University of Cambridge > Talks.cam > Machine Learning @ CUED > Matrix Means, Distances, Kernels, and Geometric Optimization

  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

Matrix Means, Distances, Kernels, and Geometric Optimization

Download to your calendar using vCal

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

I will talk about a new distance function on hermitian positive definite (hpd) matrices that takes inspiration from both differential geometry and convex optimization. This distance function originally arose in a computer-vision application, but since then it took on a life of its own that is interesting enough to talk about.

In my talk, I will briefly describe the original application, followed by key results and wider mathematical connections of this distance function, e.g., to the theory of kernel functions on symmetric spaces; matrix theory; nonlinear matrix equations; symmetric polynomials in noncommutative variables, quantum information theory, and the expanding area of geometric optimization with hpd matrices. I will also mention a few challenging open problems.

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

Free Essay Writer MR4 (aka AL08), Mathematical Sciences, Centre for indoxxi

Other talks

Carrollian momenta from anti de Sitter Mergers all the way down: simulating the origin of globular clusters in a galactic context Title to be confirmed: CMS Title TBC Title TBC Group Presentation 5
 

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