Optimal rates of kernel ridge regression under source condition in large dimensions
From MaRDI portal
Cites work
- An introduction to Sobolev spaces and interpolation spaces
- Approximation Theory and Harmonic Analysis on Spheres and Balls
- Benign overfitting in linear regression
- Best constants for Sobolev inequalities for higher order fractional derivatives
- Cross-validation based adaptation for regularization operators in learning theory
- Early stopping and non-parametric regression: an optimal data-dependent stopping rule
- Generalization error of random feature and kernel methods: hypercontractivity and kernel matrix concentration
- scientific article; zbMATH DE number 7306853 (Why is no real title available?)
- Information-theoretic determination of minimax rates of convergence
- Just interpolate: kernel ``ridgeless regression can generalize
- Kernel interpolation generalizes poorly
- Linearized two-layers neural networks in high dimension
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- On regularization algorithms in learning theory
- On the Inconsistency of Kernel Ridgeless Regression in Fixed Dimensions
- Optimal rates for spectral algorithms with least-squares regression over Hilbert spaces
- Optimal rates for the regularized least-squares algorithm
- Reproducing kernels of Sobolev spaces on \(\mathbb{R}^d\) and applications to embedding constants and tractability
- Sobolev norm learning rates for regularized least-squares algorithms
- Spectral Algorithms for Supervised Learning
- Support Vector Machines
- Surprises in high-dimensional ridgeless least squares interpolation
- The Generalization Error of Random Features Regression: Precise Asymptotics and the Double Descent Curve
- The spectrum of kernel random matrices
This page was built for publication: Optimal rates of kernel ridge regression under source condition in large dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308326)
