Fetching the paper…
Reading the bibliography…
Given a weighted graph with $N$ vertices, consider a real-valued regression problem in a semi-supervised setting, where one observes $n$ labeled vertices, and the task is to label the remaining ones.
Calculus of variations. revised english edition translated and edited by richard a. silverman, 1963
IM Gelfand and SV Fomin · 1963
Earlier work this paper cites.
The Pólya algorithm in L ∞ L_{\infty} approximation
RB Darst, DA Legg, and DW Townsend · 1983
Earlier work this paper cites.
Dependence on p p of the best L p L_{p} approximation operator
AG Egger and GD Taylor · 1987
Earlier work this paper cites.
The Pólya algorithm for convex approximation
David A Legg and Douglas W Townsend · 1989
Earlier work this paper cites.
Rate of convergence of the discrete Pólya algorithm
Alan Egger and Robert Huotari · 1990
Earlier work this paper cites.
Embeddings of weighted sobolev spaces into spaces of continuous functions
RC Brown and B Opic · 1992
Earlier work this paper cites.
The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter
Vittori Castelli and Thomas M Cover · 1996
Earlier work this paper cites.
Uniform central limit theorems
R. M. Dudley · 1999
Earlier work this paper cites.
Empirical processes in M-estimation
Sara van de Geer · 2000
Earlier work this paper cites.
Laplacian eigenmaps and spectral techniques for embedding and clustering
Mikhail Belkin and Partha Niyogi · 2001
Earlier work this paper cites.
Optimal Lipschitz extensions and the infinity Laplacian
Michael G Crandall, Lawrence C Evans, and Ronald F Gariepy · 2001
Earlier work this paper cites.
Localized Rademacher complexities
Peter L Bartlett, Olivier Bousquet, and Shahar Mendelson · 2002
Earlier work this paper cites.
Geometric parameters of kernel machines
Shahar Mendelson · 2002
Earlier work this paper cites.
Sobolev spaces
Robert A Adams and John JF Fournier · 2003
Earlier work this paper cites.
Eigenvalues of the discrete p p -Laplacian for graphs
S Amghibech · 2003
Earlier work this paper cites.
Measure based regularization
Olivier Bousquet, Olivier Chapelle, and Matthias Hein · 2003
Cited alongside, same era.
Semi-supervised learning using Gaussian fields and harmonic functions
Xiaojin Zhu, Zoubin Ghahramani, and John Lafferty · 2003
Cited alongside, same era.
A tour of the theory of absolutely minimizing functions
Gunnar Aronsson, Michael Crandall, and Petri Juutinen · 2004
Cited alongside, same era.
Semi-supervised learning on Riemannian manifolds
Mikhail Belkin and Partha Niyogi · 2004
Cited alongside, same era.
Regularization on discrete spaces
Dengyong Zhou and Bernhard Schölkopf · 2005
Cited alongside, same era.
Geometrical aspects of statistical learning theory
Matthias Hein · 2006
Cited alongside, same era.
A first course in Sobolev spaces
Giovanni Leoni · 2009
Later among the works it cites.
Semi-supervised learning with the graph laplacian: The limit of infinite unlabelled data
Boaz Nadler, Nathan Srebro, and Xueyuan Zhou · 2009
Later among the works it cites.
Tug-of-war and the infinity Laplacian
Yuval Peres, Oded Schramm, Scott Sheffield, and David Wilson · 2009
Later among the works it cites.
Approximation theorems of mathematical statistics
Robert J Serfling · 2009
Later among the works it cites.
An easy proof of Jensen’s theorem on the uniqueness of infinity harmonic functions
Scott N Armstrong and Charles K Smart · 2010
Later among the works it cites.
On the eigenvectors of p p -Laplacian
Dijun Luo, Heng Huang, Chris Ding, and Feiping Nie · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Uniform convergence of adaptive graph-based regularization
Matthias Hein · 2006
Cited alongside, same era.
Local Rademacher complexities and oracle inequalities in risk minimization
Vladimir Koltchinskii · 2006
Cited alongside, same era.
Learning on graph with Laplacian regularization
Rie Kubota Ando and Tong Zhang · 2007
Cited alongside, same era.
On the effectiveness of Laplacian normalization for graph semi-supervised learning
Rie Johnson and Tong Zhang · 2007
Cited alongside, same era.
Statistical analysis of semi-supervised regression
John Lafferty and Larry Wasserman · 2007
Cited alongside, same era.
Generalization error bounds in semi-supervised classification under the cluster assumption
Philippe Rigollet · 2007
Cited alongside, same era.
Phase transition in the family of p p -resistances
Morteza Alamgir and Ulrike V Luxburg · 2011
Later among the works it cites.
Semi-supervised learning by higher order regularization
Xueyuan Zhou and Mikhail Belkin · 2011
Later among the works it cites.
Nonlinear potential theory of degenerate elliptic equations
Juha Heinonen, Tero Kilpeläinen, and Olli Martio · 2012
Later among the works it cites.
p p -voltages: Laplacian regularization for semi-supervised learning on high-dimensional data
Nick Bridle and Xiaojin Zhu · 2013
Later among the works it cites.
Finite difference methods for the infinity Laplace and p p -Laplace equations
Adam M Oberman · 2013
Later among the works it cites.
Learning on graphs using orthonormal representation is statistically consistent
Rakesh Shivanna and Chiranjib Bhattacharyya · 2014
Later among the works it cites.
Algorithms for Lipschitz learning on graphs
Rasmus Kyng, Anup Rao, Sushant Sachdeva, and Daniel A Spielman · 2015
Later among the works it cites.
Spectral norm regularization of orthonormal representations for graph transduction
Rakesh Shivanna, Bibaswan K Chatterjee, Raman Sankaran, Chiranjib Bhattacharyya, and Francis Bach · 2015
Later among the works it cites.
Trend filtering on graphs
Yu-Xiang Wang, James Sharpnack, Alex Smola, and Ryan J Tibshirani · 2015
Later among the works it cites.