University of Cambridge > Talks.cam > Applied and Computational Analysis > Analysis of p-Laplacian Regularization in Semi-Supervised Learning

Analysis of p-Laplacian Regularization in Semi-Supervised Learning

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

  • UserMatthew Thorpe (University of Cambridge) World_link
  • ClockThursday 26 October 2017, 15:00-16:00
  • HouseMR 14, CMS.

If you have a question about this talk, please contact Carola-Bibiane Schoenlieb.

This talk concerns a family of regression problems in a semi-supervised setting. The task is to assign real-valued labels to a set of n sample points, provided a small training subset of N labelled points. A goal of semi-supervised learning is to take advantage of the (geometric) structure provided by the large number of unlabelled data when assigning labels. In this talk the geometry is represented by the random geometric graph model with connection radius r(n). The framework is to consider objective functions which reward the regularity of the estimator function and impose or reward the agreement with the training data, more specifically we will consider discrete p-Laplacian regularization.

The talk concerns the asymptotic behaviour in the limit where the number of unlabelled points increases while the number of training points remains fixed. The results are to uncover a delicate interplay between the regularizing nature of the functionals considered and the nonlocality inherent to the graph constructions. I will give almost optimal ranges on the scaling of r(n) for the asymptotic consistency to hold. For standard approaches used thus far there is a restrictive upper bound on how quickly r(n) must converge to zero as n goes to infinity. I will present a new model which overcomes this restriction. It is as simple as the standard models, but converges as soon as r(n) → 0.

This is joint work with Dejan Slepcev (CMU).

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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