University of Cambridge > > Artificial Intelligence Research Group Talks (Computer Laboratory) > Gaussian Processes on Graphs via Spectral Kernel Learning

Gaussian Processes on Graphs via Spectral Kernel Learning

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mateja Jamnik.

Join us on Zoom

I will go over topics on regularization, RKHS , and filtering on graphs. I will then show how I applied these methods to graph signal prediction through a graph spectrum-based Gaussian process. The model is designed to capture various graph signal structures through a highly adaptive kernel that incorporates a flexible polynomial function in the graph spectral domain. I will also present a bespoke maximum likelihood learning algorithm that enforces the positivity of the polynomial to achieve interpretability of filtering on graphs.

BIO : Yin-Cong Zhi is a fourth year DPhil student with Xiaowen Dong at the Oxford Man Institute. His focus is in graph signal processing and kernel methods, and utilising these tools for predictive tasks on graphs using Gaussian processes.

This talk is part of the Artificial Intelligence Research Group Talks (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity