Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
arXiv:2511.02272v3 Announce Type: replace-cross
Abstract: Probabilistic relaxations of graph cuts offer a differentiable alternative to spectral clustering, enabling end-to-end and online learning without eigendecompositions, yet prior work centered o…