Research map / Learning theory and algorithms / Kernels and regression theory
Sobolev Norm Learning Rates for Regularized Least-Squares Algorithms
Simon Fischer, Ingo Steinwart
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Towards Optimal Sobolev Norm Rates for the Vector-Valued Regularized Least-Squares Algorithm (JMLR 2024 · similarity 0.91)
- Ivanov-Regularised Least-Squares Estimators over Large RKHSs and Their Interpolation Spaces (JMLR 2019 · similarity 0.88)
- Minimax Optimal Kernel Operator Learning via Multilevel Training (ICLR 2023 · similarity 0.88)
- Minimum Norm Interpolation Meets The Local Theory of Banach Spaces (ICML 2024 · similarity 0.87)
- Regularized least squares learning with heavy-tailed noise is minimax optimal (NeurIPS 2025 · similarity 0.87)
- The optimality of kernel classifiers in Sobolev space (ICLR 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
