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