Research map / Graph learning / GNN architectures
Learning to Rank: How GNNs Solve Max-Clique and Sparse PCA
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
- Do Graph Neural Networks Learn Generalizable Algorithms for Clustering Graphs? (NeurIPS 2026 · similarity 0.89)
- On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks (ICML 2025 · similarity 0.88)
- Pruning for GNNs: Lower Complexity with Comparable Expressiveness (ICML 2025 · similarity 0.88)
- Towards Bridging Generalization and Expressivity of Graph Neural Networks (ICLR 2025 · similarity 0.88)
- Making Classic GNNs Strong Baselines Across Varying Homophily: A Smoothness–Generalization Perspective (NeurIPS 2025 · similarity 0.88)
- Covered Forest: Fine-grained generalization analysis of graph neural networks (ICML 2025 · similarity 0.88)
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.