arXiv (All)
open access
EDiS: Edge Disjoint Subgraph Sparsification Framework for Graph Neural Networks
Sparse GNN training reduces computation, but deciding which edges to keep can be costly. Reusing one sparse graph is cheap, but locks training to a fixed topology, while varying it across epochs can require repeated sampling or recomputation. We introduce EDiS (Edge-Disjoint Subgraph sparsification
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
- Reforge: Low-Latency Distributed GNN Serving with Selective Embedding Recomputation#1049613
- Half-Hop: A graph upsampling approach for slowing down message passing#1199613
- Sparsification Framework for Directed Densest Subgraph#1155781
- Fast and Simple Densest Subgraph with Predictions#144294
- Explaining Graph Neural Networks with Mixed-Integer Programming#416123
Record · ID 1233098
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