△ Mechanism confirmed, baseline not beaten
2026
Track a symmetry-asymmetry functional of network outputs or hidden states under a chosen transformation or channel and estimate which relaxation modes control its late-time decay. Use a short warm-up trajectory to suppress the slow asymmetry mode while allowing larger initial asymmetry in faster modes, producing a training trajectory that can overtake a nominally better-initialized trajectory. This transfers the paper's quantum Mpemba effect as a mode-overlap principle rather than requiring an…
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace purely Gaussian optimizer noise with symmetric alpha-stable jumps and add a restoring drift toward an exponential-moving-average parameter anchor. The drift prevents persistent parameter diffusion, while heavy-tailed jumps provide rare, large excursions that can cross sharp basin barriers and remain effective when gradient-noise variance is undefined.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Mechanism failed
2026
Wrap a neural policy or neural dynamics model in a short-horizon predictive optimizer that enforces explicit bounds on a learned interaction variable before applying the next action. This separates disturbance rejection and tracking from safety: the network may propose aggressive corrections, but the optimizer projects them onto actions whose predicted force, state, and actuator trajectories remain feasible.
Useful7/10
Difficulty6/10
Novelty5/10
✗ Failed on benchmark
2026
Augment a neural recurrent or state-space model with an explicit slowly varying disturbance state that absorbs contact effects, friction, hysteresis, actuator mismatch, and other systematic residuals. The network predicts nominal dynamics, while the disturbance channel provides offset-free correction without forcing the main model to memorize every operating-condition-dependent bias.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Failed on benchmark
2026
Replace the usual parameter-plus-momentum Langevin state with a three-level chain consisting of parameters, velocity, and acceleration, while injecting Gaussian noise only into the highest auxiliary state. At a saddle, the escaping direction has a positive rate given by a cubic characteristic equation; use this rate to choose damping or adapt the temperature so that basin escape is accelerated without making the dynamics unstable.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Replace an unconstrained recurrent transition or latent ODE vector field with a port-Hamiltonian update whose metric is positive definite and whose interaction operator is skew-symmetric. Use an implicit midpoint step so the quadratic latent energy is preserved exactly in the unforced, constant-metric case, preventing long-horizon drift while retaining learnable nonlinear interactions.
Useful7/10
Difficulty5/10
Novelty5/10
✗ Failed on benchmark
2026
Train a latent recurrent or state-space model with separate equilibrium and source-sink transition matrices instead of forcing one transition matrix to explain all latent dynamics. Use the equilibrium matrix for stationary occupancy and reversible statistics, and use a recycling matrix for directed hitting times, committors, and source-to-target flow; this should remove fixed-lag coarse-graining bias in latent world models.
Useful7/10
Difficulty6/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Estimate the leading complex resonances of the noise-averaged hidden-state dynamics of a stochastic RNN and use them to detect or control statistically persistent oscillations. The key design principle is to treat resonance radius and Lyapunov growth as independent signals: hidden trajectories can be Lyapunov-stable while the annealed dynamics still produce narrow-band ringing because a transfer-operator eigenvalue lies close to the unit circle.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Wrap a recurrent or state-space neural network in a sampled-data feedback loop: latent states evolve continuously or at every fine solver step, while a constrained optimizer updates the control, adapter, or residual-gating vector only every M steps. Between optimizer updates, use zero-order hold or linear interpolation and reject updates that violate a learned Lyapunov decrease condition. This should prevent large transient latent explosions caused by aggressive optimizer updates while…
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Insert a slow routing state and an intermediate hysteresis variable between a neural memory and its next-state selector. The hysteresis prevents small prediction fluctuations from repeatedly changing the active attractor, while the slower router learns transition probabilities independently of the attractor parameters.
Useful7/10
Difficulty5/10
Novelty6/10
✓✓ Beats tuned baseline
2026
Replace an unconstrained linear recurrent update with a two-dimensional oscillator state per hidden feature and use amplitude-dependent damping: negative damping below a target radius and positive damping above it. The cell should preserve phase information over long sequences while preventing hidden-state explosion or collapse.
Useful7/10
Difficulty5/10
Novelty6/10
△ Mechanism confirmed, baseline not beaten
2026
Use the paper's localized truncation residual as an online certificate for whether the current polynomial lift is expressive enough. Start with a low-degree edge lift and activate additional degree blocks or a learned closure only when the residual exceeds a calibrated threshold, avoiding the cost and instability of always using a large polynomial dictionary.
Useful7/10
Difficulty4/10
Novelty8/10
✓✓ Beats tuned baseline
2026
Replace full-history backpropagation through time for an online recurrent or state-space neural network with a fixed-length batch protocol. An encoder maps the most recent input-output window to the latent state at the beginning of each batch, after which the learned dynamics are rolled forward and updated recursively from the new batch only. This should prevent state drift across long streams while retaining adaptation to changing dynamics.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Train a recurrent or state-space network together with a periodic hidden-state trajectory, then use the Fourier-domain Hill operator of its linearized dynamics to penalize positive Floquet growth rates. The method can retain algebraic hidden-state constraints, avoiding the inaccurate practice of treating a singular descriptor matrix as invertible.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Partition optimizer state space into regions and assign each region a different update rule, such as two learning rates, momentum values, or preconditioners. Fit the local radial normal form of the resulting piecewise-smooth training dynamics and switch to the branch whose first nonzero coefficient predicts contraction toward the stationary point.
Useful7/10
Difficulty6/10
Novelty8/10
△ Mechanism confirmed, baseline not beaten
2026
Replace repeated iterations of an expensive high-dimensional update S with iterations of a lower-dimensional latent map T, then decode the resulting latent state with D. Train E, D, and T with explicit intertwining losses so that encoding a full update agrees with updating the latent state, and decoding a latent update agrees with applying the original update.
Useful7/10
Difficulty6/10
Novelty6/10
✗ Failed on benchmark
2026
Replace a stationary optimizer by a periodic two- or multi-phase schedule, such as alternating large and small learning rates, SGD and momentum, or gradients from different loss components. Stability is assessed over the complete period using the product of phase-wise linearized update maps, allowing a phase that is individually expansive to be safely combined with a contracting phase.
Useful7/10
Difficulty5/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace a continuously saturated recurrent state or optimizer momentum variable by a ternary state s in {-1, 0, +1} governed by a mean-field Blume-Emery-Griffiths energy, and use annealed random fields as a controllable disorder parameter. The system should exhibit multiple persistent attractors below a critical noise amplitude and substantially reduced initial-condition dependence above it. This creates a measurable noise schedule: increase disorder until independent runs converge to the same…
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Insert a finite-resolution observation channel between minibatch statistics and the optimizer update, then distinguish information that predicts useful future loss reduction from information that is present in the gradient but has no control value. Use the actionable representation to select the update and suppress increasingly fine, noisy measurements that do not improve progress.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Failed on benchmark
2026
Use the q-fractional characteristic equation as an online trust-region controller for recurrent gain or residual-memory strength. Instead of allowing the recurrent Jacobian to cross the unit-circle boundary, estimate the dominant characteristic root and rescale the feedback gain whenever it approaches modulus one.
Useful7/10
Difficulty5/10
Novelty6/10
✗ Mechanism failed
2026
Treat parameter-space curvature modes as RG momentum shells and use a smooth cutoff to construct a scale-dependent preconditioner rather than abruptly clipping eigenmodes. The optimizer should expose measurable crossovers between overdamped, KPZ-like, and nearly inviscid relaxation, allowing the learning rate and damping to change at empirically detected transitions instead of following a fixed schedule.
Useful7/10
Difficulty6/10
Novelty7/10
△ Mechanism confirmed, baseline not beaten
2026
Replace ordinary momentum-like accumulation with a PI controller whose integral state is reset when the proportional error changes sign, indicating that the trajectory has crossed its local target. Apply the mechanism to each parameter block or to a scalar block residual, and impose a dwell time so that minibatch noise cannot trigger arbitrarily frequent resets.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Add a learned phase coordinate to an RNN, state-space model, or latent neural ODE and train it to advance at constant angular velocity along recurrent trajectories. This separates genuine phase progression from amplitude and embedding distortions, encouraging coherent long-horizon oscillations while providing a quantitative monitor for impending loss of a limit cycle.
Useful7/10
Difficulty5/10
Novelty7/10
✗ Failed on benchmark
2026
Turn a path-complete graph into a stability regularizer for a recurrent or state-space neural network whose update can switch among M learned operators. Maintain a neural quadratic or positive scalar certificate V_alpha for each graph node and penalize every graph edge that violates contraction under its corresponding operator. The resulting architecture is designed to remain stable even when the mode sequence is arbitrary rather than generated by a trained gate.
Useful7/10
Difficulty6/10
Novelty8/10