Research ideas

Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.

2 ideas found

Status: Mechanism works Solves: Scalability ML: Graph nn Clear all

✓ Mechanism works 2026

Dirichlet-to-Neumann Graph Pooling

Replace a large graph submodule by a compact boundary response operator that maps boundary node features to induced boundary fluxes after the interior has been eliminated. Stack these operators recursively to obtain a hierarchical graph neural network whose coarse-level computation preserves long-range effects of discarded vertices more faithfully than average pooling or simple node clustering.

Useful7/10

Difficulty6/10

Novelty6/10

Architecture Memory Scalability Accuracy

Paper: Gluing Formula for the Pseudo-Determinant of Graph Laplacian and Applications to Counting of Spanning Trees arXiv:2608.26458

✓ Mechanism works 2026

Degree-Corrected Hierarchical Router

Replace a flat MoE or graph-pooling assignment with recursive partitions selected by interaction evidence after removing each item’s expected degree effect. Tokens, nodes, or examples that are frequently active for purely popularity-related reasons should not automatically form an expert or cluster. Recursion stops when a candidate split has nonpositive degree-corrected evidence, producing an adaptive hierarchy rather than a fixed number of equally sized groups.

Useful6/10

Difficulty6/10

Novelty7/10

Architecture Accuracy Stability Scalability

Paper: Community structure of the pseudofractal web arXiv:2607.03010