Consistency of fractional graph-Laplacian regularization in semisupervised learning with finite labels
DOI10.1137/23m1559087zbMath1543.35258MaRDI QIDQ6571355
Publication date: 12 July 2024
Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)
asymptotic consistencynonparametric regressionfractional Laplaciansemisupervised learningnonlocal variational problemsPDEs on graphs
Asymptotic properties of nonparametric inference (62G20) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Methods involving semicontinuity and convergence; relaxation (49J45) Existence of optimal solutions to problems involving randomness (49J55) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuum limit of total variation on point clouds
- Semi-supervised learning on Riemannian manifolds
- A variational approach to the consistency of spectral clustering
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- Weighted nonlocal Laplacian on interpolation from sparse data
- \(\Gamma\)-convergence of graph Ginzburg-Landau functionals
- Properly-weighted graph Laplacian for semi-supervised learning
- From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
- Analysis and algorithms for \(\ell_p\)-based semi-supervised learning on graphs
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Consistency of spectral clustering
- Monotone properties of random geometric graphs have sharp thresholds
- Diffusion maps
- From graph to manifold Laplacian: the convergence rate
- Rates of convergence for Laplacian semi-supervised learning with low labeling rates
- Continuum limit of Lipschitz learning on graphs
- Diffuse Interface Models on Graphs for Classification of High Dimensional Data
- Consistency of Cheeger and Ratio Graph Cuts
- A new analytical approach to consistency and overfitting in regularized empirical risk minimization
- Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
- Random Geometric Graphs
- Consistency of Dirichlet Partitions
- Spectral convergence of the connection Laplacian from random samples
- Nonlocal $p$-Laplacian Evolution Problems on Graphs
- The game theoreticp-Laplacian and semi-supervised learning with few labels
- Consistency of Lipschitz Learning with Infinite Unlabeled Data and Finite Labeled Data
- Lipschitz Regularity of Graph Laplacians on Random Data Clouds
- Large data limit for a phase transition model with the p-Laplacian on point clouds
- Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs
- Mumford–Shah functionals on graphs and their asymptotics
- Analysis of $p$-Laplacian Regularization in Semisupervised Learning
- Estimating perimeter using graph cuts
- Uniform Convergence of Adaptive Graph-Based Regularization
- Asymptotic analysis of the Ginzburg–Landau functional on point clouds
- Operator norm convergence of spectral clustering on level sets
- Learning Theory
- Optimal Transport
- 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