New equivalences between interpolation and SVMs: kernels and structured features
From MaRDI portal
Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Ridge regression; shrinkage estimators (Lasso) (62J07) Computational learning theory (68Q32)
Cites work
- Benign overfitting in linear regression
- Fast learning rates for plug-in classifiers
- Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation
- Generalization error of random feature and kernel methods: hypercontractivity and kernel matrix concentration
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 7370646 (Why is no real title available?)
- scientific article; zbMATH DE number 7626737 (Why is no real title available?)
- Just interpolate: kernel ``ridgeless regression can generalize
- Learning Bounds for Kernel Regression Using Effective Data Dimensionality
- Mercer's theorem on general domains: on the interaction between measures, kernels, and RKHSs
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Random design analysis of ridge regression
- Random embeddings with an almost Gaussian distortion
- Robust learning and generalization with support vector machines.
- Simplified PAC-Bayesian margin bounds.
- Support-vector networks
- Surprises in high-dimensional ridgeless least squares interpolation
- The implicit bias of gradient descent on separable data
- Two models of double descent for weak features
This page was built for publication: New equivalences between interpolation and SVMs: kernels and structured features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617269)
