arXiv (All)
open access
Random Probing for Structural Self-Interactions in Graph Neural Networks
Graph Neural Networks (GNNs) fundamentally lack the ability to capture structural properties defined by node self-interactions, such as cycle counts, subgraph centrality, and heat kernel signatures. Existing solutions often rely on computationally expensive higher-order architectures or hand-crafted
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
- Topological Uncertainty: Monitoring Trained Neural Networks through Persistence of Activation Graphs#478184
- Beyond Trained Models: Compiling GNNs for a Sound Explainer Benchmark#1188204
- Beyond Trained Models: Compiling GNNs for a Sound Explainer Benchmark#1181645
- RACE: Relation-Level Counterfactual Explanations for Heterogeneous Graph Neural Networks#1141963
- Dropout Neural Network Training Viewed from a Percolation Perspective#1049720
Record · ID 1343681
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