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: verified Solves: Inference speedup ML: Graph nn Clear all

✗ Mechanism failed 2026

Regret-aware evidential cost compression

Attach an evidential cost head to a neural graph model, representing each edge cost by a weighted set of interval boxes, and compress this representation before the downstream shortest-path or routing solver. Instead of minimizing Jaccard or Jousselme distance between the original and compressed mass functions, choose merges that minimize the induced cost error on the currently selected route, while enforcing a conservative monotonicity condition so that the resulting path regret is bounded.

Useful7/10

Difficulty5/10

Novelty8/10

Architecture Accuracy Memory Inference speedup

Paper: Decision-Aware Approximation of Belief Functions for Evidential Combinatorial Optimization arXiv:2608.10650

△ Mechanism confirmed, baseline not beaten 2026

Star-Delta Hub Elimination

Remove a latent relay or hub token from an attention or graph layer and replace its two-hop influence by direct effective edges between retained tokens. The correction is a normalized rank-one update, so it can preserve hub-mediated communication while reducing the number of stored and processed states.

Useful7/10

Difficulty5/10

Novelty7/10

Memory Memory Inference speedup Scalability

Paper: The Invariant Measure of Multiscale Markov Chains via Fast Arborescence Factorization arXiv:2606.31596