# Algorithms for Lipschitz Learning on Graphs

COLT, pp. 1190-1223, 2015.

Cited by: 56|Bibtex|Views53
EI

Abstract:

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely minimal Lipschitz extension, and is the limit for large \$p\$ of \$p\$-Laplacian regularization. We prese...More

Code:

Data:

Full Text