Generalization errors of Laplacian regularized least squares regression
From MaRDI portal
Publication:1933952
DOI10.1007/s11425-012-4438-3zbMath1258.62049OpenAlexW2254867724MaRDI QIDQ1933952
Publication date: 28 January 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-012-4438-3
Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Applications of functional analysis in probability theory and statistics (46N30)
Related Items
Unnamed Item ⋮ The convergence rate of semi-supervised regression with quadratic loss ⋮ The performance of semi-supervised Laplacian regularized regression with the least square loss ⋮ Convergence rate of SVM for kernel-based robust regression ⋮ Performance analysis of the LapRSSLG algorithm in learning theory ⋮ ERROR ANALYSIS FOR THE SPARSE GRAPH-BASED SEMI-SUPERVISED CLASSIFICATION ALGORITHM
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Consistency of regularized spectral clustering
- Semi-supervised learning on Riemannian manifolds
- Geometry on probability spaces
- Towards a theoretical foundation for Laplacian-based manifold methods
- The covering number in learning theory
- Consistency of spectral clustering
- Learning rates of least-square regularized regression
- Shannon sampling. II: Connections to learning theory
- On the mathematical foundations of learning
- Learning Theory
- Capacity of reproducing kernel spaces in learning theory
- Graph-Based Semi-Supervised Learning and Spectral Kernel Design
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Theory of Reproducing Kernels
This page was built for publication: Generalization errors of Laplacian regularized least squares regression