Density Estimation on Compact Manifolds under Intrinsic Spectral Block Variation
arXiv:2608.12637
2026
Regularization
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper's transferable asset is spectral group sparsity defined over complete Laplace eigenspaces rather than individual eigenvectors. Grouping an entire repeated eigenspace makes the representation invariant to arbitrary rotations within degenerate eigenspaces, which is useful for spherical, rotational, mesh, and graph-based neural networks. A practical adaptation is a proximal spectral-block shrinkage layer that computes projectors onto Laplacian eigenspaces, applies one shared gate per block, and removes weak spectral levels without choosing a basis inside the block. This can produce compact geometric representations and reduce downstream computation, although the main engineering cost is estimating or storing spectral projectors.
Ideas from this paper
Unverified
2026
Insert a proximal layer after a graph, mesh, or spherical convolution that groups all coordinates belonging to the same Laplacian eigenspace and applies one shared shrinkage gate to the whole group. Unlike coefficientwise spectral pruning, the result is unchanged if the eigenvectors inside a repeated eigenspace are rotated, preventing arbitrary basis-dependent feature selection.
Useful6/10
Difficulty5/10
Novelty6/10