Research map / Graph learning / Graph algorithms and clustering
On the Optimization Trajectory of DeepWalk Embeddings
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
- Convergence Guarantees for the DeepWalk Embedding on Block Models (ICML 2024 · similarity 0.93)
- DeepWalking Backwards: From Embeddings Back to Graphs (ICML 2021 · similarity 0.90)
- Revisiting Random Walks for Learning on Graphs (ICLR 2025 · similarity 0.87)
- Learning Representations for Hierarchies with Minimal Support (NeurIPS 2024 · similarity 0.86)
- Random Search Neural Networks for Efficient and Expressive Graph Learning (NeurIPS 2025 · similarity 0.86)
- How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings (ICLR 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.