Sheaf-ADMM trains multi-agent systems by unrolling ADMM with sheaf-specified constraints, yielding improved MNIST robustness to shifts and higher Sudoku solve rates than MPNN baselines.
Learning sheaf laplacians from smooth signals
2 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2roles
other 1polarities
unclear 1representative citing papers
HilbNets define convolutions via Hilbert bundle connection Laplacians, prove that sampled Hilbert cellular sheaf Laplacians converge to the continuous operator, and show that discretized networks are consistent and transferable across samplings.
citing papers explorer
-
Learning Multi-Agent Coordination via Sheaf-ADMM
Sheaf-ADMM trains multi-agent systems by unrolling ADMM with sheaf-specified constraints, yielding improved MNIST robustness to shifts and higher Sudoku solve rates than MPNN baselines.
-
Consistent Geometric Deep Learning via Hilbert Bundles and Cellular Sheaves
HilbNets define convolutions via Hilbert bundle connection Laplacians, prove that sampled Hilbert cellular sheaf Laplacians converge to the continuous operator, and show that discretized networks are consistent and transferable across samplings.