Research map / Graph learning / Graph algorithms and clustering

Spacetime Representation Learning

ICLR 2023 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification

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

• Neural Spacetimes for DAG Representation Learning (ICLR 2025 · similarity 0.89)
• Lorentz Local Canonicalization: How to make any Network Lorentz-Equivariant (NeurIPS 2025 · similarity 0.83)
• SPACETIME: Causal Discovery from Non-Stationary Time Series (AAAI 2025 · similarity 0.83)
• Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding (CVPR 2025 · similarity 0.82)
• Follow the Energy, Find the Path: Riemannian Metrics from Energy-Based Models (NeurIPS 2025 · similarity 0.82)
• Lorentz-Equivariant Geometric Algebra Transformers for High-Energy Physics (NeurIPS 2024 · similarity 0.82)