Learning rates of multioutput regression with kernel methods and ^p-regularization
From MaRDI portal
Learning rates of multioutput regression with kernel methods and \(\ell^p\)-regularization
Cites work
- An extension of Mercer theorem to matrix-valued measurable kernels
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Capacity of reproducing kernel spaces in learning theory
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- scientific article; zbMATH DE number 5968915 (Why is no real title available?)
- scientific article; zbMATH DE number 1324223 (Why is no real title available?)
- Learning multiple tasks with kernel methods
- Learning rates of least-square regularized regression
- Learning rates of multitask kernel methods
- Learning Theory
- Learning theory estimates via integral operators and their approximations
- Least square regression with \(l^{p}\)-coefficient regularization
- Least square regression with indefinite kernels and coefficient regularization
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- On Learning Vector-Valued Functions
- On the mathematical foundations of learning
- Shannon sampling. II: Connections to learning theory
- The covering number in learning theory
- Unified approach to coefficient-based regularized regression
- Universal kernels
- 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: Learning rates of multioutput regression with kernel methods and \(\ell^p\)-regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909365)
