Performance analysis of the LapRSSLG algorithm in learning theory

DOI10.1142/S0219530519410033MaRDI QIDQ5220067zbMATH OpenOpenAlexWikidataFDO

Authors Bao-Huai Sheng, Haizhang Zhang

Publication date 10 March 2020

Published in Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219530519410033

zbMATH Keywords

convex analysislearning ratereproducing kernel Hilbert spacessemi-supervised gradient learning

Mathematics Subject Classification ID

Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• The performance of semi-supervised Laplacian regularized regression with the least square loss
• Generalization errors of Laplacian regularized least squares regression
• Convergence rate of semi-supervised gradient learning algorithms
• The convergence rate of semi-supervised regression with quadratic loss
• Properly-weighted graph Laplacian for semi-supervised learning

Cites work

• 10.1162/1532443041827925
• Consistency and robustness of kernel-based regression in convex risk minimization
• Consistency of regularized spectral clustering
• Convergence rate of semi-supervised gradient learning algorithms
• Convergence rate of the semi-supervised greedy algorithm
• Convex analysis and monotone operator theory in Hilbert spaces
• Covering Numbers for Convex Functions
• Derivative reproducing properties for kernel methods in learning theory
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• Estimation of gradients and coordinate covariation in classification
• Generalization errors of Laplacian regularized least squares regression
• Learning coordinate covariances via gradients
• Learning gradients by a gradient descent algorithm
• Learning gradients on manifolds
• Learning gradients: predictive models that infer geometry and statistical dependence
• Learning sets with separating kernels
• Learning sparse gradients for variable selection and dimension reduction
• Learning Theory
• Manifold regularization and semi-supervised learning: some theoretical analyses
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Nonparametric sparsity and regularization
• On the mathematical foundations of learning
• Some properties of regularized kernel methods
• The covering number in learning theory
• The performance of semi-supervised Laplacian regularized regression with the least square loss
• Theory of Reproducing Kernels
• Universal kernels

Cited in

(8)

• Generalization errors of Laplacian regularized least squares regression
• Properly-weighted graph Laplacian for semi-supervised learning
• Learning rates of kernel-based robust classification
• Convergence of online pairwise regression learning with quadratic loss
• Error analysis for the sparse graph-based semi-supervised classification algorithm
• Convergence rate of semi-supervised gradient learning algorithms
• The performance of semi-supervised Laplacian regularized regression with the least square loss
• The kernel regularized learning algorithm for solving Laplace equation with Dirichlet boundary

This page was built for publication: Performance analysis of the LapRSSLG algorithm in learning theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220067)