FeLoG achieves 27.9x average speedup and over 53% communication reduction in distributed graph embedding by using feedback-coupled sampling, activity-aware communication, and round-interleaved pipelining.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
FeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism
FeLoG achieves 27.9x average speedup and over 53% communication reduction in distributed graph embedding by using feedback-coupled sampling, activity-aware communication, and round-interleaved pipelining.