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.

✓✓ Beats tuned baseline 2026

Cyclic Lie-Bracket Residual Block

Replace one deterministic residual update with a short cyclic composition of learned vector fields evaluated for randomized, short run times. Because finite compositions of noncommuting flows generate directional-derivative and Lie-bracket terms, changing the cycle order gives the network an explicit, low-cost way to learn drift directions that are unavailable from the individual vector fields alone.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Diffusion limits of cyclic finite-velocity random motions along vector fields arXiv:2608.22514
Failed on benchmark 2026

Conditioned PSD sensing bottleneck

Represent an intermediate feature as a low-rank PSD matrix and compress it using nonnegative measurements \(\langle A_i,X\rangle\), while penalizing the empirical ratio between maximum and minimum measurement distortion over low-rank feature pairs. This directly discourages collapsed directions and excessively amplified directions in a covariance or Gram-feature bottleneck.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Optimal Condition Numbers in Low-Rank Positive Semidefinite Matrix Sensing arXiv:2608.22418
Mechanism confirmed, baseline not beaten 2026

Gramian-balanced neural SSM compression

Compress the hidden state of a stable neural state-space layer using low-rank controllability and observability Gramians. States that are difficult to excite from the input or weakly visible at the output are removed, producing a smaller recurrent state with a principled input-output preservation criterion.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: A New Generalized Low-Rank Cholesky Factor ADI Algorithm for Large-Scale Stein Equations arXiv:2608.22406
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
Failed on benchmark 2025

Log-Scale Self-Similar Activation

Replace a conventional scalar activation by a geometrically indexed family of affine pieces whose slope changes with the logarithmic magnitude of the input. The same two endpoint parameters are reused across all scales, giving a compact, explicitly scale-aware activation that can represent different responses for exponentially separated activation magnitudes.

Useful6/10
Difficulty4/10
Novelty7/10
Paper: From two-dimensional continuous maps to one-dimensional discontinuous maps: a novel reduction explaining complex bifurcation structures in piecewise-linear families of maps arXiv:2512.02291