![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Optimal Transport for graph representation : from unsupervised learning to graph prediction
![]() Optimal Transport for graph representation : from unsupervised learning to graph predictionAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. RCLW01 - Uncertainty in multivariate, non-Euclidean, and functional spaces: theory and practice In recent years, the Optimal Transport (OT) based Gromov-Wasserstein (GW) divergence has been investigated as a similarity measure between structured data such as graphs seen as distributions typically lying in different metric spaces. In this talk, we discuss the optimization problem inherent in the computation of GW and some of its recent extensions, such as Entropic, Fused and semi-relaxed GW divergences. Next we will illustrate how these OT problems can be used in machine learning applications to learn graph representations for graph compression, clustering, classification and structured prediction. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsElectronics Knowledge Transfer Network IT Certifications ERC EquipoiseOther talksQBS The long quest for quantiles and ranks in $R^d$ and on manifolds Pancreatic cancer - the clinical challenge; Why the microenvironment matters during pancreatic cancer progression and treatment Notions of entropy in ergodic theory and representation theory Title TBC Loke CTR Annual Meeting 2025 - The Placenta at Term |