Research map / Learning theory and algorithms / Kernels and regression theory
Error Bounds for Learning with Vector-Valued Random Features
Samuel Lanthaler, Nicholas H. Nelsen
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| increase number of random features M with lambda ~ 1/M | vector-valued RF-RR · Burgers' equation solution operator | relative squared test error | Improved |
| increase number of training samples N with lambda ~ 1/sqrt(N) and fixed M | vector-valued RF-RR · Burgers' equation solution operator | relative squared test error | Improved |
| increase discretized output dimension p | vector-valued RF-RR · Burgers' equation solution operator | relative squared test error | No clear effect |
Closest papers by meaning
- Dimension-free deterministic equivalents and scaling laws for random feature regression (NeurIPS 2024 · similarity 0.87)
- Optimal Kernel Quantile Learning with Random Features (ICML 2024 · similarity 0.86)
- Optimal Rates for Vector-Valued Spectral Regularization Learning Algorithms (NeurIPS 2024 · similarity 0.86)
- Towards Theoretical Understanding of Learning Large-scale Dependent Data via Random Features (ICML 2024 · similarity 0.86)
- Regularized least squares learning with heavy-tailed noise is minimax optimal (NeurIPS 2025 · similarity 0.84)
- Random features models: a way to study the success of naive imputation (ICML 2024 · similarity 0.84)
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.
