Research map / Graph learning / Graph algorithms and clustering
Generalization Bounds for Graph Embedding Using Negative Sampling: Linear vs Hyperbolic
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
- Tight and fast generalization error bound of graph embedding in metric space (ICML 2023 · similarity 0.94)
- Weighted Embeddings for Low-Dimensional Graph Representation (AAAI 2025 · similarity 0.90)
- Hyperbolic Embeddings of Supervised Models (NeurIPS 2024 · similarity 0.88)
- Information Loss and Disparate Effects in Network Embeddings (NeurIPS 2026 · similarity 0.86)
- Low-distortion and GPU-compatible Tree Embeddings in Hyperbolic Space (ICML 2025 · similarity 0.86)
- Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem (NeurIPS 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.