Research map / Graph learning / Graph algorithms and clustering
Efficient Learning on Large Graphs using a Densifying Regularity Lemma
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 on Large Graphs using Intersecting Communities (NeurIPS 2024 · similarity 0.93)
- Efficient Learning of Linear Graph Neural Networks via Node Subsampling (NeurIPS 2023 · similarity 0.88)
- Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddings (NeurIPS 2020 · similarity 0.88)
- From Link Prediction to Linear Community Detection: A Finite-Sample Guarantee for Graph Pretraining (NeurIPS 2026 · similarity 0.88)
- Graph Sparsification via Mixture of Graphs (ICLR 2025 · similarity 0.87)
- Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness (ICML 2024 · similarity 0.86)
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.