Corpus ID: 419451

# Algorithms for Lipschitz Learning on Graphs

@article{Kyng2015AlgorithmsFL,
title={Algorithms for Lipschitz Learning on Graphs},
author={Rasmus Kyng and A. Rao and Sushant Sachdeva and D. Spielman},
journal={ArXiv},
year={2015},
volume={abs/1505.00290}
}
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 present an algorithm that computes a minimal Lipschitz extension in expected linear time, and an algorithm that computes an absolutely minimal Lipschitz extension in… Expand
51 Citations

#### References

SHOWING 1-10 OF 57 REFERENCES
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
• Computer Science
• IEEE Transactions on Information Theory
• 2017
• 20
• PDF
VECTOR-VALUED OPTIMAL LIPSCHITZ EXTENSIONS
• Mathematics
• 2010
• 47
• Highly Influential
• PDF
Distance-Based Classification with Lipschitz Functions
• Mathematics, Computer Science
• J. Mach. Learn. Res.
• 2003
• 149
• PDF
Solving SDD linear systems in nearly mlog1/2n time
• 132
• PDF