Nonlinearity · 2018 · 59 citations · 32 references
ComputingMathematicsDecision TheoryGame TheoryMachine LearningGraph-based LearningProbabilistic Machine LearningSemi-supervised LearningSupervised LearningGraph LaplacianGraph-based Semi-supervised LearningLabelsLaplace EquationLaplace's EquationSemi-supervised Learning On GraphsSemi-supervised ModelsViscosity
Abstract We study the game theoretic p -Laplacian for semi-supervised learning on graphs, and show that it is well-posed in the limit of finite labeled data and infinite unlabeled data. In particular, we show that the continuum limit of graph-based semi-supervised learning with the game theoretic p -Laplacian is a weighted version of the continuous p -Laplace equation. We also prove that solutions to the graph p -Laplace equation are approximately Hölder continuous with high probability. Our proof uses the viscosity solution machinery and the maximum principle on a graph.
32
ImageNet: A large-scale hierarchical image database
Jia Deng, Wei Dong, Richard Socher et al. · 2009 IEEE Conference on Computer Vision and Pattern Recognition · 2009 · 61.8K citations
Gradient-based learning applied to document recognition
Yann LeCun, Léon Bottou, Yoshua Bengio et al. · Proceedings of the IEEE · 1998 · 58.2K citations · Full text
Learning with Local and Global Consistency
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal et al. · MPG.PuRe (Max Planck Society) · 2003 · 3.8K citations · Full text