Revisiting general source condition in learning over a Hilbert space
From MaRDI portal
Cites work
- An Introduction to Artificial Intelligence Based on Reproducing Kernel Hilbert Spaces
- Balancing principle in supervised learning for a general regularization scheme
- Convergences of regularized algorithms and stochastic gradient methods with random projections
- Geometry of linear ill-posed problems in variable Hilbert scales
- How general are general source conditions?
- scientific article; zbMATH DE number 4200773 (Why is no real title available?)
- scientific article; zbMATH DE number 469124 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Learning Theory
- Learning theory estimates via integral operators and their approximations
- Learning theory of distributed spectral algorithms
- MODULI OF CONTINUITY FOR OPERATOR VALUED FUNCTIONS
- On regularization algorithms in learning theory
- On regularized polynomial functional regression
- On the mathematical foundations of learning
- Optimal rates for functional linear regression with general regularization
- Optimal rates for multi-pass stochastic gradient methods
- Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
- Optimal rates for the regularized least-squares algorithm
- Regularization networks and support vector machines
- Regularization theory for ill-posed problems. Selected topics
- Support Vector Machines
- Theory of Reproducing Kernels
This page was built for publication: Revisiting general source condition in learning over a Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952530)
