Seed-architecture expansion via Kendall-tau subgraph matching and entropy-guided node splitting scales graph neural architecture search to billion-edge graphs in about 8 GPU hours.
Large-scale graph neural architecture search,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
SA-GNAS: Seed Architecture Expansion for Efficient Large-scale Graph Neural Architecture Search
Seed-architecture expansion via Kendall-tau subgraph matching and entropy-guided node splitting scales graph neural architecture search to billion-edge graphs in about 8 GPU hours.