arXiv (All)
open access
Beyond Fixed Features: Architecture-Dependent Sensitivity to Node Representations under Heterophily
Graph Neural Networks (GNNs) perform well on homophilic graphs but struggle in heterophilic settings, where connected nodes often carry dissimilar labels. Existing evaluations typically compare architectures under a fixed node-feature representation, leaving unclear whether conclusions about heterop
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
- Advancing graph neural networks : addressing representation challenges in the vision domain#413324
- Node-wise Feature Encoding for Neural Performance Prediction#781085
- Node-wise Feature Encoding for Neural Performance Prediction#779710
- Plain Transformers are Surprisingly Powerful Link Predictors#1118471
- Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation#1117641
Record · ID 1118837
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