Research map / Learning theory and algorithms / Sample complexity
New Bounds for Kernel Sums via Fast Spherical Embeddings
Tal Wagner
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
- Nyström Kernel Mean Embeddings (ICML 2022 · similarity 0.87)
- Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering (ICML 2019 · similarity 0.86)
- Refined Learning Bounds for Kernel and Approximate $k$-Means (NeurIPS 2021 · similarity 0.86)
- Kernel Quantile Embeddings and Associated Probability Metrics (ICML 2025 · similarity 0.85)
- Sparse Dimensionality Reduction Revisited (ICML 2024 · similarity 0.85)
- SPHERE-JEPA: Spherical Prediction with Homogeneous Embeddings (NeurIPS 2026 · 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.
