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 failed ML: Graph nn Math: Stochastic processes Clear all

✗ Mechanism failed 2026

Two-level local/coarse GNN training

Partition a large graph into induced subgraphs and perform most parameter updates using only local subgraphs, interleaving them with inexpensive global updates on a randomly subsampled coarse graph. The coarse correction preserves information about cross-partition dependencies while reducing full-graph message passing and communication cost.

Useful8/10

Difficulty5/10

Novelty6/10

Training Speedup Scalability Memory

Paper: Two-level domain-decomposition AdaGrad method for scalable training of graph neural networks arXiv:2608.22575

✗ Mechanism failed 2026

KS-Adaptive Graph Halting

Use the KS ratio to decide how many message-passing layers to execute per graph or per node, rather than selecting a fixed depth. In the subcritical regime, stop once the predicted remaining effect is below a tolerance; in the supercritical regime, continue until the observed logit change becomes small or a larger budget is reached.

Useful7/10

Difficulty5/10

Novelty5/10

Architecture Speedup Scalability Stability

Paper: The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy arXiv:2607.16676