Spacetime Representation Learning
Marc T. Law, James Lucas
摘要
We propose a class of trainable deep learning-based geometries called Neural Spacetimes (NSTs), which can universally represent nodes in weighted directed acyclic graphs (DAGs) as events in a spacetime manifold. While most works in the literature focus on undirected graph representation learning or causality embedding separately, our differentiable geometry can encode both graph edge weights in its spatial dimensions and causality in the form of edge directionality in its temporal dimensions. We use a product manifold that combines a quasi-metric (for space) and a partial order (for time). NSTs are implemented as three neural networks trained in an end-to-end manner: an embedding network, which learns to optimize the location of nodes as events in the spacetime manifold, and two other networks that optimize the space and time geometries in parallel, which we call a neural (quasi-)metric and a neural partial order, respectively. The latter two networks leverage recent ideas at the intersection of fractal geometry and deep learning to shape the geometry of the representation space in a data-driven fashion, unlike other works in the literature that use fixed spacetime manifolds such as Minkowski space or De Sitter space to embed DAGs. Our main theoretical guarantee is a universal embedding theorem, showing that any -point DAG can be embedded into an NST with distortion while exactly preserving its causal structure. The total number of parameters defining the NST is sub-cubic in and linear in the width of the DAG. If the DAG has a planar Hasse diagram, this is improved to spatial and 2 temporal dimensions. We validate our framework computationally with synthetic weighted DAGs and real-world network embeddings; in both cases, the NSTs achieve lower embedding distortions than their counterparts using fixed spacetime geometries.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper13
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong 等NeurIPS 2020 · 被引用 3,935 次
- Hyperbolic Neural Networks++Ryohei Shimizu, Yusuke Mukuta, Tatsuya HaradaICLR 2021 · 被引用 791 次
- Graph Neural Networks with HeterophilyJiong Zhu, Ryan A. Rossi, Anup Rao, Tung Mai 等AAAI 2021 · 被引用 393 次
- COT-GAN: Generating Sequential Data via Causal Optimal TransportTianlin Xu, Li Kevin Wenliang, Michael Munn, Beatrice AcciaioNeurIPS 2020 · 被引用 139 次
- Tree! I am no Tree! I am a low dimensional Hyperbolic EmbeddingRishi Sonthalia, Anna C. GilbertNeurIPS 2020 · 被引用 62 次
相关 Paper
- Neural Snowflakes: Universal Latent Graph Inference via Trainable Latent GeometriesHaitz Sáez de Ocáriz Borde, Anastasis KratsiosICLR 2024 · 被引用 6 次
- Directed Graph Embeddings in Pseudo-Riemannian ManifoldsAaron Sim, Maciej Wiatrak, Angus Brayne, Páidí Creed 等ICML 2021 · 被引用 17 次
- The Natural Geometry of Code: Hyperbolic Representation Learning for Program ReasoningWeilin ZhouICLR 2026
- Riemannian Liquid Spatio-Temporal Graph NetworkLiangsi Lu, Jingchao Wang, Zhaorong Dai, Hanqian Liu 等WWW 2026 · 被引用 1 次
- Capacity and Bias of Learned Geometric Embeddings for Directed GraphsMichael Boratko, Dongxu Zhang, Nicholas Monath, Luke Vilnis 等NeurIPS 2021 · 被引用 13 次
