Consistency of fractional graph-Laplacian regularization in semisupervised learning with finite labels
DOI10.1137/23M1559087zbMATH Open1543.35258MaRDI QIDQ6571355FDOQ6571355
Authors: Adrien Weihs, Matthew Thorpe 
Publication date: 12 July 2024
Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)
Recommendations
- Rates of convergence for Laplacian semi-supervised learning with low labeling rates
- Analysis of \(p\)-Laplacian regularization in semisupervised learning
- Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
- Properly-weighted graph Laplacian for semi-supervised learning
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
nonparametric regressionfractional Laplacianasymptotic consistencysemisupervised learningnonlocal variational problemsPDEs on graphs
Asymptotic properties of nonparametric inference (62G20) Methods involving semicontinuity and convergence; relaxation (49J45) Existence of optimal solutions to problems involving randomness (49J55) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)
Cites Work
- Diffusion maps
- Random Geometric Graphs
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal Transport
- Consistency of spectral clustering
- Title not available (Why is that?)
- Title not available (Why is that?)
- A first course in Sobolev spaces
- \(\Gamma\)-convergence of graph Ginzburg-Landau functionals
- From graph to manifold Laplacian: the convergence rate
- Continuum limit of total variation on point clouds
- Title not available (Why is that?)
- Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
- Title not available (Why is that?)
- Learning Theory
- Semi-supervised learning on Riemannian manifolds
- Nonlocal \(p\)-Laplacian evolution problems on graphs
- Uniform Convergence of Adaptive Graph-Based Regularization
- An introduction to measure theory
- Analysis of \(p\)-Laplacian regularization in semisupervised learning
- Monotone properties of random geometric graphs have sharp thresholds
- Spectral convergence of the connection Laplacian from random samples
- Operator norm convergence of spectral clustering on level sets
- A variational approach to the consistency of spectral clustering
- Weighted nonlocal Laplacian on interpolation from sparse data
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- Title not available (Why is that?)
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Estimating perimeter using graph cuts
- Consistency of Cheeger and ratio graph cuts
- Consistency of Dirichlet partitions
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- Properly-weighted graph Laplacian for semi-supervised learning
- The game theoretic \(p\)-Laplacian and semi-supervised learning with few labels
- Consistency of Lipschitz learning with infinite unlabeled data and finite labeled data
- Diffuse interface models on graphs for classification of high dimensional data
- Lipschitz regularity of graph Laplacians on random data clouds
- From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
- Large data limit for a phase transition model with the p-Laplacian on point clouds
- Asymptotic analysis of the Ginzburg–Landau functional on point clouds
- Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
- A new analytical approach to consistency and overfitting in regularized empirical risk minimization
- Mumford-Shah functionals on graphs and their asymptotics
- Continuum limit of the nonlocal \(p\)-Laplacian evolution problem on random inhomogeneous graphs
- Rates of convergence for Laplacian semi-supervised learning with low labeling rates
- Continuum limit of Lipschitz learning on graphs
- Uniform convergence rates for Lipschitz learning on graphs
This page was built for publication: Consistency of fractional graph-Laplacian regularization in semisupervised learning with finite labels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571355)
