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 > Foundation AI > Tackling Unknown Connectivity: Latent Graph and Latent Topology Inference and its Applications
Tackling Unknown Connectivity: Latent Graph and Latent Topology Inference and its ApplicationsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Pietro Lio. This talk has been canceled/deleted Graph data, like any other type of data, is susceptible to imperfections. Specifically, edge sets may contain various issues, such as noise and incompleteness, which have been extensively studied. However, in extreme scenarios, the edge set may be entirely unknown, implying the impossibility of applying graph neural networks. The problem of unknown connectivity can be framed from the perspective that any type of data has an underlying graph topology that can be learned to boost the performance of downstream tasks. This talk is part of the Foundation AI series. This talk is included in these lists:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsGut feeling: how bacteria influence our wellbeing quan ao tre em Cambridge Science Festival - Big Data: The missing linkOther talksUnderstanding cell alignment: from two interacting cells to collective behaviour From mazes to meadows: understanding movement through spatial cognition Epithelial tissue as an Active Solid Constraints on DM and the cusp/core problem with MUSE Everything Everywhere All at Once: Holographic Entropy Inequalities, the Topology of Error Correction, Black Holes, Cubohemioctahedron, and (maybe) the Toric Code |