HAL (France)
open access
Design and analysis of spectral graph neural networks : adaptive filtering, local topology, and generalization
Spectral Graph Neural Networks (GNNs) operate by filtering graph signals in the frequency domain. While highly successful, standard spectral models rely on global, low-degree polynomial filters. This design choice introduces three main limitations: it restricts spectral adaptivity on complex topolog
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
- Learning structural balance of graphs from quantum spectral features#673512
- ChronoSheaf: Joint Spatio-Temporal Spectral Filtering on Cellular Sheaves#1357613
- Complementary Supervised and Self-Supervised Representations for Out-of-Distribution Graph Learning#1217003
- Scaling Laws and Tradeoffs in Recurrent Networks of Expressive Neurons#1458313
- Spectral characterization of the uniform theta graph $Θ(t,2)$ and classification of 6-periodic Grover walks#985679
Record · ID 1492576
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