A DNN trained on three nodes of one seed graph learns a local routing policy, GreedyTensile, that zero-shot generalizes across uniform random geometric graphs and outperforms greedy forwarding by up to 12%.
In: Classification, clustering, and data analysis: recent advances and applications, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Knowledge-Guided Machine Learning for Stabilizing Near-Shortest Path Routing
A DNN trained on three nodes of one seed graph learns a local routing policy, GreedyTensile, that zero-shot generalizes across uniform random geometric graphs and outperforms greedy forwarding by up to 12%.