Convergence rate of the semi-supervised greedy algorithm

DOI10.1016/J.NEUNET.2013.03.001zbMATH Open1296.68123OpenAlexW2041028606WikidataQ43837122 ScholiaQ43837122MaRDI QIDQ459432FDOQ459432

Authors: Yicong Zhou, Yuan Yan Tang, Luoqing Li, Zhibin Pan, Hong Chen 

Publication date: 9 October 2014

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2013.03.001

Recommendations

• Convergence rate of semi-supervised gradient learning algorithms
• The convergence rate of semi-supervised regression with quadratic loss
• Generalization errors of Laplacian regularized least squares regression
• Error analysis for the sparse graph-based semi-supervised classification algorithm
• Generalization performance of graph-based semi-supervised classification

zbMATH Keywords

greedy algorithmgeneralization errorsparsesemi-supervised learningdata-dependent hypothesis space

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Learning Theory
• On the mathematical foundations of learning
• Approximation and learning by greedy algorithms
• Support vector machine soft margin classifiers: error analysis
• On the consistency of feature selection using greedy least squares regression
• Semi-supervised learning on Riemannian manifolds
• Learning with sample dependent hypothesis spaces
• Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
• Least square regression with indefinite kernels and coefficient regularization
• Multi-kernel regularized classifiers
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Generalization error bounds in semi-supervised classification under the cluster assumption
• Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
• The generalization performance of ERM algorithm with strongly mixing observations
• On the effectiveness of Laplacian normalization for graph semi-supervised learning
• Graph-Based Semi-Supervised Learning and Spectral Kernel Design
• Semi-supervised learning based on high density region estimation
• Sparse regularization for semi-supervised classification
• Error bounds of multi-graph regularized semi-supervised classification
• Sparse semi-supervised learning using conjugate functions
• 10.1162/jmlr.2003.3.4-5.781
• Approximation Bounds for Some Sparse Kernel Regression Algorithms

Cited In (11)

• Kernel-based sparse regression with the correntropy-induced loss
• Error analysis for the sparse graph-based semi-supervised classification algorithm
• Convergence rate of SVM for kernel-based robust regression
• Performance analysis of the LapRSSLG algorithm in learning theory
• Convergence rate of semi-supervised gradient learning algorithms
• Generalization analysis of Fredholm kernel regularized classifiers
• Optimality of the rescaled pure greedy learning algorithms
• Greedy approaches to semi-supervised subspace learning
• The performance of semi-supervised Laplacian regularized regression with the least square loss
• Rates of convergence for Laplacian semi-supervised learning with low labeling rates
• The convergence rate of semi-supervised regression with quadratic loss

This page was built for publication: Convergence rate of the semi-supervised greedy algorithm

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