Research map / Graph learning / Graph self-supervised learning
$\ell_1$ Latent Distance based Continuous-time Graph Representation
Zhao-Rong Lai, Zheng-Sen Zhou, Liangda Fang, Yongsen Zheng, Ziliang Chen
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace squared l2 latent distance with l1 distance | GRASSP · Synthetic-α network completion | ROC-AUC: 0.559 -> 0.817 | Improved |
| replace squared l2 latent distance with l1 distance | GRASSP · NeurIPS network completion | ROC-AUC: 0.360 -> 0.533 | Improved |
| replace squared l2 latent distance with l1 distance | GRASSP · Facebook network completion | PR-AUC: 0.500 -> 0.687 | Improved |
| replace squared l2 latent distance with l1 distance | GRASSP · Reddit network completion | ROC-AUC: 0.918 -> 0.988 | Improved |
| replace squared l2 latent distance with l1 distance | GRASSP · Synthetic-β network completion | PR-AUC: 0.540 -> 0.641 | Mixed |
| l1LD-CTGR versus DyGFormer | DyGFormer · Can. Parl. network completion | PR-AUC: 0.874 -> 0.761 | Hurt |
| l1LD-CTGR versus DyGFormer | DyGFormer · Wikipedia network completion | ROC-AUC: 0.972 -> 0.982 | Improved |
| use closed-form l1 integral instead of numerical l2 distance integral (H=1000) (ablation) | l2 distance version · Facebook runtime per epoch | seconds: 531 -> 4.55 | Improved |
| l1 closed-form integral versus squared l2 Gaussian integral | GRASSP · Facebook runtime per epoch | seconds: 4.49 -> 4.55 | No clear effect |
| vary bin number B in 92-108 and dimension D in 2-6 (ablation) | l1LD-CTGR · Contacts | performance | No clear effect |
Closest papers by meaning
- Continuous-Time Graph Representation with Sequential Survival Process (AAAI 2024 · similarity 0.89)
- How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings (ICLR 2025 · similarity 0.84)
- Euclidean Embedding of Data Using Local Distances (NeurIPS 2026 · similarity 0.84)
- Long Range Propagation on Continuous-Time Dynamic Graphs (ICML 2024 · similarity 0.84)
- Weighted Embeddings for Low-Dimensional Graph Representation (AAAI 2025 · similarity 0.84)
- State Space Models on Temporal Graphs: A First-Principles Study (NeurIPS 2024 · similarity 0.84)
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.
