Convergence analysis of online algorithms for vector-valued kernel regression
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- An introduction to the theory of reproducing kernel Hilbert spaces
- Distributed learning with regularized least squares
- Fast and strong convergence of online learning algorithms
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression
- Kernels for vector-valued functions: a review
- Learning Theory
- Learning from examples as an inverse problem
- Nonparametric stochastic approximation with large step-sizes
- On Learning Vector-Valued Functions
- On the mathematical foundations of learning
- Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
- Online gradient descent learning algorithms
- Operator-valued kernels for learning from functional response data
- Optimal rates for the regularized least-squares algorithm
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
- Sobolev norm learning rates for regularized least-squares algorithms
- Stochastic subspace correction in Hilbert space
- Support Vector Machines
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES AND UNIVERSALITY
- VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES OF INTEGRABLE FUNCTIONS AND MERCER THEOREM
This page was built for publication: Convergence analysis of online algorithms for vector-valued kernel regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238004)
