A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Asymptotic behavior of \(\ell_p\)-based Laplacian regularization in semi-supervised learning
Annual Conference Computational Learning Theory
Given a weighted graph with N vertices, consider a real-valued regression problem in a semisupervised setting, where one observes n labeled vertices, and the task is to label the remaining ones. We present a theoretical study of p -based Laplacian regularization under a d-dimensional geometric random graph model. We provide a variational characterization of the performance of this regularized learner as N grows to infinity while n stays constant; the associated optimality conditions lead to adblp:conf/colt/Alaoui16 fatcat:m2muony7czauvcpcdfv3ewa6qy