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

Certified Temporal Budget for Neural Control

Attach a learned controller to a physical or simulated plant and use a continuous safety certificate to compute a conservative remaining-time budget before the current action or latent prediction can become unsafe. Compile this spatial margin into a unit-rate temporal contract, allowing asynchronous inference, batching, or early execution without online rollout integration; trigger a new network evaluation only when the countdown reaches a guard threshold.

Useful7/10
Difficulty5/10
Novelty8/10
Paper: Compiling Spatial Certificates into Temporal Contracts for Latency-Aware Control arXiv:2608.25228
✗ Failed on benchmark 2026

LQ-Compressed LPV Latent Rollouts

Replace a neural sequence model's unconstrained multi-step latent rollout with a data-driven LPV predictor acting on a learned latent state. Build the predictor from Hankel matrices of past latent observations, inputs, and scheduling features, then use an LQ factorization to project the large data coefficient matrix into a fixed-dimensional coordinate system. The model preserves scheduling-conditioned dynamics while making rollout cost independent of the number of training trajectories.

Useful7/10
Difficulty6/10
Novelty6/10
Paper: A subspace approach to data-driven predictive control for linear parameter-varying systems arXiv:2607.28490
Unverified 2026

Finite-Orbit Circulant State Core

Replace the linear state transition in a small recurrent or state-space module by a circulant matrix acting on a vector over a finite field. The hidden state then has only finitely many possible values and follows an exactly periodic orbit after at most \(q^n\) states, eliminating numerical drift on modular-counting and symbolic-memory tasks. A learned real-valued encoder and decoder can surround the discrete core, while the transition itself is fixed, searched, or trained with a…

Useful6/10
Difficulty6/10
Novelty8/10
Paper: Periodicities in the Riordan arrays of polynomials over finite fields arXiv:2607.13442
△ 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
Unverified 2026

WKB-Stokes Sparse Mixer

Replace a dense channel-mixing matrix in a sequence layer with alternating diagonal propagation and sparse unipotent Stokes jumps. The diagonal part carries independently controlled exponential phases, while the unipotent factors implement cheap residual-like mode conversion without changing determinant or requiring a dense matrix multiply. Constrain the phase magnitudes and jump coefficients during training to obtain a reversible, norm-monitorable mixer.

Useful5/10
Difficulty4/10
Novelty7/10
Paper: Holonomy Asymptotics along Quartic Differential Rays arXiv:2608.04729
Unverified 2026

Polynomial Spectral Mode Controller

Replace an eigendecomposition-based spectral controller in a small recurrent or state-space transition layer with explicit polynomial projectors. Each hidden state is split into invariant modes, and each mode receives a separately constrained recurrent multiplier, enabling direct suppression of unstable modes or selective retention of long-memory modes using only matrix-polynomial evaluations.

Useful5/10
Difficulty6/10
Novelty6/10
Paper: A Direct Polynomial Approach to Spectral Decomposition arXiv:2607.20218