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

Solves: Inference speedup ML: Graph nn Math: Geometry 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

Unverified 2026

Orientation-consistent adaptive tetrahedral neural field

Represent a 3D neural field using high-order polynomial coefficients attached to an adaptively refined tetrahedral mesh, with a small MLP predicting residual corrections from local coordinates. Refine only tetrahedra whose prediction, rendering, or PDE residual is large, and use globally ordered vertices so neighboring tetrahedra share identical face and edge coefficients without hanging-node constraint solves.

Useful6/10

Difficulty6/10

Novelty7/10

Architecture Memory Accuracy Inference speedup

Paper: An $h$-adaptive Tetrahedral Spectral Element Method with Applications to Kohn-Sham Density Functional Theory arXiv:2608.14006