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.

Failed on benchmark 2026

Poisson-Calibrated Candidate-Pool Scheduler

Replace a fixed number of randomly sampled continuous actions with a state-dependent candidate pool whose size is chosen from the predicted extreme-value error of the best candidate. If the local action deficit has order \(\|u-u^\star\|^\kappa\) in an effective dimension \(d\), the best sampled action has expected Bellman error proportional to \(N^{-\kappa/d}\). This gives an explicit stopping rule for increasing the pool only when the estimated residual action error is larger than the…

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Poisson Tangent Limits and Critical Policy Switching for Sampled Bellman Operators arXiv:2608.11549
Mechanism failed 2026

Reset-Integral Sliding Optimizer

Add a scalar integral/sliding variable and a resettable auxiliary state to parameter optimization. The sliding controller rejects bounded gradient perturbations, while resetting the auxiliary state prevents accumulated momentum or integral windup; the reset mechanism is designed not to alter the reaching dynamics of the sliding surface.

Useful7/10
Difficulty5/10
Novelty8/10
Paper: Input-to-State Stability of Reset-Integral Sliding Mode Control for Linear Systems arXiv:2608.03802
✓✓ Beats tuned baseline 2026

One-Bang Gradient-Noise Preparation

Use a bounded stochasticity control during an initial preparation window to shape the gradient or parameter-update distribution before ordinary training. The control is restricted to its minimum or maximum value, with at most one switch, because the reduced moment dynamics are affine in the control; this gives a falsifiable alternative to smooth noise or learning-rate annealing.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Optimal preparation and reachable-state constraints in the Mpemba effect arXiv:2607.12955