NOPE coarsens graphs via neighborhood interference rather than selfish pairwise matching to reach linear memory and near-linear time, with NOPE* variant delivering 1.8-10x speedups and comparable or better learning results than full graphs or LLM reasoning.
A unified frame- work for optimization-based graph coarsening.Journal of Machine Learning Research, 24(118):1–50, 2023a
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle
NOPE coarsens graphs via neighborhood interference rather than selfish pairwise matching to reach linear memory and near-linear time, with NOPE* variant delivering 1.8-10x speedups and comparable or better learning results than full graphs or LLM reasoning.