arXiv (All)
open access
From Complex Histories to Simple Predictors: Predictive Dimension in Dynamic Graph Learning
Existing continuous-time graph learning methods rely heavily on complex neural architectures to encode ever-expanding interaction histories. However, the future conditional distribution induced by complex histories can often be characterized by a low-dimensional predictive state manifold, implying t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Plain Transformers are Surprisingly Powerful Link Predictors#1118471
- Enhancing Distance-Based Graph Autoencoders with Structural Penalties for Dynamic Graph Embedding#1217546
- RD-JEPA: Predictive latent pretraining for few-trajectory transfer across reaction--diffusion equations#1077332
- RAFT: Redundancy-Aware Input Filtering for Temporal Graph Neural Network Training#1389821
- Understanding Latent-Dimension Scaling in Dynamical-System Learning through Spectral Reliability#1249146
Record · ID 1412065
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive