Rates of convergence for Laplacian semi-supervised learning with low labeling rates
From MaRDI portal
Publication:2683473
asymptotic consistencygamma-convergencenon-local variational problemsPDEs on graphsrandom walks on graphsregressionsemi-supervised learning
Random walks on graphs (05C81) Applications of graph theory (05C90) Variational methods for second-order elliptic equations (35J20) Sums of independent random variables; random walks (60G50) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Asymptotic properties of nonparametric inference (62G20) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)
Recommendations
- Convergence rate of semi-supervised gradient learning algorithms
- Convergence rate of the semi-supervised greedy algorithm
- On convergence rate of a convex relaxation of semisupervised support vector machines
- The convergence rate of semi-supervised regression with quadratic loss
- Consensus rate-based label propagation for semi-supervised classification
- Semi-supervised learning with regularized Laplacian
- Laplacian-optimized diffusion for semi-supervised learning
- The game theoretic p-Laplacian and semi-supervised learning with few labels
- Analysis of p-Laplacian regularization in semisupervised learning
Cites work
- A continuum limit for the PageRank algorithm
- A first course in Sobolev spaces
- A maximum principle argument for the uniform convergence of graph Laplacian regressors
- A transportation \(L^p\) distance for signal analysis
- A variational approach to the consistency of spectral clustering
- Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
- Analysis of p-Laplacian regularization in semisupervised learning
- Asymptotic analysis of the Ginzburg–Landau functional on point clouds
- Concentration inequalities for sums and martingales
- Concentration inequalities. A nonasymptotic theory of independence
- Consistency of Cheeger and ratio graph cuts
- Consistency of Dirichlet partitions
- Consistency of Lipschitz learning with infinite unlabeled data and finite labeled data
- Consistency of modularity clustering on random geometric graphs
- Continuum limit of total variation on point clouds
- Continuum limits of posteriors in graph Bayesian inverse problems
- Deep limits of residual neural networks
- Elliptic partial differential equations of second order
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Estimating perimeter using graph cuts
- From graph to manifold Laplacian: the convergence rate
- scientific article; zbMATH DE number 5681750 (Why is no real title available?)
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- Large data limit for a phase transition model with the p-Laplacian on point clouds
- Learning Theory
- Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
- Mumford-Shah functionals on graphs and their asymptotics
- On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms
- Optimal Cheeger cuts and bisections of random geometric graphs
- Optimal transport for manifold-valued images
- Random Geometric Graphs
- Random walk: A modern introduction
- Semi-supervised learning on Riemannian manifolds
- The game theoretic p-Laplacian and semi-supervised learning with few labels
- Weighted nonlocal Laplacian on interpolation from sparse data
Cited in
(14)- Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
- A compactness theorem for functions on Poisson point clouds
- Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning
- Rates of Convergence for Laplacian Semi-Supervised Learning with Low Labeling Rates
- Segmentation in Measure Spaces
- Consistency of fractional graph-Laplacian regularization in semisupervised learning with finite labels
- Ratio convergence rates for Euclidean first-passage percolation: applications to the graph infinity Laplacian
- Convergence rates of the fractional to the local Dirichlet problem
- Singularities in discrete systems. Abstracts from the workshop held May 4--9, 2025
- Targeting influence in a harmonic opinion model
- Meshless shape optimization using neural networks and partial differential equations on graphs
- Large data limit of the MBO scheme for data clustering: -convergence of the thresholding energies
- Discrete-to-continuum rates of convergence for nonlocal p-Laplacian evolution problems
- Convergence of graph Dirichlet energies and graph Laplacians on intersecting manifolds of varying dimensions
This page was built for publication: Rates of convergence for Laplacian semi-supervised learning with low labeling rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2683473)
