University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Function estimation on large graphs with missing data

  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

Function estimation on large graphs with missing data

Download to your calendar using vCal

If you have a question about this talk, please contact INI IT .

SNAW05 - Bayesian methods for networks

Co-author: Harry van Zanten (University of Amsterdam)

There are various problems in statistics and machine learning that involve making an inference about a function on a graph. I will present a Bayesian approach to estimating a smooth function in the context of regression and classification problems on graphs. I will discuss the mathematical framework that allows to study the performance of nonparametric function estimation methods on large graphs. I will review theoretical results that show how to achieve asymptotically optimal Bayesian regularization under geometry conditions on the families of the graphs and the smoothness assumption on the true function. Both assumptions are formulated in terms of graph Laplacian. I will also discuss the case of “uniformly distributed” missing observations and investigate the generalization performance for various missing mechanisms.

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 lists

Hicks Room, The University Centre, Granta Place, Cambridge CB2 1RU Institute of Metabolic Science (IMS), Level 4 ATC, Seminar rooms 1,2 & 3 Average on weekdays: 8896.42088608 kWh

Other talks

Coming soon Emergency Medicine and Metabolic Medicine Title to be confirmed Tea and Coffee Break Directing Disturbance: Three Theatremakers in Discussion Title to be confirmed
 

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