J Zico Kolter, Po-Wei Wang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Modularity maximization has been a fundamental tool for understanding the community structure of a network, but the underlying optimization problem is nonconvex and NP-hard to solve. State-of-the-art algorithms like the Louvain or Leiden methods focus on different heuristics to help escape local optima, but they still depend on a greedy step that moves node assignment locally and is prone to getting trapped. In this paper, we propose a new class of low-cardinality algorithm that generalizes the local update to maximize a semidefinite relaxation derived from max-k-cut. This proposed algorithm is scalable, empirically achieves the global semidefinite optimality for small cases, and outperforms the state-of-the-art algorithms in real-world datasets with little additional time cost. From the algorithmic perspective, it also opens a new avenue for scaling-up semidefinite programming when the solutions are sparse instead of low-rank.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2012.02676")
get_code_for_paper("2012.02676")
have("2012.02676")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2012.02676.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2012.02676)
Connect an agent — have() is free.