Research map / Learning theory and algorithms / Kernels and regression theory
Random Features for Shift-Invariant Kernels with Moment Matching
Read the paperCheck your idea against 108,967 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
- Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels (NeurIPS 2018 · similarity 0.90)
- Learning Adaptive Random Features (AAAI 2019 · similarity 0.89)
- Quadrature-based features for kernel approximation (NeurIPS 2018 · similarity 0.89)
- Random features for Grassmannian kernel approximation with bounded rank-one projections (NeurIPS 2026 · similarity 0.87)
- Quasi-Monte Carlo Features for Kernel Approximation (ICML 2024 · similarity 0.86)
- Manifold Random Features (NeurIPS 2026 · similarity 0.85)
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.