Collapsed Effective Operators for Higher-order Structures
About
Higher-order structures are powerful relational modeling tools, yet existing spectral operators decompose the topology into separate ranks, leaving practitioners to fuse the information back to vertices through ad hoc choices. We introduce Collapsed Effective Operators, which condense higher-order degrees of freedom into a single vertex-level operator via Schur complementation of a graded Laplacian. This yields a (generally dense) operator that encodes long-range interactions mediated by topology and is applicable to arbitrary higher-order constructs. We show it preserves positive semi-definiteness with a spectral upper bound relative to the rank-0 Hodge Laplacian, effectively lowering system energy under higher-order connectivity. Empirically, our operator improves spectral clustering, signal smoothing, and enables the inclusion of topological features in neural network architectures via positional encoding. The project page can be found http://circle-group.github.io/research/CollapsedEffectiveOperators
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Betti number prediction | Mantra 2-M^0 | Beta 0 Accuracy100 | 15 | |
| Transductive Node Classification | Protein molecular structures Contact | Accuracy57.3 | 6 | |
| Transductive Node Classification | Protein molecular structures ResType | Accuracy78.9 | 6 | |
| Graph Clustering | Football | Clustering Accuracy50 | 3 | |
| Graph Clustering | Misérables | Clustering Accuracy66 | 3 | |
| Manifold Denoising | Random geometric graphs 100 shortcut edges | MSE0.074 | 3 | |
| Manifold Denoising | Random geometric graphs 150 shortcut edges | MSE0.072 | 3 | |
| Manifold Denoising | Random geometric graphs 200 shortcut edges | MSE0.073 | 3 | |
| Spectral Partitioning | SBM Den: Dense-Cliques | Clustering Accuracy98 | 3 | |
| Spectral Partitioning | SBM +N: Cliques+Noise | Clustering Accuracy84 | 3 |