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.

Mechanism confirmed, baseline not beaten 2026

Assignment Tree Attention

Construct a sparse attention support by solving multiple small perturbed assignment problems between query and key embeddings and taking the union of the selected optimal matchings. Use the resulting spanning tree as the only set of cross-token edges, with edge biases determined by empirical assignment frequency.

Useful6/10
Difficulty7/10
Novelty7/10
Paper: Spanning trees in the Assignment Problem: two theorems and two conjectures arXiv:2608.22308
Mechanism failed 2026

Log-Hölder Lyapunov Trust Region

Treat a recurrent or state-space layer as a finite-state Markov cocycle and constrain optimizer steps using the paper's inverse-logarithmic sensitivity of Lyapunov exponents near a zero exponent gap. Instead of enforcing a crude spectral-norm bound, allow updates that are harmless for long-run growth while shrinking steps that could substantially change the recurrent stability profile.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Log-Höder continuity at zero Lyapunov gap for finite state Markov $GL(2)$-cocycles arXiv:2608.22157
Failed on benchmark 2026

Laplace-Heterogeneous MoE Routing

Replace the usual hand-designed expert-load penalty with a heterogeneous survival penalty derived from a susceptibility distribution. Each expert receives an availability factor q_e=G(A_e), where A_e is its cumulative recent routing pressure and G_e is a learned or fixed mixture of exponentials; highly used experts are suppressed smoothly, while heterogeneous experts can have different resistance to pressure. The mixture produces adaptive curvature and long-tailed penalties that may reduce…

Useful6/10
Difficulty4/10
Novelty6/10
Paper: From Individual-Based Stochastic Epidemics to Heterogeneous SIR Equations arXiv:2608.22122
Failed on benchmark 2026

Fourier Replay-Mode Stabilizer

Regularize a circular recurrent kernel by directly controlling the growth rate and phase velocity of its Fourier modes. This converts replay-speed selection into a low-dimensional spectral control problem and can suppress unstable or excessively slow modes without adding recurrent parameters.

Useful6/10
Difficulty6/10
Novelty8/10
Paper: Forward and reverse delay-driven hippocampal replay without symmetric plasticity arXiv:2608.21814
Mechanism failed 2026

Spectral-Pole-Tuned Decentralized Optimizer

Choose the consensus gain and gradient-tracking gain in decentralized training from the communication Laplacian spectrum rather than tuning them independently. The gains minimize the worst asymptotic pole radius for the paper's exact quadratic model, providing a principled initialization and a conservative stability safeguard for neural-network optimization.

Useful6/10
Difficulty6/10
Novelty6/10
Paper: Optimal Parameter Design for DIGing on Minimizing Unweighted Sum of Squares arXiv:2607.25463
Mechanism confirmed, baseline not beaten 2025

Cohomological Jacobian Flattening

Regularize a neural dynamical map so that its log-volume expansion is cohomologous to a constant rather than forcing the Jacobian determinant to be constant at every state. Learn a scalar potential that explains transient expansion and penalize only the non-telescoping component, which should reduce long-horizon gradient explosion or collapse while retaining useful average expansion.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Entropy rigidity of $u$-Gibbs measures arXiv:2512.02307