Research map / Graph learning / Graph algorithms and clustering
Structure-Aware Random Fourier Kernel for Graphs
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
- Taming graph kernels with random features (ICML 2023 · similarity 0.88)
- Graph Random Features for Scalable Gaussian Processes (ICLR 2026 · similarity 0.88)
- General Graph Random Features (ICLR 2024 · similarity 0.88)
- Manifold Random Features (NeurIPS 2026 · similarity 0.86)
- From Theory to Practice: Rethinking Green and Martin Kernels for Unleashing Graph Transformers (ICML 2025 · similarity 0.86)
- Uncertainty Estimation on Graphs with Structure Informed Stochastic Partial Differential Equations (NeurIPS 2025 · 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.