arXiv (All)
open access
Graph Hierarchical Recurrence for Long-Range Generalization
Graph Neural Networks and Graph Transformers have become central to graph learning, combining expressive representation learning with sample-efficient inductive biases. Yet they remain fundamentally limited when predictions depend on correlations between distant graph regions. We address this limita
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
- Self-Supervised Pretraining of Molecular Graph Encoders with LeJEPA#927561
- Advancing graph neural networks : addressing representation challenges in the vision domain#413324
- Graph Structure Learning with Temporal Graph Information Bottleneck for Inductive Representation Learning#1129101
- TopoCompress: Long Context Compression via Graph-Wired Semantic Trajectories#820699
Record · ID 1156361
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